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.6.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:16:18,905 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:16:18,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:16:18,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:16:18,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:16:18,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:16:18,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:16:18,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:16:18,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:16:18,950 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:16:18,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:16:18,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:16:18,955 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:16:18,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:16:18,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:16:18,961 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:16:18,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:16:18,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:16:18,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:16:18,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:16:18,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:16:18,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:16:18,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:16:18,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:16:18,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:16:18,984 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:16:18,984 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:16:18,985 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:16:18,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:16:18,986 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:16:18,987 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:16:18,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:16:18,988 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:16:18,989 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:16:18,990 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:16:18,990 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:16:18,991 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:16:18,991 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:16:18,991 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:16:18,992 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:16:18,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:16:18,993 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:16:19,007 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:16:19,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:16:19,008 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:16:19,008 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:16:19,009 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:16:19,009 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:16:19,009 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:16:19,010 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:16:19,010 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:16:19,010 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:16:19,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:16:19,011 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:16:19,011 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:16:19,011 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:16:19,011 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:16:19,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:16:19,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:16:19,012 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:16:19,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:16:19,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:16:19,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:16:19,015 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:16:19,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:16:19,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:16:19,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:16:19,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:16:19,017 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:16:19,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:16:19,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:16:19,018 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:16:19,065 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:16:19,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:16:19,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:16:19,083 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:16:19,084 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:16:19,084 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-10 08:16:19,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5a9ef05/c9bd25b09a594109bc90e6943100896a/FLAGfe0a7c213 [2019-09-10 08:16:19,807 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:16:19,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-10 08:16:19,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5a9ef05/c9bd25b09a594109bc90e6943100896a/FLAGfe0a7c213 [2019-09-10 08:16:19,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac5a9ef05/c9bd25b09a594109bc90e6943100896a [2019-09-10 08:16:19,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:16:19,932 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:16:19,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:16:19,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:16:19,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:16:19,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:16:19" (1/1) ... [2019-09-10 08:16:19,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45625c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:19, skipping insertion in model container [2019-09-10 08:16:19,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:16:19" (1/1) ... [2019-09-10 08:16:19,951 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:16:20,130 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:16:21,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:16:21,572 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:16:22,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:16:22,223 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:16:22,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:22 WrapperNode [2019-09-10 08:16:22,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:16:22,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:16:22,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:16:22,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:16:22,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:22" (1/1) ... [2019-09-10 08:16:22,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:22" (1/1) ... [2019-09-10 08:16:22,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:22" (1/1) ... [2019-09-10 08:16:22,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:22" (1/1) ... [2019-09-10 08:16:22,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:22" (1/1) ... [2019-09-10 08:16:22,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:22" (1/1) ... [2019-09-10 08:16:22,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:22" (1/1) ... [2019-09-10 08:16:22,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:16:22,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:16:22,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:16:22,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:16:22,444 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:22" (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:16:22,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:16:22,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:16:22,522 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:16:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:16:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:16:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:16:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:16:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:16:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:16:22,524 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:16:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:16:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:16:22,525 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:16:22,526 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:16:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:16:22,527 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:16:22,528 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:16:22,528 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:16:22,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:16:22,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:16:22,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:16:26,650 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:16:26,650 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:16:26,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:16:26 BoogieIcfgContainer [2019-09-10 08:16:26,653 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:16:26,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:16:26,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:16:26,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:16:26,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:16:19" (1/3) ... [2019-09-10 08:16:26,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106126be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:16:26, skipping insertion in model container [2019-09-10 08:16:26,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:16:22" (2/3) ... [2019-09-10 08:16:26,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106126be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:16:26, skipping insertion in model container [2019-09-10 08:16:26,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:16:26" (3/3) ... [2019-09-10 08:16:26,665 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c.v+lhb-reducer.c [2019-09-10 08:16:26,676 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:16:26,708 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 22 error locations. [2019-09-10 08:16:26,728 INFO L252 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2019-09-10 08:16:26,759 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:16:26,759 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:16:26,759 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:16:26,759 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:16:26,760 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:16:26,760 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:16:26,760 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:16:26,760 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:16:26,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states. [2019-09-10 08:16:26,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:16:26,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:26,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] [2019-09-10 08:16:26,855 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:26,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:26,862 INFO L82 PathProgramCache]: Analyzing trace with hash -2055427449, now seen corresponding path program 1 times [2019-09-10 08:16:26,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:26,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:26,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:26,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:27,695 INFO 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:16:27,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:27,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:16:27,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:27,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:16:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:16:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:16:27,811 INFO L87 Difference]: Start difference. First operand 1136 states. Second operand 5 states. [2019-09-10 08:16:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:28,933 INFO L93 Difference]: Finished difference Result 891 states and 1537 transitions. [2019-09-10 08:16:28,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:16:28,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-09-10 08:16:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:28,957 INFO L225 Difference]: With dead ends: 891 [2019-09-10 08:16:28,957 INFO L226 Difference]: Without dead ends: 879 [2019-09-10 08:16:28,959 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:16:28,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-09-10 08:16:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 879. [2019-09-10 08:16:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2019-09-10 08:16:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1128 transitions. [2019-09-10 08:16:29,058 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1128 transitions. Word has length 90 [2019-09-10 08:16:29,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:29,059 INFO L475 AbstractCegarLoop]: Abstraction has 879 states and 1128 transitions. [2019-09-10 08:16:29,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:16:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1128 transitions. [2019-09-10 08:16:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:16:29,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:29,069 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] [2019-09-10 08:16:29,071 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:29,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:29,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1438447416, now seen corresponding path program 1 times [2019-09-10 08:16:29,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:29,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:29,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:29,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:29,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:29,362 INFO 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:16:29,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:29,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:16:29,364 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:29,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:16:29,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:16:29,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:16:29,368 INFO L87 Difference]: Start difference. First operand 879 states and 1128 transitions. Second operand 5 states. [2019-09-10 08:16:30,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:30,140 INFO L93 Difference]: Finished difference Result 754 states and 986 transitions. [2019-09-10 08:16:30,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:16:30,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-10 08:16:30,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:30,145 INFO L225 Difference]: With dead ends: 754 [2019-09-10 08:16:30,145 INFO L226 Difference]: Without dead ends: 754 [2019-09-10 08:16:30,150 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:16:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-10 08:16:30,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-09-10 08:16:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-09-10 08:16:30,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 986 transitions. [2019-09-10 08:16:30,175 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 986 transitions. Word has length 91 [2019-09-10 08:16:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:30,177 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 986 transitions. [2019-09-10 08:16:30,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:16:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 986 transitions. [2019-09-10 08:16:30,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:16:30,180 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:30,180 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] [2019-09-10 08:16:30,181 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:30,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:30,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1744743141, now seen corresponding path program 1 times [2019-09-10 08:16:30,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:30,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:30,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:30,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:30,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:30,388 INFO 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:16:30,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:30,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:16:30,389 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:30,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:16:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:16:30,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:16:30,395 INFO L87 Difference]: Start difference. First operand 754 states and 986 transitions. Second operand 5 states. [2019-09-10 08:16:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:31,135 INFO L93 Difference]: Finished difference Result 696 states and 919 transitions. [2019-09-10 08:16:31,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:16:31,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-09-10 08:16:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:31,140 INFO L225 Difference]: With dead ends: 696 [2019-09-10 08:16:31,140 INFO L226 Difference]: Without dead ends: 696 [2019-09-10 08:16:31,140 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:16:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-09-10 08:16:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2019-09-10 08:16:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-09-10 08:16:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 919 transitions. [2019-09-10 08:16:31,157 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 919 transitions. Word has length 92 [2019-09-10 08:16:31,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:31,158 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 919 transitions. [2019-09-10 08:16:31,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:16:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 919 transitions. [2019-09-10 08:16:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:16:31,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:31,161 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] [2019-09-10 08:16:31,162 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:31,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:31,162 INFO L82 PathProgramCache]: Analyzing trace with hash 986983178, now seen corresponding path program 1 times [2019-09-10 08:16:31,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:31,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:31,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:31,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:31,449 INFO 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:16:31,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:31,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:16:31,450 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:31,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:16:31,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:16:31,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:16:31,451 INFO L87 Difference]: Start difference. First operand 696 states and 919 transitions. Second operand 5 states. [2019-09-10 08:16:32,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:32,231 INFO L93 Difference]: Finished difference Result 670 states and 888 transitions. [2019-09-10 08:16:32,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:16:32,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-10 08:16:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:32,236 INFO L225 Difference]: With dead ends: 670 [2019-09-10 08:16:32,236 INFO L226 Difference]: Without dead ends: 670 [2019-09-10 08:16:32,237 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:16:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-09-10 08:16:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-09-10 08:16:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-09-10 08:16:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 888 transitions. [2019-09-10 08:16:32,252 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 888 transitions. Word has length 93 [2019-09-10 08:16:32,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:32,253 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 888 transitions. [2019-09-10 08:16:32,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:16:32,253 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 888 transitions. [2019-09-10 08:16:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:16:32,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:32,257 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] [2019-09-10 08:16:32,258 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:32,258 INFO L82 PathProgramCache]: Analyzing trace with hash 925768771, now seen corresponding path program 1 times [2019-09-10 08:16:32,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:32,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:32,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:32,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:32,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:32,433 INFO 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:16:32,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:32,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:16:32,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:32,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:16:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:16:32,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:16:32,436 INFO L87 Difference]: Start difference. First operand 670 states and 888 transitions. Second operand 5 states. [2019-09-10 08:16:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:33,057 INFO L93 Difference]: Finished difference Result 651 states and 866 transitions. [2019-09-10 08:16:33,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:16:33,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-10 08:16:33,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:33,062 INFO L225 Difference]: With dead ends: 651 [2019-09-10 08:16:33,062 INFO L226 Difference]: Without dead ends: 651 [2019-09-10 08:16:33,063 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:16:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-09-10 08:16:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 651. [2019-09-10 08:16:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2019-09-10 08:16:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 866 transitions. [2019-09-10 08:16:33,080 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 866 transitions. Word has length 94 [2019-09-10 08:16:33,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:33,081 INFO L475 AbstractCegarLoop]: Abstraction has 651 states and 866 transitions. [2019-09-10 08:16:33,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:16:33,081 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 866 transitions. [2019-09-10 08:16:33,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:16:33,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:33,083 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] [2019-09-10 08:16:33,084 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:33,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:33,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2129638404, now seen corresponding path program 1 times [2019-09-10 08:16:33,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:33,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:33,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:33,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:33,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:33,329 INFO 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:16:33,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:33,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:16:33,330 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:33,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:16:33,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:16:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:16:33,332 INFO L87 Difference]: Start difference. First operand 651 states and 866 transitions. Second operand 5 states. [2019-09-10 08:16:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:34,209 INFO L93 Difference]: Finished difference Result 646 states and 859 transitions. [2019-09-10 08:16:34,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:16:34,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-10 08:16:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:34,220 INFO L225 Difference]: With dead ends: 646 [2019-09-10 08:16:34,220 INFO L226 Difference]: Without dead ends: 646 [2019-09-10 08:16:34,220 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:16:34,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-09-10 08:16:34,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 646. [2019-09-10 08:16:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:16:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 859 transitions. [2019-09-10 08:16:34,234 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 859 transitions. Word has length 95 [2019-09-10 08:16:34,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:34,235 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 859 transitions. [2019-09-10 08:16:34,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:16:34,235 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 859 transitions. [2019-09-10 08:16:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:16:34,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:34,237 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] [2019-09-10 08:16:34,238 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash -631577471, now seen corresponding path program 1 times [2019-09-10 08:16:34,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:34,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:34,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:34,502 INFO 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:16:34,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:34,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:16:34,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:34,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:16:34,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:16:34,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:16:34,504 INFO L87 Difference]: Start difference. First operand 646 states and 859 transitions. Second operand 8 states. [2019-09-10 08:16:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:35,996 INFO L93 Difference]: Finished difference Result 869 states and 1107 transitions. [2019-09-10 08:16:35,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:16:35,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-09-10 08:16:35,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:36,002 INFO L225 Difference]: With dead ends: 869 [2019-09-10 08:16:36,002 INFO L226 Difference]: Without dead ends: 869 [2019-09-10 08:16:36,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:16:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2019-09-10 08:16:36,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 646. [2019-09-10 08:16:36,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:16:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 858 transitions. [2019-09-10 08:16:36,020 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 858 transitions. Word has length 96 [2019-09-10 08:16:36,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:36,020 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 858 transitions. [2019-09-10 08:16:36,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:16:36,021 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 858 transitions. [2019-09-10 08:16:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:16:36,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:36,023 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] [2019-09-10 08:16:36,024 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash -938716295, now seen corresponding path program 1 times [2019-09-10 08:16:36,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:36,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:36,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:36,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:16:36,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:36,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:36,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:36,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:36,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:36,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:36,292 INFO L87 Difference]: Start difference. First operand 646 states and 858 transitions. Second operand 9 states. [2019-09-10 08:16:39,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:39,250 INFO L93 Difference]: Finished difference Result 1148 states and 1548 transitions. [2019-09-10 08:16:39,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:39,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:16:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:39,265 INFO L225 Difference]: With dead ends: 1148 [2019-09-10 08:16:39,265 INFO L226 Difference]: Without dead ends: 1148 [2019-09-10 08:16:39,266 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:16:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-09-10 08:16:39,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 646. [2019-09-10 08:16:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:16:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 857 transitions. [2019-09-10 08:16:39,287 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 857 transitions. Word has length 96 [2019-09-10 08:16:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:39,288 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 857 transitions. [2019-09-10 08:16:39,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 857 transitions. [2019-09-10 08:16:39,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:16:39,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:39,290 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] [2019-09-10 08:16:39,291 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:39,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:39,291 INFO L82 PathProgramCache]: Analyzing trace with hash 727798889, now seen corresponding path program 1 times [2019-09-10 08:16:39,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:39,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:39,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:39,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:39,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:39,527 INFO 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:16:39,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:39,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:39,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:39,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:39,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:39,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:39,529 INFO L87 Difference]: Start difference. First operand 646 states and 857 transitions. Second operand 9 states. [2019-09-10 08:16:42,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:42,201 INFO L93 Difference]: Finished difference Result 1144 states and 1544 transitions. [2019-09-10 08:16:42,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:42,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2019-09-10 08:16:42,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:42,209 INFO L225 Difference]: With dead ends: 1144 [2019-09-10 08:16:42,210 INFO L226 Difference]: Without dead ends: 1144 [2019-09-10 08:16:42,210 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:16:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-10 08:16:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 646. [2019-09-10 08:16:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:16:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 856 transitions. [2019-09-10 08:16:42,228 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 856 transitions. Word has length 96 [2019-09-10 08:16:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:42,228 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 856 transitions. [2019-09-10 08:16:42,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 856 transitions. [2019-09-10 08:16:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:16:42,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:42,230 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] [2019-09-10 08:16:42,231 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 215751310, now seen corresponding path program 1 times [2019-09-10 08:16:42,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:42,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:42,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:42,469 INFO 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:16:42,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:42,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:42,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:42,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:42,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:42,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:42,472 INFO L87 Difference]: Start difference. First operand 646 states and 856 transitions. Second operand 9 states. [2019-09-10 08:16:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:45,103 INFO L93 Difference]: Finished difference Result 1144 states and 1543 transitions. [2019-09-10 08:16:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:45,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:16:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:45,108 INFO L225 Difference]: With dead ends: 1144 [2019-09-10 08:16:45,109 INFO L226 Difference]: Without dead ends: 1144 [2019-09-10 08:16:45,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:16:45,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-10 08:16:45,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 646. [2019-09-10 08:16:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:16:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 855 transitions. [2019-09-10 08:16:45,126 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 855 transitions. Word has length 98 [2019-09-10 08:16:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:45,127 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 855 transitions. [2019-09-10 08:16:45,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 855 transitions. [2019-09-10 08:16:45,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:16:45,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:45,129 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] [2019-09-10 08:16:45,130 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:45,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1180953076, now seen corresponding path program 1 times [2019-09-10 08:16:45,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:45,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:45,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:45,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:45,389 INFO 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:16:45,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:45,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:45,390 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:45,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:45,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:45,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:45,391 INFO L87 Difference]: Start difference. First operand 646 states and 855 transitions. Second operand 9 states. [2019-09-10 08:16:47,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:47,502 INFO L93 Difference]: Finished difference Result 1120 states and 1495 transitions. [2019-09-10 08:16:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:47,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:16:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:47,508 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:16:47,509 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:16:47,509 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:16:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:16:47,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:16:47,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:16:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 854 transitions. [2019-09-10 08:16:47,524 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 854 transitions. Word has length 98 [2019-09-10 08:16:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:47,524 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 854 transitions. [2019-09-10 08:16:47,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 854 transitions. [2019-09-10 08:16:47,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:16:47,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:47,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] [2019-09-10 08:16:47,527 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:47,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:47,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1576132324, now seen corresponding path program 1 times [2019-09-10 08:16:47,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:47,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:47,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:47,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:47,719 INFO 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:16:47,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:47,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:47,720 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:47,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:47,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:47,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:47,722 INFO L87 Difference]: Start difference. First operand 646 states and 854 transitions. Second operand 9 states. [2019-09-10 08:16:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:50,388 INFO L93 Difference]: Finished difference Result 1148 states and 1541 transitions. [2019-09-10 08:16:50,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:50,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:16:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:50,394 INFO L225 Difference]: With dead ends: 1148 [2019-09-10 08:16:50,394 INFO L226 Difference]: Without dead ends: 1148 [2019-09-10 08:16:50,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:16:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-09-10 08:16:50,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 646. [2019-09-10 08:16:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:16:50,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 853 transitions. [2019-09-10 08:16:50,412 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 853 transitions. Word has length 98 [2019-09-10 08:16:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:50,413 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 853 transitions. [2019-09-10 08:16:50,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 853 transitions. [2019-09-10 08:16:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:16:50,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:50,415 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] [2019-09-10 08:16:50,416 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1300093119, now seen corresponding path program 1 times [2019-09-10 08:16:50,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:50,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:50,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:50,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:50,677 INFO 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:16:50,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:50,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:50,678 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:50,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:50,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:50,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:50,679 INFO L87 Difference]: Start difference. First operand 646 states and 853 transitions. Second operand 9 states. [2019-09-10 08:16:53,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:53,225 INFO L93 Difference]: Finished difference Result 1136 states and 1522 transitions. [2019-09-10 08:16:53,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:53,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:16:53,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:53,231 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:16:53,231 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:16:53,232 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:16:53,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:16:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-10 08:16:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:16:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 852 transitions. [2019-09-10 08:16:53,247 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 852 transitions. Word has length 98 [2019-09-10 08:16:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:53,247 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 852 transitions. [2019-09-10 08:16:53,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 852 transitions. [2019-09-10 08:16:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:16:53,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:53,249 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] [2019-09-10 08:16:53,250 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:53,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1810473432, now seen corresponding path program 1 times [2019-09-10 08:16:53,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:53,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:53,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:53,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:53,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:53,445 INFO 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:16:53,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:53,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:53,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:53,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:53,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:53,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:53,447 INFO L87 Difference]: Start difference. First operand 646 states and 852 transitions. Second operand 9 states. [2019-09-10 08:16:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:55,565 INFO L93 Difference]: Finished difference Result 1120 states and 1492 transitions. [2019-09-10 08:16:55,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:55,565 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:16:55,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:55,570 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:16:55,570 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:16:55,571 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:16:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:16:55,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:16:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:16:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 851 transitions. [2019-09-10 08:16:55,585 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 851 transitions. Word has length 98 [2019-09-10 08:16:55,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:55,585 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 851 transitions. [2019-09-10 08:16:55,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 851 transitions. [2019-09-10 08:16:55,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:16:55,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:55,588 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] [2019-09-10 08:16:55,589 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1939924177, now seen corresponding path program 1 times [2019-09-10 08:16:55,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:55,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:55,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:55,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:55,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:16:55,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:55,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:55,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:55,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:55,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:55,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:55,826 INFO L87 Difference]: Start difference. First operand 646 states and 851 transitions. Second operand 9 states. [2019-09-10 08:16:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:16:57,790 INFO L93 Difference]: Finished difference Result 1120 states and 1490 transitions. [2019-09-10 08:16:57,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:16:57,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:16:57,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:16:57,796 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:16:57,796 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:16:57,797 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:16:57,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:16:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:16:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:16:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 850 transitions. [2019-09-10 08:16:57,813 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 850 transitions. Word has length 98 [2019-09-10 08:16:57,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:16:57,814 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 850 transitions. [2019-09-10 08:16:57,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:16:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 850 transitions. [2019-09-10 08:16:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:16:57,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:16:57,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] [2019-09-10 08:16:57,816 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:16:57,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:16:57,817 INFO L82 PathProgramCache]: Analyzing trace with hash 425886607, now seen corresponding path program 1 times [2019-09-10 08:16:57,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:16:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:57,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:16:57,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:16:57,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:16:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:16:58,117 INFO 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:16:58,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:16:58,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:16:58,120 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:16:58,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:16:58,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:16:58,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:16:58,122 INFO L87 Difference]: Start difference. First operand 646 states and 850 transitions. Second operand 9 states. [2019-09-10 08:17:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:00,993 INFO L93 Difference]: Finished difference Result 1144 states and 1533 transitions. [2019-09-10 08:17:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:00,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:17:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:01,001 INFO L225 Difference]: With dead ends: 1144 [2019-09-10 08:17:01,001 INFO L226 Difference]: Without dead ends: 1144 [2019-09-10 08:17:01,002 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:17:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-10 08:17:01,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 646. [2019-09-10 08:17:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:01,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 849 transitions. [2019-09-10 08:17:01,018 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 849 transitions. Word has length 98 [2019-09-10 08:17:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:01,019 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 849 transitions. [2019-09-10 08:17:01,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 849 transitions. [2019-09-10 08:17:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:17:01,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:01,021 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] [2019-09-10 08:17:01,022 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:01,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:01,022 INFO L82 PathProgramCache]: Analyzing trace with hash -341357961, now seen corresponding path program 1 times [2019-09-10 08:17:01,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:01,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:01,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:01,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:01,295 INFO 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:17:01,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:01,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:01,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:01,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:01,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:01,298 INFO L87 Difference]: Start difference. First operand 646 states and 849 transitions. Second operand 9 states. [2019-09-10 08:17:03,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:03,530 INFO L93 Difference]: Finished difference Result 1120 states and 1487 transitions. [2019-09-10 08:17:03,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:03,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:17:03,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:03,536 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:03,536 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:03,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:17:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:03,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 848 transitions. [2019-09-10 08:17:03,551 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 848 transitions. Word has length 98 [2019-09-10 08:17:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:03,551 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 848 transitions. [2019-09-10 08:17:03,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:03,551 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 848 transitions. [2019-09-10 08:17:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-10 08:17:03,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:03,553 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] [2019-09-10 08:17:03,554 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:03,555 INFO L82 PathProgramCache]: Analyzing trace with hash -976253424, now seen corresponding path program 1 times [2019-09-10 08:17:03,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:03,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:03,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:03,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:03,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:03,758 INFO 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:17:03,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:03,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:03,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:03,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:03,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:03,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:03,760 INFO L87 Difference]: Start difference. First operand 646 states and 848 transitions. Second operand 9 states. [2019-09-10 08:17:05,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:05,933 INFO L93 Difference]: Finished difference Result 1120 states and 1485 transitions. [2019-09-10 08:17:05,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:05,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2019-09-10 08:17:05,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:05,940 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:05,940 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:05,941 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:17:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:05,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:05,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 847 transitions. [2019-09-10 08:17:05,954 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 847 transitions. Word has length 98 [2019-09-10 08:17:05,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:05,955 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 847 transitions. [2019-09-10 08:17:05,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:05,955 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 847 transitions. [2019-09-10 08:17:05,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:05,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:05,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:05,958 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:05,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:05,958 INFO L82 PathProgramCache]: Analyzing trace with hash 130488343, now seen corresponding path program 1 times [2019-09-10 08:17:05,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:05,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:05,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:05,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:05,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:06,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:17:06,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:06,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:06,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:06,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:06,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:06,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:06,228 INFO L87 Difference]: Start difference. First operand 646 states and 847 transitions. Second operand 9 states. [2019-09-10 08:17:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:08,498 INFO L93 Difference]: Finished difference Result 1120 states and 1484 transitions. [2019-09-10 08:17:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:08,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:08,504 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:08,504 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:08,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:17:08,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:08,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:08,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 846 transitions. [2019-09-10 08:17:08,517 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 846 transitions. Word has length 100 [2019-09-10 08:17:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:08,517 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 846 transitions. [2019-09-10 08:17:08,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 846 transitions. [2019-09-10 08:17:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:08,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:08,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:08,520 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1037598, now seen corresponding path program 1 times [2019-09-10 08:17:08,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:08,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:08,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:08,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:08,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:08,712 INFO 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:17:08,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:08,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:08,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:08,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:08,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:08,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:08,714 INFO L87 Difference]: Start difference. First operand 646 states and 846 transitions. Second operand 9 states. [2019-09-10 08:17:11,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:11,530 INFO L93 Difference]: Finished difference Result 1136 states and 1512 transitions. [2019-09-10 08:17:11,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:11,531 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:11,537 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:17:11,537 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:17:11,537 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:17:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:17:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-10 08:17:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:11,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 845 transitions. [2019-09-10 08:17:11,547 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 845 transitions. Word has length 100 [2019-09-10 08:17:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:11,548 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 845 transitions. [2019-09-10 08:17:11,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:11,548 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 845 transitions. [2019-09-10 08:17:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:11,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:11,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:11,550 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:11,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash -597494101, now seen corresponding path program 1 times [2019-09-10 08:17:11,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:11,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:11,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:11,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:11,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:11,731 INFO 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:17:11,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:11,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:11,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:11,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:11,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:11,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:11,733 INFO L87 Difference]: Start difference. First operand 646 states and 845 transitions. Second operand 9 states. [2019-09-10 08:17:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:14,618 INFO L93 Difference]: Finished difference Result 1144 states and 1525 transitions. [2019-09-10 08:17:14,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:14,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:14,624 INFO L225 Difference]: With dead ends: 1144 [2019-09-10 08:17:14,624 INFO L226 Difference]: Without dead ends: 1144 [2019-09-10 08:17:14,624 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:17:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-09-10 08:17:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 646. [2019-09-10 08:17:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 844 transitions. [2019-09-10 08:17:14,635 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 844 transitions. Word has length 100 [2019-09-10 08:17:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:14,636 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 844 transitions. [2019-09-10 08:17:14,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:14,636 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 844 transitions. [2019-09-10 08:17:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:14,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:14,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] [2019-09-10 08:17:14,639 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:14,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:14,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1136805223, now seen corresponding path program 1 times [2019-09-10 08:17:14,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:14,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:14,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:14,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:14,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:14,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:14,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:14,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:14,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:14,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:14,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:14,837 INFO L87 Difference]: Start difference. First operand 646 states and 844 transitions. Second operand 9 states. [2019-09-10 08:17:17,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:17,672 INFO L93 Difference]: Finished difference Result 1136 states and 1510 transitions. [2019-09-10 08:17:17,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:17,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:17,680 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:17:17,680 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:17:17,681 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:17:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:17:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-10 08:17:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:17,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 843 transitions. [2019-09-10 08:17:17,692 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 843 transitions. Word has length 100 [2019-09-10 08:17:17,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:17,692 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 843 transitions. [2019-09-10 08:17:17,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:17,692 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 843 transitions. [2019-09-10 08:17:17,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:17,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:17,694 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:17,695 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:17,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:17,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1634882529, now seen corresponding path program 1 times [2019-09-10 08:17:17,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:17,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:17,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:17,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:17,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:17:17,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:17,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:17,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:17,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:17,883 INFO L87 Difference]: Start difference. First operand 646 states and 843 transitions. Second operand 9 states. [2019-09-10 08:17:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:20,132 INFO L93 Difference]: Finished difference Result 1120 states and 1480 transitions. [2019-09-10 08:17:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:20,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:20,137 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:20,137 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:20,137 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:17:20,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:20,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 842 transitions. [2019-09-10 08:17:20,148 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 842 transitions. Word has length 100 [2019-09-10 08:17:20,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:20,149 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 842 transitions. [2019-09-10 08:17:20,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 842 transitions. [2019-09-10 08:17:20,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:20,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:20,151 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:20,151 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:20,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:20,152 INFO L82 PathProgramCache]: Analyzing trace with hash -685545711, now seen corresponding path program 1 times [2019-09-10 08:17:20,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:20,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:20,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:20,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:20,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:20,356 INFO 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:17:20,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:20,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:20,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:20,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:20,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:20,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:20,358 INFO L87 Difference]: Start difference. First operand 646 states and 842 transitions. Second operand 9 states. [2019-09-10 08:17:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:22,960 INFO L93 Difference]: Finished difference Result 1120 states and 1479 transitions. [2019-09-10 08:17:22,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:22,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:22,966 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:22,966 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:22,967 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:17:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 841 transitions. [2019-09-10 08:17:22,979 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 841 transitions. Word has length 100 [2019-09-10 08:17:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:22,980 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 841 transitions. [2019-09-10 08:17:22,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 841 transitions. [2019-09-10 08:17:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:22,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:22,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:22,982 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:22,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:22,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2035564676, now seen corresponding path program 1 times [2019-09-10 08:17:22,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:22,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:22,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:22,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:23,183 INFO 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:17:23,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:23,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:23,184 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:23,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:23,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:23,186 INFO L87 Difference]: Start difference. First operand 646 states and 841 transitions. Second operand 9 states. [2019-09-10 08:17:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:26,227 INFO L93 Difference]: Finished difference Result 1136 states and 1505 transitions. [2019-09-10 08:17:26,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:26,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:26,233 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:17:26,234 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:17:26,234 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:17:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:17:26,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-10 08:17:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 840 transitions. [2019-09-10 08:17:26,260 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 840 transitions. Word has length 100 [2019-09-10 08:17:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:26,261 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 840 transitions. [2019-09-10 08:17:26,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 840 transitions. [2019-09-10 08:17:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:26,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:26,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:26,263 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:26,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash 232149422, now seen corresponding path program 1 times [2019-09-10 08:17:26,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:26,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:26,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:26,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:26,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:26,441 INFO 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:17:26,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:26,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:26,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:26,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:26,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:26,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:26,442 INFO L87 Difference]: Start difference. First operand 646 states and 840 transitions. Second operand 9 states. [2019-09-10 08:17:29,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:29,355 INFO L93 Difference]: Finished difference Result 1136 states and 1503 transitions. [2019-09-10 08:17:29,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:29,355 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:29,361 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:17:29,361 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:17:29,362 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:17:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:17:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-10 08:17:29,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:29,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 839 transitions. [2019-09-10 08:17:29,373 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 839 transitions. Word has length 100 [2019-09-10 08:17:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:29,373 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 839 transitions. [2019-09-10 08:17:29,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 839 transitions. [2019-09-10 08:17:29,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:29,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:29,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:29,375 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:29,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:29,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1574304686, now seen corresponding path program 1 times [2019-09-10 08:17:29,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:29,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:29,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:29,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:29,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:29,558 INFO 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:17:29,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:29,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:29,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:29,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:29,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:29,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:29,560 INFO L87 Difference]: Start difference. First operand 646 states and 839 transitions. Second operand 9 states. [2019-09-10 08:17:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:32,053 INFO L93 Difference]: Finished difference Result 1120 states and 1476 transitions. [2019-09-10 08:17:32,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:32,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:32,060 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:32,060 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:32,061 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:17:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 838 transitions. [2019-09-10 08:17:32,072 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 838 transitions. Word has length 100 [2019-09-10 08:17:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:32,072 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 838 transitions. [2019-09-10 08:17:32,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:32,073 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 838 transitions. [2019-09-10 08:17:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:32,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:32,074 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:32,075 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:32,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:32,075 INFO L82 PathProgramCache]: Analyzing trace with hash 622153299, now seen corresponding path program 1 times [2019-09-10 08:17:32,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:32,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:32,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:32,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:32,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:32,256 INFO 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:17:32,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:32,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:32,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:32,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:32,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:32,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:32,258 INFO L87 Difference]: Start difference. First operand 646 states and 838 transitions. Second operand 9 states. [2019-09-10 08:17:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:35,068 INFO L93 Difference]: Finished difference Result 1120 states and 1474 transitions. [2019-09-10 08:17:35,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:35,068 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:35,073 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:35,073 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:35,074 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:17:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:35,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 837 transitions. [2019-09-10 08:17:35,084 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 837 transitions. Word has length 100 [2019-09-10 08:17:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:35,085 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 837 transitions. [2019-09-10 08:17:35,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 837 transitions. [2019-09-10 08:17:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:35,087 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:35,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:35,087 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:35,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1503778103, now seen corresponding path program 1 times [2019-09-10 08:17:35,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:35,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:35,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:35,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:35,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:35,262 INFO 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:17:35,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:35,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:35,263 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:35,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:35,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:35,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:35,264 INFO L87 Difference]: Start difference. First operand 646 states and 837 transitions. Second operand 9 states. [2019-09-10 08:17:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:37,641 INFO L93 Difference]: Finished difference Result 1136 states and 1500 transitions. [2019-09-10 08:17:37,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:37,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:37,646 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:17:37,646 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:17:37,647 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:17:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:17:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-10 08:17:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 836 transitions. [2019-09-10 08:17:37,655 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 836 transitions. Word has length 100 [2019-09-10 08:17:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:37,655 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 836 transitions. [2019-09-10 08:17:37,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 836 transitions. [2019-09-10 08:17:37,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:37,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:37,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:37,662 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:37,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:37,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1753298871, now seen corresponding path program 1 times [2019-09-10 08:17:37,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:37,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:37,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:37,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:37,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:37,890 INFO 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:17:37,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:37,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:37,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:37,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:37,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:37,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:37,892 INFO L87 Difference]: Start difference. First operand 646 states and 836 transitions. Second operand 9 states. [2019-09-10 08:17:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:40,640 INFO L93 Difference]: Finished difference Result 1120 states and 1472 transitions. [2019-09-10 08:17:40,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:40,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:40,644 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:40,644 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:40,645 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:17:40,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 835 transitions. [2019-09-10 08:17:40,654 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 835 transitions. Word has length 100 [2019-09-10 08:17:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:40,654 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 835 transitions. [2019-09-10 08:17:40,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 835 transitions. [2019-09-10 08:17:40,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:40,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:40,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:40,656 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:40,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:40,656 INFO L82 PathProgramCache]: Analyzing trace with hash -716089058, now seen corresponding path program 1 times [2019-09-10 08:17:40,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:40,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:40,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:40,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:40,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:40,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:17:40,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:40,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:40,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:40,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:40,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:40,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:40,829 INFO L87 Difference]: Start difference. First operand 646 states and 835 transitions. Second operand 9 states. [2019-09-10 08:17:43,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:43,268 INFO L93 Difference]: Finished difference Result 1136 states and 1497 transitions. [2019-09-10 08:17:43,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:43,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:43,271 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:17:43,271 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:17:43,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:17:43,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:17:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-10 08:17:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:43,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 834 transitions. [2019-09-10 08:17:43,280 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 834 transitions. Word has length 100 [2019-09-10 08:17:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:43,294 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 834 transitions. [2019-09-10 08:17:43,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 834 transitions. [2019-09-10 08:17:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:17:43,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:43,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] [2019-09-10 08:17:43,296 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:43,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:43,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1807326229, now seen corresponding path program 1 times [2019-09-10 08:17:43,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:43,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:43,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:43,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:43,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:43,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:17:43,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:43,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:43,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:43,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:43,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:43,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:43,533 INFO L87 Difference]: Start difference. First operand 646 states and 834 transitions. Second operand 9 states. [2019-09-10 08:17:45,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:45,827 INFO L93 Difference]: Finished difference Result 1120 states and 1470 transitions. [2019-09-10 08:17:45,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:45,828 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2019-09-10 08:17:45,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:45,831 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:45,831 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:45,832 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:17:45,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 833 transitions. [2019-09-10 08:17:45,843 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 833 transitions. Word has length 100 [2019-09-10 08:17:45,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:45,843 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 833 transitions. [2019-09-10 08:17:45,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 833 transitions. [2019-09-10 08:17:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:45,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:45,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] [2019-09-10 08:17:45,847 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:45,847 INFO L82 PathProgramCache]: Analyzing trace with hash -347748653, now seen corresponding path program 1 times [2019-09-10 08:17:45,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:45,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:45,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:45,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:46,028 INFO 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:17:46,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:46,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:46,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:46,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:46,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:46,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:46,030 INFO L87 Difference]: Start difference. First operand 646 states and 833 transitions. Second operand 9 states. [2019-09-10 08:17:48,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:48,754 INFO L93 Difference]: Finished difference Result 1136 states and 1493 transitions. [2019-09-10 08:17:48,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:48,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:17:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:48,759 INFO L225 Difference]: With dead ends: 1136 [2019-09-10 08:17:48,759 INFO L226 Difference]: Without dead ends: 1136 [2019-09-10 08:17:48,760 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:17:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2019-09-10 08:17:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 646. [2019-09-10 08:17:48,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 832 transitions. [2019-09-10 08:17:48,770 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 832 transitions. Word has length 102 [2019-09-10 08:17:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:48,771 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 832 transitions. [2019-09-10 08:17:48,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 832 transitions. [2019-09-10 08:17:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:48,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:48,773 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:48,773 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:48,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:48,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1867430125, now seen corresponding path program 1 times [2019-09-10 08:17:48,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:48,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:48,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:48,952 INFO 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:17:48,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:48,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:48,952 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:48,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:48,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:48,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:48,953 INFO L87 Difference]: Start difference. First operand 646 states and 832 transitions. Second operand 9 states. [2019-09-10 08:17:51,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:51,628 INFO L93 Difference]: Finished difference Result 1088 states and 1417 transitions. [2019-09-10 08:17:51,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:51,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:17:51,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:51,633 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:17:51,633 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:17:51,634 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:17:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:17:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:17:51,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 831 transitions. [2019-09-10 08:17:51,645 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 831 transitions. Word has length 102 [2019-09-10 08:17:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:51,646 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 831 transitions. [2019-09-10 08:17:51,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 831 transitions. [2019-09-10 08:17:51,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:51,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:51,648 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:51,648 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash -498380659, now seen corresponding path program 1 times [2019-09-10 08:17:51,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:51,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:51,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:51,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:51,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:51,854 INFO 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:17:51,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:51,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:51,854 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:51,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:51,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:51,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:51,856 INFO L87 Difference]: Start difference. First operand 646 states and 831 transitions. Second operand 9 states. [2019-09-10 08:17:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:54,421 INFO L93 Difference]: Finished difference Result 1120 states and 1467 transitions. [2019-09-10 08:17:54,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:54,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:17:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:54,424 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:54,425 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:54,425 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:17:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 830 transitions. [2019-09-10 08:17:54,437 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 830 transitions. Word has length 102 [2019-09-10 08:17:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:54,438 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 830 transitions. [2019-09-10 08:17:54,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 830 transitions. [2019-09-10 08:17:54,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:54,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:54,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:17:54,440 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:54,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1161693327, now seen corresponding path program 1 times [2019-09-10 08:17:54,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:54,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:54,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:54,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:54,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:54,639 INFO 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:17:54,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:54,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:54,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:54,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:54,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:54,641 INFO L87 Difference]: Start difference. First operand 646 states and 830 transitions. Second operand 9 states. [2019-09-10 08:17:57,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:17:57,020 INFO L93 Difference]: Finished difference Result 1120 states and 1465 transitions. [2019-09-10 08:17:57,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:17:57,020 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:17:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:17:57,023 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:17:57,023 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:17:57,024 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:17:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:17:57,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:17:57,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:17:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 829 transitions. [2019-09-10 08:17:57,035 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 829 transitions. Word has length 102 [2019-09-10 08:17:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:17:57,035 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 829 transitions. [2019-09-10 08:17:57,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:17:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 829 transitions. [2019-09-10 08:17:57,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:17:57,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:17:57,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] [2019-09-10 08:17:57,037 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:17:57,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:17:57,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1204117457, now seen corresponding path program 1 times [2019-09-10 08:17:57,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:17:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:57,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:17:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:17:57,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:17:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:17:57,218 INFO 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:17:57,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:17:57,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:17:57,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:17:57,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:17:57,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:17:57,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:17:57,221 INFO L87 Difference]: Start difference. First operand 646 states and 829 transitions. Second operand 9 states. [2019-09-10 08:18:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:00,094 INFO L93 Difference]: Finished difference Result 1088 states and 1414 transitions. [2019-09-10 08:18:00,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:00,095 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:00,098 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:00,098 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:00,099 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:18:00,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 828 transitions. [2019-09-10 08:18:00,109 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 828 transitions. Word has length 102 [2019-09-10 08:18:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:00,109 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 828 transitions. [2019-09-10 08:18:00,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 828 transitions. [2019-09-10 08:18:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:00,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:00,111 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:00,111 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:00,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:00,111 INFO L82 PathProgramCache]: Analyzing trace with hash 42902853, now seen corresponding path program 1 times [2019-09-10 08:18:00,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:00,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:00,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:00,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:00,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:00,295 INFO 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:18:00,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:00,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:00,296 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:00,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:00,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:00,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:00,297 INFO L87 Difference]: Start difference. First operand 646 states and 828 transitions. Second operand 9 states. [2019-09-10 08:18:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:03,118 INFO L93 Difference]: Finished difference Result 1088 states and 1412 transitions. [2019-09-10 08:18:03,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:03,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:03,123 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:03,123 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:03,123 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:18:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:03,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 827 transitions. [2019-09-10 08:18:03,133 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 827 transitions. Word has length 102 [2019-09-10 08:18:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:03,133 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 827 transitions. [2019-09-10 08:18:03,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 827 transitions. [2019-09-10 08:18:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:03,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:03,135 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:03,135 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:03,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2126723695, now seen corresponding path program 1 times [2019-09-10 08:18:03,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:03,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:03,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:03,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:03,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:03,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:03,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:03,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:03,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:03,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:03,308 INFO L87 Difference]: Start difference. First operand 646 states and 827 transitions. Second operand 9 states. [2019-09-10 08:18:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:05,882 INFO L93 Difference]: Finished difference Result 1088 states and 1411 transitions. [2019-09-10 08:18:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:05,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:05,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:05,886 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:05,886 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:05,887 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:18:05,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 826 transitions. [2019-09-10 08:18:05,897 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 826 transitions. Word has length 102 [2019-09-10 08:18:05,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:05,897 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 826 transitions. [2019-09-10 08:18:05,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:05,897 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 826 transitions. [2019-09-10 08:18:05,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:05,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:05,899 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:05,899 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:05,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1042767201, now seen corresponding path program 1 times [2019-09-10 08:18:05,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:05,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:05,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:05,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:05,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:06,061 INFO 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:18:06,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:06,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:06,062 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:06,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:06,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:06,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:06,063 INFO L87 Difference]: Start difference. First operand 646 states and 826 transitions. Second operand 9 states. [2019-09-10 08:18:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:08,814 INFO L93 Difference]: Finished difference Result 1088 states and 1409 transitions. [2019-09-10 08:18:08,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:08,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:08,817 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:08,817 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:08,818 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:18:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 825 transitions. [2019-09-10 08:18:08,825 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 825 transitions. Word has length 102 [2019-09-10 08:18:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:08,825 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 825 transitions. [2019-09-10 08:18:08,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 825 transitions. [2019-09-10 08:18:08,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:08,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:08,826 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:08,827 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:08,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:08,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1199777118, now seen corresponding path program 1 times [2019-09-10 08:18:08,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:08,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:08,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:09,002 INFO 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:18:09,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:09,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:09,003 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:09,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:09,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:09,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:09,004 INFO L87 Difference]: Start difference. First operand 646 states and 825 transitions. Second operand 9 states. [2019-09-10 08:18:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:11,714 INFO L93 Difference]: Finished difference Result 1088 states and 1408 transitions. [2019-09-10 08:18:11,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:11,714 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:11,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:11,716 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:11,717 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:11,717 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:18:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 824 transitions. [2019-09-10 08:18:11,724 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 824 transitions. Word has length 102 [2019-09-10 08:18:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:11,724 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 824 transitions. [2019-09-10 08:18:11,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 824 transitions. [2019-09-10 08:18:11,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:11,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:11,726 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:11,726 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:11,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:11,726 INFO L82 PathProgramCache]: Analyzing trace with hash -239523668, now seen corresponding path program 1 times [2019-09-10 08:18:11,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:11,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:11,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:11,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:11,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:11,914 INFO 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:18:11,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:11,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:11,915 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:11,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:11,916 INFO L87 Difference]: Start difference. First operand 646 states and 824 transitions. Second operand 9 states. [2019-09-10 08:18:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:14,617 INFO L93 Difference]: Finished difference Result 1088 states and 1406 transitions. [2019-09-10 08:18:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:14,618 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:14,620 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:14,620 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:14,621 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:18:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:14,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 823 transitions. [2019-09-10 08:18:14,630 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 823 transitions. Word has length 102 [2019-09-10 08:18:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:14,630 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 823 transitions. [2019-09-10 08:18:14,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 823 transitions. [2019-09-10 08:18:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:14,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:14,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] [2019-09-10 08:18:14,632 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1033951035, now seen corresponding path program 1 times [2019-09-10 08:18:14,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:14,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:14,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:14,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:14,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:14,833 INFO 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:18:14,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:14,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:14,834 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:14,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:14,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:14,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:14,836 INFO L87 Difference]: Start difference. First operand 646 states and 823 transitions. Second operand 9 states. [2019-09-10 08:18:17,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:17,281 INFO L93 Difference]: Finished difference Result 1088 states and 1405 transitions. [2019-09-10 08:18:17,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:17,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:17,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:17,284 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:17,284 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:17,284 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:18:17,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:17,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 822 transitions. [2019-09-10 08:18:17,294 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 822 transitions. Word has length 102 [2019-09-10 08:18:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:17,294 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 822 transitions. [2019-09-10 08:18:17,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 822 transitions. [2019-09-10 08:18:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:17,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:17,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] [2019-09-10 08:18:17,296 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:17,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1606100660, now seen corresponding path program 1 times [2019-09-10 08:18:17,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:17,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:17,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:17,469 INFO 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:18:17,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:17,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:17,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:17,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:17,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:17,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:17,471 INFO L87 Difference]: Start difference. First operand 646 states and 822 transitions. Second operand 9 states. [2019-09-10 08:18:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:20,116 INFO L93 Difference]: Finished difference Result 1088 states and 1404 transitions. [2019-09-10 08:18:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:20,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:20,119 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:20,119 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:20,119 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:18:20,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:20,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 821 transitions. [2019-09-10 08:18:20,126 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 821 transitions. Word has length 102 [2019-09-10 08:18:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:20,127 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 821 transitions. [2019-09-10 08:18:20,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 821 transitions. [2019-09-10 08:18:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:20,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:20,128 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:20,128 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:20,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1991148821, now seen corresponding path program 1 times [2019-09-10 08:18:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:20,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:20,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:20,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:20,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:20,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:20,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:20,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:20,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:20,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:20,374 INFO L87 Difference]: Start difference. First operand 646 states and 821 transitions. Second operand 9 states. [2019-09-10 08:18:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:23,282 INFO L93 Difference]: Finished difference Result 1120 states and 1451 transitions. [2019-09-10 08:18:23,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:23,282 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:23,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:23,284 INFO L225 Difference]: With dead ends: 1120 [2019-09-10 08:18:23,284 INFO L226 Difference]: Without dead ends: 1120 [2019-09-10 08:18:23,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2019-09-10 08:18:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 646. [2019-09-10 08:18:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 820 transitions. [2019-09-10 08:18:23,290 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 820 transitions. Word has length 102 [2019-09-10 08:18:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:23,290 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 820 transitions. [2019-09-10 08:18:23,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:23,290 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 820 transitions. [2019-09-10 08:18:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:23,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:23,292 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:23,292 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1791700802, now seen corresponding path program 1 times [2019-09-10 08:18:23,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:23,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:23,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:23,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:23,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:23,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:23,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:23,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:23,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:23,461 INFO L87 Difference]: Start difference. First operand 646 states and 820 transitions. Second operand 9 states. [2019-09-10 08:18:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:26,212 INFO L93 Difference]: Finished difference Result 1088 states and 1401 transitions. [2019-09-10 08:18:26,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:26,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:26,215 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:26,215 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:26,215 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:18:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:26,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 819 transitions. [2019-09-10 08:18:26,223 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 819 transitions. Word has length 102 [2019-09-10 08:18:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:26,223 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 819 transitions. [2019-09-10 08:18:26,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 819 transitions. [2019-09-10 08:18:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:26,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:26,224 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:26,225 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash -518117862, now seen corresponding path program 1 times [2019-09-10 08:18:26,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:26,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:26,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:26,409 INFO 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:18:26,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:26,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:26,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:26,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:26,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:26,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:26,410 INFO L87 Difference]: Start difference. First operand 646 states and 819 transitions. Second operand 9 states. [2019-09-10 08:18:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:29,002 INFO L93 Difference]: Finished difference Result 1088 states and 1400 transitions. [2019-09-10 08:18:29,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:29,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:29,005 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:29,005 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:29,005 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:18:29,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 818 transitions. [2019-09-10 08:18:29,013 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 818 transitions. Word has length 102 [2019-09-10 08:18:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:29,013 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 818 transitions. [2019-09-10 08:18:29,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 818 transitions. [2019-09-10 08:18:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:29,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:29,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:29,015 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:29,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1542160895, now seen corresponding path program 1 times [2019-09-10 08:18:29,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:29,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:29,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:29,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:18:29,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:29,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:29,234 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:29,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:29,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:29,235 INFO L87 Difference]: Start difference. First operand 646 states and 818 transitions. Second operand 9 states. [2019-09-10 08:18:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:31,904 INFO L93 Difference]: Finished difference Result 1088 states and 1399 transitions. [2019-09-10 08:18:31,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:31,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:31,906 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:31,906 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:31,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:18:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:31,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:31,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:31,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 817 transitions. [2019-09-10 08:18:31,914 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 817 transitions. Word has length 102 [2019-09-10 08:18:31,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:31,914 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 817 transitions. [2019-09-10 08:18:31,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:31,915 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 817 transitions. [2019-09-10 08:18:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:31,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:31,916 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:31,916 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:31,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:31,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1591591797, now seen corresponding path program 1 times [2019-09-10 08:18:31,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:31,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:31,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:31,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:31,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:32,122 INFO 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:18:32,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:32,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:32,123 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:32,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:32,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:32,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:32,124 INFO L87 Difference]: Start difference. First operand 646 states and 817 transitions. Second operand 9 states. [2019-09-10 08:18:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:34,721 INFO L93 Difference]: Finished difference Result 1088 states and 1397 transitions. [2019-09-10 08:18:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:34,721 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:34,723 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:34,723 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:34,724 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:18:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:34,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 816 transitions. [2019-09-10 08:18:34,732 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 816 transitions. Word has length 102 [2019-09-10 08:18:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:34,732 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 816 transitions. [2019-09-10 08:18:34,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 816 transitions. [2019-09-10 08:18:34,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:34,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:34,733 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:34,734 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:34,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:34,734 INFO L82 PathProgramCache]: Analyzing trace with hash -578717935, now seen corresponding path program 1 times [2019-09-10 08:18:34,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:34,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:34,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:34,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:34,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:34,901 INFO 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:18:34,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:34,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:34,902 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:34,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:34,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:34,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:34,909 INFO L87 Difference]: Start difference. First operand 646 states and 816 transitions. Second operand 9 states. [2019-09-10 08:18:37,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:37,151 INFO L93 Difference]: Finished difference Result 1088 states and 1396 transitions. [2019-09-10 08:18:37,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:37,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:37,154 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:37,154 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:37,155 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:18:37,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:37,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 815 transitions. [2019-09-10 08:18:37,164 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 815 transitions. Word has length 102 [2019-09-10 08:18:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:37,164 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 815 transitions. [2019-09-10 08:18:37,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 815 transitions. [2019-09-10 08:18:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:37,166 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:37,166 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:37,166 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:37,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1766002162, now seen corresponding path program 1 times [2019-09-10 08:18:37,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:37,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:37,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:37,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:37,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:18:37,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:37,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:37,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:37,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:37,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:37,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:37,318 INFO L87 Difference]: Start difference. First operand 646 states and 815 transitions. Second operand 9 states. [2019-09-10 08:18:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:39,800 INFO L93 Difference]: Finished difference Result 1088 states and 1394 transitions. [2019-09-10 08:18:39,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:39,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:39,803 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:39,803 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:39,804 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:18:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 814 transitions. [2019-09-10 08:18:39,811 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 814 transitions. Word has length 102 [2019-09-10 08:18:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:39,811 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 814 transitions. [2019-09-10 08:18:39,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 814 transitions. [2019-09-10 08:18:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:39,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:39,813 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:39,813 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:39,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:39,814 INFO L82 PathProgramCache]: Analyzing trace with hash 86548545, now seen corresponding path program 1 times [2019-09-10 08:18:39,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:39,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:39,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:39,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:39,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:39,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:39,988 INFO 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:18:39,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:39,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:39,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:39,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:39,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:39,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:39,990 INFO L87 Difference]: Start difference. First operand 646 states and 814 transitions. Second operand 9 states. [2019-09-10 08:18:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:42,575 INFO L93 Difference]: Finished difference Result 1088 states and 1392 transitions. [2019-09-10 08:18:42,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:42,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:42,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:42,578 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:42,578 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:42,579 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:18:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 813 transitions. [2019-09-10 08:18:42,586 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 813 transitions. Word has length 102 [2019-09-10 08:18:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:42,587 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 813 transitions. [2019-09-10 08:18:42,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 813 transitions. [2019-09-10 08:18:42,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:42,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:42,588 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:42,588 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2083870417, now seen corresponding path program 1 times [2019-09-10 08:18:42,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:42,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:42,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:42,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:42,816 INFO 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:18:42,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:42,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:42,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:42,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:42,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:42,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:42,818 INFO L87 Difference]: Start difference. First operand 646 states and 813 transitions. Second operand 9 states. [2019-09-10 08:18:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:45,375 INFO L93 Difference]: Finished difference Result 1088 states and 1391 transitions. [2019-09-10 08:18:45,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:45,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:45,377 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:45,377 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:45,378 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:18:45,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 812 transitions. [2019-09-10 08:18:45,386 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 812 transitions. Word has length 102 [2019-09-10 08:18:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:45,386 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 812 transitions. [2019-09-10 08:18:45,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 812 transitions. [2019-09-10 08:18:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:45,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:45,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:45,388 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:45,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:45,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1805478129, now seen corresponding path program 1 times [2019-09-10 08:18:45,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:45,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:45,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:45,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:45,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:45,565 INFO 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:18:45,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:45,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:45,565 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:45,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:45,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:45,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:45,566 INFO L87 Difference]: Start difference. First operand 646 states and 812 transitions. Second operand 9 states. [2019-09-10 08:18:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:48,218 INFO L93 Difference]: Finished difference Result 1088 states and 1389 transitions. [2019-09-10 08:18:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:48,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:48,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:48,220 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:48,220 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:48,220 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:18:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 811 transitions. [2019-09-10 08:18:48,227 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 811 transitions. Word has length 102 [2019-09-10 08:18:48,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:48,227 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 811 transitions. [2019-09-10 08:18:48,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:48,228 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 811 transitions. [2019-09-10 08:18:48,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:48,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:48,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] [2019-09-10 08:18:48,229 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:48,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:48,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1564380239, now seen corresponding path program 1 times [2019-09-10 08:18:48,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:48,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:48,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:48,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:48,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:18:48,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:48,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:48,402 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:48,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:48,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:48,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:48,403 INFO L87 Difference]: Start difference. First operand 646 states and 811 transitions. Second operand 9 states. [2019-09-10 08:18:50,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:50,752 INFO L93 Difference]: Finished difference Result 1088 states and 1387 transitions. [2019-09-10 08:18:50,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:50,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:50,757 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:50,758 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:50,758 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:18:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:50,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 810 transitions. [2019-09-10 08:18:50,765 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 810 transitions. Word has length 102 [2019-09-10 08:18:50,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:50,766 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 810 transitions. [2019-09-10 08:18:50,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 810 transitions. [2019-09-10 08:18:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:50,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:50,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:50,767 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:50,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1861566370, now seen corresponding path program 1 times [2019-09-10 08:18:50,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:50,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:50,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:50,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:50,899 INFO 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:18:50,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:50,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:50,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:50,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:50,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:50,900 INFO L87 Difference]: Start difference. First operand 646 states and 810 transitions. Second operand 9 states. [2019-09-10 08:18:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:53,355 INFO L93 Difference]: Finished difference Result 1088 states and 1386 transitions. [2019-09-10 08:18:53,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:53,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:53,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:53,358 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:53,358 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:53,359 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:18:53,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 809 transitions. [2019-09-10 08:18:53,368 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 809 transitions. Word has length 102 [2019-09-10 08:18:53,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:53,368 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 809 transitions. [2019-09-10 08:18:53,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 809 transitions. [2019-09-10 08:18:53,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:53,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:53,369 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:53,369 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:53,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1799751695, now seen corresponding path program 1 times [2019-09-10 08:18:53,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:53,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:53,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:53,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:53,534 INFO 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:18:53,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:53,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:53,534 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:53,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:53,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:53,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:53,535 INFO L87 Difference]: Start difference. First operand 646 states and 809 transitions. Second operand 9 states. [2019-09-10 08:18:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:55,895 INFO L93 Difference]: Finished difference Result 1088 states and 1385 transitions. [2019-09-10 08:18:55,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:55,895 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:55,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:55,897 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:55,897 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:55,898 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:18:55,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 808 transitions. [2019-09-10 08:18:55,908 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 808 transitions. Word has length 102 [2019-09-10 08:18:55,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:55,908 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 808 transitions. [2019-09-10 08:18:55,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 808 transitions. [2019-09-10 08:18:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:55,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:55,910 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:18:55,910 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1222390320, now seen corresponding path program 1 times [2019-09-10 08:18:55,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:55,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:55,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:55,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:56,091 INFO 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:18:56,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:56,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:56,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:56,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:56,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:56,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:56,093 INFO L87 Difference]: Start difference. First operand 646 states and 808 transitions. Second operand 9 states. [2019-09-10 08:18:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:18:58,748 INFO L93 Difference]: Finished difference Result 1088 states and 1383 transitions. [2019-09-10 08:18:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:18:58,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:18:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:18:58,750 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:18:58,750 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:18:58,751 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:18:58,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:18:58,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:18:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:18:58,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 807 transitions. [2019-09-10 08:18:58,759 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 807 transitions. Word has length 102 [2019-09-10 08:18:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:18:58,759 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 807 transitions. [2019-09-10 08:18:58,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:18:58,759 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 807 transitions. [2019-09-10 08:18:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:18:58,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:18:58,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] [2019-09-10 08:18:58,761 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:18:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:18:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash 418497365, now seen corresponding path program 1 times [2019-09-10 08:18:58,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:18:58,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:58,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:18:58,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:18:58,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:18:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:18:58,897 INFO 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:18:58,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:18:58,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:18:58,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:18:58,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:18:58,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:18:58,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:18:58,899 INFO L87 Difference]: Start difference. First operand 646 states and 807 transitions. Second operand 9 states. [2019-09-10 08:19:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:01,242 INFO L93 Difference]: Finished difference Result 1088 states and 1381 transitions. [2019-09-10 08:19:01,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:01,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:19:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:01,244 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:19:01,245 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:19:01,245 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:19:01,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:19:01,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:19:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:19:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 806 transitions. [2019-09-10 08:19:01,252 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 806 transitions. Word has length 102 [2019-09-10 08:19:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:01,253 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 806 transitions. [2019-09-10 08:19:01,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 806 transitions. [2019-09-10 08:19:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 08:19:01,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:01,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:01,254 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:01,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:01,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1905574170, now seen corresponding path program 1 times [2019-09-10 08:19:01,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:01,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:01,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:01,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:01,385 INFO 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:19:01,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:01,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:01,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:01,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:01,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:01,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:01,387 INFO L87 Difference]: Start difference. First operand 646 states and 806 transitions. Second operand 9 states. [2019-09-10 08:19:03,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:03,906 INFO L93 Difference]: Finished difference Result 1088 states and 1380 transitions. [2019-09-10 08:19:03,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:03,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2019-09-10 08:19:03,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:03,908 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:19:03,909 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:19:03,909 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:19:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:19:03,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:19:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:19:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 805 transitions. [2019-09-10 08:19:03,918 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 805 transitions. Word has length 102 [2019-09-10 08:19:03,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:03,918 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 805 transitions. [2019-09-10 08:19:03,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 805 transitions. [2019-09-10 08:19:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-10 08:19:03,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:03,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] [2019-09-10 08:19:03,920 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:03,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:03,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1000695491, now seen corresponding path program 1 times [2019-09-10 08:19:03,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:03,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:03,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:04,076 INFO 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:19:04,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:04,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:19:04,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:04,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:19:04,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:19:04,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:19:04,077 INFO L87 Difference]: Start difference. First operand 646 states and 805 transitions. Second operand 9 states. [2019-09-10 08:19:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:06,636 INFO L93 Difference]: Finished difference Result 1088 states and 1379 transitions. [2019-09-10 08:19:06,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:19:06,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-09-10 08:19:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:06,639 INFO L225 Difference]: With dead ends: 1088 [2019-09-10 08:19:06,639 INFO L226 Difference]: Without dead ends: 1088 [2019-09-10 08:19:06,640 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:19:06,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-09-10 08:19:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 646. [2019-09-10 08:19:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-09-10 08:19:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 804 transitions. [2019-09-10 08:19:06,649 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 804 transitions. Word has length 103 [2019-09-10 08:19:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:06,649 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 804 transitions. [2019-09-10 08:19:06,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:19:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 804 transitions. [2019-09-10 08:19:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:06,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:06,651 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:06,651 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:06,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1973611710, now seen corresponding path program 1 times [2019-09-10 08:19:06,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:06,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:06,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:06,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:06,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:07,403 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 08:19:07,544 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-09-10 08:19:07,706 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:19:07,883 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-10 08:19:08,069 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-10 08:19:08,255 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:19:08,421 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-10 08:19:08,581 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:19:10,042 INFO 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:19:10,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:10,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:19:10,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:10,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:19:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:19:10,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:19:10,043 INFO L87 Difference]: Start difference. First operand 646 states and 804 transitions. Second operand 31 states. [2019-09-10 08:19:10,292 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-09-10 08:19:11,237 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2019-09-10 08:19:11,417 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-09-10 08:19:11,626 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2019-09-10 08:19:11,835 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 44 [2019-09-10 08:19:12,350 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-09-10 08:19:12,715 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 69 [2019-09-10 08:19:13,132 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-09-10 08:19:13,638 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 89 [2019-09-10 08:19:14,227 WARN L188 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 108 [2019-09-10 08:19:14,570 WARN L188 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-09-10 08:19:14,926 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 75 [2019-09-10 08:19:15,295 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69 [2019-09-10 08:19:27,651 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 56 [2019-09-10 08:19:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:29,501 INFO L93 Difference]: Finished difference Result 1257 states and 1568 transitions. [2019-09-10 08:19:29,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:19:29,502 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-10 08:19:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:29,503 INFO L225 Difference]: With dead ends: 1257 [2019-09-10 08:19:29,504 INFO L226 Difference]: Without dead ends: 1257 [2019-09-10 08:19:29,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=503, Invalid=2047, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:19:29,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-09-10 08:19:29,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 671. [2019-09-10 08:19:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2019-09-10 08:19:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 837 transitions. [2019-09-10 08:19:29,516 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 837 transitions. Word has length 104 [2019-09-10 08:19:29,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:29,516 INFO L475 AbstractCegarLoop]: Abstraction has 671 states and 837 transitions. [2019-09-10 08:19:29,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:19:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 837 transitions. [2019-09-10 08:19:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:29,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:29,519 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:29,519 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:29,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:29,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1671531983, now seen corresponding path program 1 times [2019-09-10 08:19:29,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:29,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:29,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:29,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:29,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:30,591 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:19:30,733 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-09-10 08:19:31,044 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-10 08:19:32,393 INFO 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:19:32,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:32,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:19:32,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:32,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:19:32,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:19:32,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:19:32,395 INFO L87 Difference]: Start difference. First operand 671 states and 837 transitions. Second operand 31 states. [2019-09-10 08:19:32,622 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-09-10 08:19:33,345 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 08:19:33,495 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-09-10 08:19:33,673 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-10 08:19:33,860 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 08:19:34,322 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-09-10 08:19:34,716 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2019-09-10 08:19:35,202 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 108 [2019-09-10 08:19:35,863 WARN L188 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 127 [2019-09-10 08:19:37,211 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 159 DAG size of output: 149 [2019-09-10 08:19:37,550 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 08:19:37,853 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-10 08:19:38,275 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-09-10 08:19:46,381 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-09-10 08:19:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:19:58,274 INFO L93 Difference]: Finished difference Result 2189 states and 2744 transitions. [2019-09-10 08:19:58,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 08:19:58,275 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-10 08:19:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:19:58,276 INFO L225 Difference]: With dead ends: 2189 [2019-09-10 08:19:58,277 INFO L226 Difference]: Without dead ends: 2189 [2019-09-10 08:19:58,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=581, Invalid=2959, Unknown=0, NotChecked=0, Total=3540 [2019-09-10 08:19:58,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2019-09-10 08:19:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 680. [2019-09-10 08:19:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-09-10 08:19:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 849 transitions. [2019-09-10 08:19:58,292 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 849 transitions. Word has length 104 [2019-09-10 08:19:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:19:58,292 INFO L475 AbstractCegarLoop]: Abstraction has 680 states and 849 transitions. [2019-09-10 08:19:58,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:19:58,293 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 849 transitions. [2019-09-10 08:19:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:19:58,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:19:58,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:19:58,294 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:19:58,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:19:58,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1056682376, now seen corresponding path program 1 times [2019-09-10 08:19:58,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:19:58,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:58,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:19:58,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:19:58,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:19:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:19:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:19:59,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:19:59,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:19:59,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:19:59,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:19:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:19:59,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:19:59,161 INFO L87 Difference]: Start difference. First operand 680 states and 849 transitions. Second operand 17 states. [2019-09-10 08:19:59,843 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:20:00,005 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:20:01,409 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-09-10 08:20:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:03,463 INFO L93 Difference]: Finished difference Result 1251 states and 1591 transitions. [2019-09-10 08:20:03,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:20:03,464 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:20:03,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:03,466 INFO L225 Difference]: With dead ends: 1251 [2019-09-10 08:20:03,466 INFO L226 Difference]: Without dead ends: 1251 [2019-09-10 08:20:03,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:20:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2019-09-10 08:20:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 660. [2019-09-10 08:20:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-10 08:20:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 822 transitions. [2019-09-10 08:20:03,478 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 822 transitions. Word has length 104 [2019-09-10 08:20:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:03,478 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 822 transitions. [2019-09-10 08:20:03,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:20:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 822 transitions. [2019-09-10 08:20:03,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:20:03,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:03,480 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:03,480 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:03,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:03,480 INFO L82 PathProgramCache]: Analyzing trace with hash -731627508, now seen corresponding path program 1 times [2019-09-10 08:20:03,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:03,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:03,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:03,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:03,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:05,237 INFO 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:20:05,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:05,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:20:05,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:05,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:20:05,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:20:05,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:20:05,239 INFO L87 Difference]: Start difference. First operand 660 states and 822 transitions. Second operand 22 states. [2019-09-10 08:20:06,467 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2019-09-10 08:20:06,746 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-09-10 08:20:07,185 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-09-10 08:20:07,364 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-09-10 08:20:07,795 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:20:08,164 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-10 08:20:08,370 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:20:08,623 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:20:09,409 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-10 08:20:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:12,716 INFO L93 Difference]: Finished difference Result 1258 states and 1585 transitions. [2019-09-10 08:20:12,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:20:12,716 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 104 [2019-09-10 08:20:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:12,717 INFO L225 Difference]: With dead ends: 1258 [2019-09-10 08:20:12,718 INFO L226 Difference]: Without dead ends: 1258 [2019-09-10 08:20:12,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:20:12,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-10 08:20:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 666. [2019-09-10 08:20:12,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2019-09-10 08:20:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 828 transitions. [2019-09-10 08:20:12,728 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 828 transitions. Word has length 104 [2019-09-10 08:20:12,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:12,728 INFO L475 AbstractCegarLoop]: Abstraction has 666 states and 828 transitions. [2019-09-10 08:20:12,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:20:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 828 transitions. [2019-09-10 08:20:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:20:12,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:12,730 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:12,730 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:12,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:12,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1599389865, now seen corresponding path program 1 times [2019-09-10 08:20:12,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:12,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:12,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:12,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:12,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:13,543 INFO 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:20:13,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:13,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:20:13,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:13,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:20:13,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:20:13,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:20:13,545 INFO L87 Difference]: Start difference. First operand 666 states and 828 transitions. Second operand 17 states. [2019-09-10 08:20:14,254 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-09-10 08:20:14,419 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:20:14,763 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2019-09-10 08:20:15,112 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-09-10 08:20:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:17,785 INFO L93 Difference]: Finished difference Result 1225 states and 1556 transitions. [2019-09-10 08:20:17,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:20:17,786 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:20:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:17,788 INFO L225 Difference]: With dead ends: 1225 [2019-09-10 08:20:17,788 INFO L226 Difference]: Without dead ends: 1225 [2019-09-10 08:20:17,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:20:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-10 08:20:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 659. [2019-09-10 08:20:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-10 08:20:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 817 transitions. [2019-09-10 08:20:17,798 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 817 transitions. Word has length 104 [2019-09-10 08:20:17,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:17,799 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 817 transitions. [2019-09-10 08:20:17,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:20:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 817 transitions. [2019-09-10 08:20:17,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:20:17,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:17,801 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:17,801 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:17,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:17,801 INFO L82 PathProgramCache]: Analyzing trace with hash -356139567, now seen corresponding path program 1 times [2019-09-10 08:20:17,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:17,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:17,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:17,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:17,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:18,717 INFO 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:20:18,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:18,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:20:18,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:18,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:20:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:20:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:20:18,718 INFO L87 Difference]: Start difference. First operand 659 states and 817 transitions. Second operand 17 states. [2019-09-10 08:20:19,444 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-09-10 08:20:19,634 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-10 08:20:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:22,931 INFO L93 Difference]: Finished difference Result 1219 states and 1546 transitions. [2019-09-10 08:20:22,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:20:22,931 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:20:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:22,933 INFO L225 Difference]: With dead ends: 1219 [2019-09-10 08:20:22,933 INFO L226 Difference]: Without dead ends: 1219 [2019-09-10 08:20:22,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:20:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2019-09-10 08:20:22,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 653. [2019-09-10 08:20:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-09-10 08:20:22,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 807 transitions. [2019-09-10 08:20:22,944 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 807 transitions. Word has length 104 [2019-09-10 08:20:22,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:22,945 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 807 transitions. [2019-09-10 08:20:22,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:20:22,945 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 807 transitions. [2019-09-10 08:20:22,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:20:22,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:22,946 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:22,947 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:22,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:22,947 INFO L82 PathProgramCache]: Analyzing trace with hash 2101815838, now seen corresponding path program 1 times [2019-09-10 08:20:22,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:22,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:22,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:22,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:23,823 INFO 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:20:23,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:23,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:20:23,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:23,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:20:23,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:20:23,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:20:23,825 INFO L87 Difference]: Start difference. First operand 653 states and 807 transitions. Second operand 16 states. [2019-09-10 08:20:24,654 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:20:24,830 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:20:25,028 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:20:25,241 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:20:25,440 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:20:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:29,637 INFO L93 Difference]: Finished difference Result 1105 states and 1337 transitions. [2019-09-10 08:20:29,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:20:29,638 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-10 08:20:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:29,640 INFO L225 Difference]: With dead ends: 1105 [2019-09-10 08:20:29,640 INFO L226 Difference]: Without dead ends: 1105 [2019-09-10 08:20:29,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:20:29,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-09-10 08:20:29,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 674. [2019-09-10 08:20:29,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-10 08:20:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 836 transitions. [2019-09-10 08:20:29,650 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 836 transitions. Word has length 104 [2019-09-10 08:20:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:29,651 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 836 transitions. [2019-09-10 08:20:29,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:20:29,651 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 836 transitions. [2019-09-10 08:20:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:20:29,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:29,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:29,653 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1657957713, now seen corresponding path program 1 times [2019-09-10 08:20:29,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:29,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:29,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:29,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:29,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:30,599 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-09-10 08:20:30,750 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:20:30,899 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-10 08:20:31,063 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-10 08:20:31,221 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-10 08:20:31,375 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:20:31,530 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:20:32,637 INFO 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:20:32,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:32,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-09-10 08:20:32,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:32,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 08:20:32,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 08:20:32,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:20:32,639 INFO L87 Difference]: Start difference. First operand 674 states and 836 transitions. Second operand 31 states. [2019-09-10 08:20:32,854 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:20:33,955 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-09-10 08:20:34,134 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-10 08:20:34,320 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2019-09-10 08:20:34,648 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-09-10 08:20:35,202 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-09-10 08:20:35,648 WARN L188 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 83 [2019-09-10 08:20:36,156 WARN L188 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 90 [2019-09-10 08:20:36,908 WARN L188 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 109 [2019-09-10 08:20:37,208 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 08:20:37,490 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 77 [2019-09-10 08:20:37,767 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-10 08:20:38,273 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-10 08:20:38,698 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-10 08:20:39,149 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 08:20:39,556 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2019-09-10 08:20:40,336 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-09-10 08:20:52,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:52,653 INFO L93 Difference]: Finished difference Result 1418 states and 1734 transitions. [2019-09-10 08:20:52,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-10 08:20:52,654 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 104 [2019-09-10 08:20:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:52,656 INFO L225 Difference]: With dead ends: 1418 [2019-09-10 08:20:52,656 INFO L226 Difference]: Without dead ends: 1418 [2019-09-10 08:20:52,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=655, Invalid=2315, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 08:20:52,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2019-09-10 08:20:52,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 684. [2019-09-10 08:20:52,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-09-10 08:20:52,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 847 transitions. [2019-09-10 08:20:52,665 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 847 transitions. Word has length 104 [2019-09-10 08:20:52,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:52,665 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 847 transitions. [2019-09-10 08:20:52,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 08:20:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 847 transitions. [2019-09-10 08:20:52,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:20:52,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:52,666 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:52,666 INFO L418 AbstractCegarLoop]: === Iteration 70 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:52,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:52,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1837373011, now seen corresponding path program 1 times [2019-09-10 08:20:52,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:52,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:52,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:52,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:52,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:53,528 INFO 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:20:53,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:53,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:20:53,528 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:53,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:20:53,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:20:53,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:20:53,529 INFO L87 Difference]: Start difference. First operand 684 states and 847 transitions. Second operand 17 states. [2019-09-10 08:20:54,291 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:20:56,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:20:56,671 INFO L93 Difference]: Finished difference Result 1259 states and 1598 transitions. [2019-09-10 08:20:56,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:20:56,671 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:20:56,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:20:56,674 INFO L225 Difference]: With dead ends: 1259 [2019-09-10 08:20:56,674 INFO L226 Difference]: Without dead ends: 1259 [2019-09-10 08:20:56,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:20:56,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2019-09-10 08:20:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 661. [2019-09-10 08:20:56,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-09-10 08:20:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 817 transitions. [2019-09-10 08:20:56,685 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 817 transitions. Word has length 104 [2019-09-10 08:20:56,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:20:56,686 INFO L475 AbstractCegarLoop]: Abstraction has 661 states and 817 transitions. [2019-09-10 08:20:56,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:20:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 817 transitions. [2019-09-10 08:20:56,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:20:56,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:20:56,687 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:20:56,688 INFO L418 AbstractCegarLoop]: === Iteration 71 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:20:56,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:20:56,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1726632168, now seen corresponding path program 1 times [2019-09-10 08:20:56,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:20:56,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:56,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:20:56,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:20:56,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:20:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:20:57,531 INFO 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:20:57,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:20:57,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:20:57,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:20:57,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:20:57,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:20:57,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:20:57,532 INFO L87 Difference]: Start difference. First operand 661 states and 817 transitions. Second operand 16 states. [2019-09-10 08:20:58,276 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:20:58,423 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:20:58,561 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:20:58,694 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 08:21:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:02,206 INFO L93 Difference]: Finished difference Result 1106 states and 1334 transitions. [2019-09-10 08:21:02,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:21:02,207 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-10 08:21:02,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:02,208 INFO L225 Difference]: With dead ends: 1106 [2019-09-10 08:21:02,208 INFO L226 Difference]: Without dead ends: 1106 [2019-09-10 08:21:02,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:21:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-10 08:21:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 679. [2019-09-10 08:21:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-10 08:21:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 841 transitions. [2019-09-10 08:21:02,217 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 841 transitions. Word has length 104 [2019-09-10 08:21:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:02,218 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 841 transitions. [2019-09-10 08:21:02,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:21:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 841 transitions. [2019-09-10 08:21:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:21:02,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:02,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:02,219 INFO L418 AbstractCegarLoop]: === Iteration 72 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1213486746, now seen corresponding path program 1 times [2019-09-10 08:21:02,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:02,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:02,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:02,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:02,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:02,943 INFO 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:21:02,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:02,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:21:02,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:02,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:21:02,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:21:02,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:21:02,944 INFO L87 Difference]: Start difference. First operand 679 states and 841 transitions. Second operand 16 states. [2019-09-10 08:21:03,675 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:21:03,825 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 08:21:03,976 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-10 08:21:04,119 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-09-10 08:21:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:07,397 INFO L93 Difference]: Finished difference Result 1085 states and 1317 transitions. [2019-09-10 08:21:07,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:21:07,397 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 104 [2019-09-10 08:21:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:07,399 INFO L225 Difference]: With dead ends: 1085 [2019-09-10 08:21:07,399 INFO L226 Difference]: Without dead ends: 1085 [2019-09-10 08:21:07,399 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:21:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-09-10 08:21:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 683. [2019-09-10 08:21:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-09-10 08:21:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 846 transitions. [2019-09-10 08:21:07,406 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 846 transitions. Word has length 104 [2019-09-10 08:21:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:07,407 INFO L475 AbstractCegarLoop]: Abstraction has 683 states and 846 transitions. [2019-09-10 08:21:07,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:21:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 846 transitions. [2019-09-10 08:21:07,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:21:07,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:07,408 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:07,408 INFO L418 AbstractCegarLoop]: === Iteration 73 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:07,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1657511695, now seen corresponding path program 1 times [2019-09-10 08:21:07,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:07,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:07,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:07,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:07,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:08,820 INFO 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:21:08,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:08,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-10 08:21:08,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:08,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 08:21:08,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 08:21:08,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:21:08,821 INFO L87 Difference]: Start difference. First operand 683 states and 846 transitions. Second operand 22 states. [2019-09-10 08:21:09,915 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2019-09-10 08:21:10,201 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-09-10 08:21:10,533 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-09-10 08:21:10,724 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-10 08:21:11,027 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-10 08:21:11,304 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2019-09-10 08:21:11,472 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:21:11,700 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-09-10 08:21:12,174 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-10 08:21:14,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:14,644 INFO L93 Difference]: Finished difference Result 1258 states and 1571 transitions. [2019-09-10 08:21:14,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-10 08:21:14,645 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 104 [2019-09-10 08:21:14,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:14,646 INFO L225 Difference]: With dead ends: 1258 [2019-09-10 08:21:14,646 INFO L226 Difference]: Without dead ends: 1258 [2019-09-10 08:21:14,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:21:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-10 08:21:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 695. [2019-09-10 08:21:14,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-09-10 08:21:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 858 transitions. [2019-09-10 08:21:14,655 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 858 transitions. Word has length 104 [2019-09-10 08:21:14,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:14,655 INFO L475 AbstractCegarLoop]: Abstraction has 695 states and 858 transitions. [2019-09-10 08:21:14,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 08:21:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 858 transitions. [2019-09-10 08:21:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:21:14,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:14,656 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:14,656 INFO L418 AbstractCegarLoop]: === Iteration 74 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:14,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:14,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1499785276, now seen corresponding path program 1 times [2019-09-10 08:21:14,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:14,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:14,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:14,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:14,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:15,425 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2019-09-10 08:21:15,574 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-10 08:21:15,738 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:21:15,900 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-09-10 08:21:16,051 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-10 08:21:17,198 INFO 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:21:17,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:17,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-10 08:21:17,199 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:17,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 08:21:17,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 08:21:17,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2019-09-10 08:21:17,199 INFO L87 Difference]: Start difference. First operand 695 states and 858 transitions. Second operand 30 states. [2019-09-10 08:21:17,430 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2019-09-10 08:21:18,480 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2019-09-10 08:21:18,668 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2019-09-10 08:21:18,963 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:21:19,433 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 71 [2019-09-10 08:21:19,794 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 78 [2019-09-10 08:21:20,250 WARN L188 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 85 [2019-09-10 08:21:20,740 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93 [2019-09-10 08:21:21,059 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:21:21,364 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2019-09-10 08:21:21,666 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 73 [2019-09-10 08:21:21,916 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 08:21:22,191 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-09-10 08:21:22,590 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-09-10 08:21:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:34,474 INFO L93 Difference]: Finished difference Result 1486 states and 1832 transitions. [2019-09-10 08:21:34,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 08:21:34,474 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 104 [2019-09-10 08:21:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:34,476 INFO L225 Difference]: With dead ends: 1486 [2019-09-10 08:21:34,476 INFO L226 Difference]: Without dead ends: 1486 [2019-09-10 08:21:34,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=549, Invalid=2001, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 08:21:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2019-09-10 08:21:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 711. [2019-09-10 08:21:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-09-10 08:21:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 876 transitions. [2019-09-10 08:21:34,483 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 876 transitions. Word has length 104 [2019-09-10 08:21:34,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:34,483 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 876 transitions. [2019-09-10 08:21:34,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 08:21:34,483 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 876 transitions. [2019-09-10 08:21:34,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:21:34,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:34,484 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:34,484 INFO L418 AbstractCegarLoop]: === Iteration 75 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:34,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:34,485 INFO L82 PathProgramCache]: Analyzing trace with hash -464164647, now seen corresponding path program 1 times [2019-09-10 08:21:34,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:34,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:34,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:34,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:34,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:35,616 INFO 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:21:35,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:35,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-10 08:21:35,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:35,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:21:35,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:21:35,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:21:35,618 INFO L87 Difference]: Start difference. First operand 711 states and 876 transitions. Second operand 20 states. [2019-09-10 08:21:35,756 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 38 [2019-09-10 08:21:36,395 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-09-10 08:21:36,685 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2019-09-10 08:21:36,944 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-09-10 08:21:37,138 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:21:37,347 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-09-10 08:21:37,535 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-09-10 08:21:37,691 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:21:37,855 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2019-09-10 08:21:38,098 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2019-09-10 08:21:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:42,196 INFO L93 Difference]: Finished difference Result 1313 states and 1613 transitions. [2019-09-10 08:21:42,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:21:42,197 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 104 [2019-09-10 08:21:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:42,198 INFO L225 Difference]: With dead ends: 1313 [2019-09-10 08:21:42,199 INFO L226 Difference]: Without dead ends: 1313 [2019-09-10 08:21:42,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=297, Invalid=893, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:21:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-09-10 08:21:42,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 701. [2019-09-10 08:21:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-09-10 08:21:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 864 transitions. [2019-09-10 08:21:42,206 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 864 transitions. Word has length 104 [2019-09-10 08:21:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:42,206 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 864 transitions. [2019-09-10 08:21:42,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:21:42,206 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 864 transitions. [2019-09-10 08:21:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:21:42,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:42,207 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:21:42,207 INFO L418 AbstractCegarLoop]: === Iteration 76 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:42,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1008248256, now seen corresponding path program 1 times [2019-09-10 08:21:42,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:42,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:42,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:42,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:42,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:42,979 INFO 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:21:42,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:42,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:21:42,979 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:42,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:21:42,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:21:42,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:21:42,980 INFO L87 Difference]: Start difference. First operand 701 states and 864 transitions. Second operand 17 states. [2019-09-10 08:21:43,687 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:21:43,846 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:21:47,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:21:47,767 INFO L93 Difference]: Finished difference Result 1215 states and 1533 transitions. [2019-09-10 08:21:47,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:21:47,768 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:21:47,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:21:47,770 INFO L225 Difference]: With dead ends: 1215 [2019-09-10 08:21:47,770 INFO L226 Difference]: Without dead ends: 1215 [2019-09-10 08:21:47,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:21:47,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-09-10 08:21:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 701. [2019-09-10 08:21:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-09-10 08:21:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 862 transitions. [2019-09-10 08:21:47,780 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 862 transitions. Word has length 104 [2019-09-10 08:21:47,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:21:47,780 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 862 transitions. [2019-09-10 08:21:47,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:21:47,780 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 862 transitions. [2019-09-10 08:21:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:21:47,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:21:47,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] [2019-09-10 08:21:47,782 INFO L418 AbstractCegarLoop]: === Iteration 77 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:21:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:21:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1599888547, now seen corresponding path program 1 times [2019-09-10 08:21:47,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:21:47,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:47,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:21:47,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:21:47,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:21:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:21:48,093 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-09-10 08:21:49,094 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2019-09-10 08:21:50,019 INFO 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:21:50,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:21:50,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 08:21:50,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:21:50,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:21:50,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:21:50,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:21:50,021 INFO L87 Difference]: Start difference. First operand 701 states and 862 transitions. Second operand 27 states. [2019-09-10 08:21:50,195 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:21:50,964 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-09-10 08:21:51,239 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:21:51,868 WARN L188 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2019-09-10 08:21:52,252 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2019-09-10 08:21:52,701 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 88 [2019-09-10 08:21:53,405 WARN L188 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 93 [2019-09-10 08:21:53,664 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-09-10 08:21:54,022 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-09-10 08:21:54,319 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-09-10 08:21:54,664 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:21:54,977 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2019-09-10 08:21:55,529 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:22:03,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:03,801 INFO L93 Difference]: Finished difference Result 1257 states and 1566 transitions. [2019-09-10 08:22:03,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:22:03,802 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2019-09-10 08:22:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:03,804 INFO L225 Difference]: With dead ends: 1257 [2019-09-10 08:22:03,804 INFO L226 Difference]: Without dead ends: 1257 [2019-09-10 08:22:03,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:22:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2019-09-10 08:22:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 712. [2019-09-10 08:22:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-10 08:22:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 874 transitions. [2019-09-10 08:22:03,811 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 874 transitions. Word has length 104 [2019-09-10 08:22:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:03,811 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 874 transitions. [2019-09-10 08:22:03,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:22:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 874 transitions. [2019-09-10 08:22:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:22:03,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:03,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] [2019-09-10 08:22:03,812 INFO L418 AbstractCegarLoop]: === Iteration 78 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:03,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1392964829, now seen corresponding path program 1 times [2019-09-10 08:22:03,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:03,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:03,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:03,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:03,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:04,666 INFO 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:22:04,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:04,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:22:04,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:04,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:22:04,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:22:04,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:22:04,667 INFO L87 Difference]: Start difference. First operand 712 states and 874 transitions. Second operand 17 states. [2019-09-10 08:22:05,449 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2019-09-10 08:22:05,609 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:22:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:10,376 INFO L93 Difference]: Finished difference Result 1224 states and 1538 transitions. [2019-09-10 08:22:10,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:22:10,377 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:22:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:10,378 INFO L225 Difference]: With dead ends: 1224 [2019-09-10 08:22:10,378 INFO L226 Difference]: Without dead ends: 1224 [2019-09-10 08:22:10,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:22:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-09-10 08:22:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 712. [2019-09-10 08:22:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-09-10 08:22:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 872 transitions. [2019-09-10 08:22:10,386 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 872 transitions. Word has length 104 [2019-09-10 08:22:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:10,386 INFO L475 AbstractCegarLoop]: Abstraction has 712 states and 872 transitions. [2019-09-10 08:22:10,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:22:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 872 transitions. [2019-09-10 08:22:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:22:10,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:10,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] [2019-09-10 08:22:10,388 INFO L418 AbstractCegarLoop]: === Iteration 79 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:10,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:10,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1748743276, now seen corresponding path program 1 times [2019-09-10 08:22:10,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:10,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:10,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:10,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:10,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:11,455 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-09-10 08:22:11,606 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:22:11,746 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:22:12,608 INFO 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:22:12,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:12,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-10 08:22:12,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:12,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 08:22:12,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 08:22:12,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:22:12,609 INFO L87 Difference]: Start difference. First operand 712 states and 872 transitions. Second operand 27 states. [2019-09-10 08:22:12,787 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-09-10 08:22:13,468 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-09-10 08:22:13,622 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 08:22:13,818 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-09-10 08:22:14,403 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 81 [2019-09-10 08:22:14,765 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 74 [2019-09-10 08:22:15,213 WARN L188 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-09-10 08:22:15,686 WARN L188 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 93 [2019-09-10 08:22:15,923 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-09-10 08:22:16,221 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2019-09-10 08:22:16,504 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-09-10 08:22:16,773 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:22:17,045 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-09-10 08:22:17,507 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-09-10 08:22:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:24,106 INFO L93 Difference]: Finished difference Result 1245 states and 1545 transitions. [2019-09-10 08:22:24,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 08:22:24,106 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 104 [2019-09-10 08:22:24,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:24,108 INFO L225 Difference]: With dead ends: 1245 [2019-09-10 08:22:24,108 INFO L226 Difference]: Without dead ends: 1245 [2019-09-10 08:22:24,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=433, Invalid=1547, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 08:22:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2019-09-10 08:22:24,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 723. [2019-09-10 08:22:24,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2019-09-10 08:22:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 884 transitions. [2019-09-10 08:22:24,116 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 884 transitions. Word has length 104 [2019-09-10 08:22:24,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:24,116 INFO L475 AbstractCegarLoop]: Abstraction has 723 states and 884 transitions. [2019-09-10 08:22:24,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 08:22:24,116 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 884 transitions. [2019-09-10 08:22:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-10 08:22:24,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:24,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:24,118 INFO L418 AbstractCegarLoop]: === Iteration 80 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:24,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:24,118 INFO L82 PathProgramCache]: Analyzing trace with hash 88268615, now seen corresponding path program 1 times [2019-09-10 08:22:24,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:24,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:24,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:24,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:24,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:25,001 INFO 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:22:25,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:25,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:22:25,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:25,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:22:25,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:22:25,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:22:25,003 INFO L87 Difference]: Start difference. First operand 723 states and 884 transitions. Second operand 17 states. [2019-09-10 08:22:25,688 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-09-10 08:22:25,861 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-10 08:22:27,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:27,532 INFO L93 Difference]: Finished difference Result 1137 states and 1428 transitions. [2019-09-10 08:22:27,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:22:27,533 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 104 [2019-09-10 08:22:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:27,534 INFO L225 Difference]: With dead ends: 1137 [2019-09-10 08:22:27,535 INFO L226 Difference]: Without dead ends: 1137 [2019-09-10 08:22:27,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:22:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-10 08:22:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 659. [2019-09-10 08:22:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-10 08:22:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 804 transitions. [2019-09-10 08:22:27,542 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 804 transitions. Word has length 104 [2019-09-10 08:22:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:27,542 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 804 transitions. [2019-09-10 08:22:27,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:22:27,543 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 804 transitions. [2019-09-10 08:22:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:22:27,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:27,544 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:27,544 INFO L418 AbstractCegarLoop]: === Iteration 81 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1710464, now seen corresponding path program 1 times [2019-09-10 08:22:27,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:27,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:27,748 INFO 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:22:27,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:27,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:27,748 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:27,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:27,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:27,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:27,750 INFO L87 Difference]: Start difference. First operand 659 states and 804 transitions. Second operand 9 states. [2019-09-10 08:22:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:30,015 INFO L93 Difference]: Finished difference Result 1056 states and 1325 transitions. [2019-09-10 08:22:30,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:30,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:22:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:30,018 INFO L225 Difference]: With dead ends: 1056 [2019-09-10 08:22:30,018 INFO L226 Difference]: Without dead ends: 1056 [2019-09-10 08:22:30,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:30,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-09-10 08:22:30,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 659. [2019-09-10 08:22:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-10 08:22:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 802 transitions. [2019-09-10 08:22:30,026 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 802 transitions. Word has length 105 [2019-09-10 08:22:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:30,026 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 802 transitions. [2019-09-10 08:22:30,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 802 transitions. [2019-09-10 08:22:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:22:30,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:30,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:30,027 INFO L418 AbstractCegarLoop]: === Iteration 82 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:30,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1026369323, now seen corresponding path program 1 times [2019-09-10 08:22:30,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:30,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:30,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:30,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:30,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:30,219 INFO 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:22:30,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:30,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:30,220 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:30,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:30,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:30,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:30,221 INFO L87 Difference]: Start difference. First operand 659 states and 802 transitions. Second operand 9 states. [2019-09-10 08:22:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:32,377 INFO L93 Difference]: Finished difference Result 1085 states and 1362 transitions. [2019-09-10 08:22:32,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:32,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 105 [2019-09-10 08:22:32,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:32,379 INFO L225 Difference]: With dead ends: 1085 [2019-09-10 08:22:32,379 INFO L226 Difference]: Without dead ends: 1085 [2019-09-10 08:22:32,379 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:22:32,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2019-09-10 08:22:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 659. [2019-09-10 08:22:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-09-10 08:22:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 800 transitions. [2019-09-10 08:22:32,387 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 800 transitions. Word has length 105 [2019-09-10 08:22:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:32,387 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 800 transitions. [2019-09-10 08:22:32,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:32,388 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 800 transitions. [2019-09-10 08:22:32,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:22:32,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:32,389 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:32,389 INFO L418 AbstractCegarLoop]: === Iteration 83 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:32,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1566388671, now seen corresponding path program 1 times [2019-09-10 08:22:32,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:32,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:32,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:32,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:32,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:32,823 INFO 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:22:32,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:32,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:22:32,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:32,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:22:32,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:22:32,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:22:32,824 INFO L87 Difference]: Start difference. First operand 659 states and 800 transitions. Second operand 11 states. [2019-09-10 08:22:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:34,422 INFO L93 Difference]: Finished difference Result 1563 states and 2011 transitions. [2019-09-10 08:22:34,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:22:34,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-10 08:22:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:34,425 INFO L225 Difference]: With dead ends: 1563 [2019-09-10 08:22:34,425 INFO L226 Difference]: Without dead ends: 1563 [2019-09-10 08:22:34,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:22:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2019-09-10 08:22:34,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 637. [2019-09-10 08:22:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-09-10 08:22:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 775 transitions. [2019-09-10 08:22:34,433 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 775 transitions. Word has length 105 [2019-09-10 08:22:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:34,434 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 775 transitions. [2019-09-10 08:22:34,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:22:34,434 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 775 transitions. [2019-09-10 08:22:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:22:34,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:34,435 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:34,435 INFO L418 AbstractCegarLoop]: === Iteration 84 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:34,435 INFO L82 PathProgramCache]: Analyzing trace with hash 426480591, now seen corresponding path program 1 times [2019-09-10 08:22:34,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:34,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:34,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:34,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:34,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:35,173 INFO 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:22:35,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:35,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:22:35,174 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:35,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:22:35,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:22:35,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:22:35,175 INFO L87 Difference]: Start difference. First operand 637 states and 775 transitions. Second operand 16 states. [2019-09-10 08:22:35,880 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 08:22:36,855 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-09-10 08:22:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:39,475 INFO L93 Difference]: Finished difference Result 1273 states and 1629 transitions. [2019-09-10 08:22:39,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:22:39,475 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2019-09-10 08:22:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:39,477 INFO L225 Difference]: With dead ends: 1273 [2019-09-10 08:22:39,477 INFO L226 Difference]: Without dead ends: 1273 [2019-09-10 08:22:39,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=172, Invalid=584, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:22:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2019-09-10 08:22:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 643. [2019-09-10 08:22:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-09-10 08:22:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 782 transitions. [2019-09-10 08:22:39,484 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 782 transitions. Word has length 105 [2019-09-10 08:22:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:39,484 INFO L475 AbstractCegarLoop]: Abstraction has 643 states and 782 transitions. [2019-09-10 08:22:39,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:22:39,485 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 782 transitions. [2019-09-10 08:22:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:22:39,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:39,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] [2019-09-10 08:22:39,486 INFO L418 AbstractCegarLoop]: === Iteration 85 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:39,486 INFO L82 PathProgramCache]: Analyzing trace with hash -491192768, now seen corresponding path program 1 times [2019-09-10 08:22:39,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:39,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:39,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:39,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:39,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:41,013 INFO 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:22:41,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:41,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:22:41,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:41,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:22:41,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:22:41,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:41,014 INFO L87 Difference]: Start difference. First operand 643 states and 782 transitions. Second operand 21 states. [2019-09-10 08:22:41,167 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-09-10 08:22:42,114 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2019-09-10 08:22:42,338 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2019-09-10 08:22:42,664 WARN L188 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 68 [2019-09-10 08:22:42,906 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 08:22:43,141 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-09-10 08:22:48,027 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2019-09-10 08:22:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:49,351 INFO L93 Difference]: Finished difference Result 1068 states and 1289 transitions. [2019-09-10 08:22:49,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:22:49,352 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-10 08:22:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:49,353 INFO L225 Difference]: With dead ends: 1068 [2019-09-10 08:22:49,353 INFO L226 Difference]: Without dead ends: 1068 [2019-09-10 08:22:49,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=247, Invalid=1085, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 08:22:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-09-10 08:22:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 644. [2019-09-10 08:22:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-10 08:22:49,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 784 transitions. [2019-09-10 08:22:49,362 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 784 transitions. Word has length 105 [2019-09-10 08:22:49,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:49,362 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 784 transitions. [2019-09-10 08:22:49,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:22:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 784 transitions. [2019-09-10 08:22:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:22:49,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:49,364 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:49,364 INFO L418 AbstractCegarLoop]: === Iteration 86 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:49,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:49,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1169420094, now seen corresponding path program 1 times [2019-09-10 08:22:49,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:49,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:49,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:49,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:49,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:50,186 INFO 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:22:50,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:50,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:22:50,187 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:50,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:22:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:22:50,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:22:50,188 INFO L87 Difference]: Start difference. First operand 644 states and 784 transitions. Second operand 17 states. [2019-09-10 08:22:50,956 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-09-10 08:22:51,115 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-10 08:22:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:53,151 INFO L93 Difference]: Finished difference Result 1066 states and 1345 transitions. [2019-09-10 08:22:53,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:22:53,151 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 105 [2019-09-10 08:22:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:53,153 INFO L225 Difference]: With dead ends: 1066 [2019-09-10 08:22:53,153 INFO L226 Difference]: Without dead ends: 1066 [2019-09-10 08:22:53,153 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:22:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-09-10 08:22:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 621. [2019-09-10 08:22:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-10 08:22:53,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 757 transitions. [2019-09-10 08:22:53,160 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 757 transitions. Word has length 105 [2019-09-10 08:22:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:53,161 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 757 transitions. [2019-09-10 08:22:53,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:22:53,161 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 757 transitions. [2019-09-10 08:22:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:22:53,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:53,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:53,162 INFO L418 AbstractCegarLoop]: === Iteration 87 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:53,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:53,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1010302235, now seen corresponding path program 1 times [2019-09-10 08:22:53,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:53,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:53,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:53,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:54,516 INFO 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:22:54,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:54,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:22:54,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:54,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:22:54,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:22:54,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:22:54,517 INFO L87 Difference]: Start difference. First operand 621 states and 757 transitions. Second operand 21 states. [2019-09-10 08:22:54,666 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-10 08:22:55,572 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2019-09-10 08:22:55,792 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2019-09-10 08:22:56,086 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-09-10 08:22:56,291 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:22:56,493 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-10 08:22:56,715 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-09-10 08:23:01,276 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-10 08:23:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:02,086 INFO L93 Difference]: Finished difference Result 1011 states and 1218 transitions. [2019-09-10 08:23:02,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 08:23:02,087 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-10 08:23:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:02,089 INFO L225 Difference]: With dead ends: 1011 [2019-09-10 08:23:02,089 INFO L226 Difference]: Without dead ends: 1011 [2019-09-10 08:23:02,090 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 08:23:02,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-09-10 08:23:02,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 637. [2019-09-10 08:23:02,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 637 states. [2019-09-10 08:23:02,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 777 transitions. [2019-09-10 08:23:02,097 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 777 transitions. Word has length 105 [2019-09-10 08:23:02,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:02,098 INFO L475 AbstractCegarLoop]: Abstraction has 637 states and 777 transitions. [2019-09-10 08:23:02,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:23:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 777 transitions. [2019-09-10 08:23:02,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:23:02,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:02,099 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:02,099 INFO L418 AbstractCegarLoop]: === Iteration 88 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:02,099 INFO L82 PathProgramCache]: Analyzing trace with hash 556450702, now seen corresponding path program 1 times [2019-09-10 08:23:02,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:02,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:02,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:02,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:02,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:02,537 INFO 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:23:02,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:02,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:23:02,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:02,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:23:02,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:23:02,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:23:02,538 INFO L87 Difference]: Start difference. First operand 637 states and 777 transitions. Second operand 11 states. [2019-09-10 08:23:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:04,078 INFO L93 Difference]: Finished difference Result 1407 states and 1853 transitions. [2019-09-10 08:23:04,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:04,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-10 08:23:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:04,080 INFO L225 Difference]: With dead ends: 1407 [2019-09-10 08:23:04,081 INFO L226 Difference]: Without dead ends: 1407 [2019-09-10 08:23:04,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:23:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2019-09-10 08:23:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 626. [2019-09-10 08:23:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 08:23:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 762 transitions. [2019-09-10 08:23:04,088 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 762 transitions. Word has length 105 [2019-09-10 08:23:04,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:04,088 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 762 transitions. [2019-09-10 08:23:04,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:23:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 762 transitions. [2019-09-10 08:23:04,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:23:04,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:04,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] [2019-09-10 08:23:04,089 INFO L418 AbstractCegarLoop]: === Iteration 89 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:04,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:04,090 INFO L82 PathProgramCache]: Analyzing trace with hash 593307121, now seen corresponding path program 1 times [2019-09-10 08:23:04,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:04,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:04,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:04,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:04,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:05,421 INFO 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:23:05,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:05,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:23:05,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:05,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:23:05,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:23:05,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:05,423 INFO L87 Difference]: Start difference. First operand 626 states and 762 transitions. Second operand 21 states. [2019-09-10 08:23:06,646 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-09-10 08:23:06,970 WARN L188 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2019-09-10 08:23:07,176 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:23:07,360 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-10 08:23:07,547 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2019-09-10 08:23:08,238 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-09-10 08:23:08,937 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-10 08:23:09,362 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:23:09,679 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-10 08:23:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:13,073 INFO L93 Difference]: Finished difference Result 1156 states and 1393 transitions. [2019-09-10 08:23:13,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 08:23:13,074 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-09-10 08:23:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:13,075 INFO L225 Difference]: With dead ends: 1156 [2019-09-10 08:23:13,075 INFO L226 Difference]: Without dead ends: 1156 [2019-09-10 08:23:13,076 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=340, Invalid=1066, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:23:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-09-10 08:23:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 626. [2019-09-10 08:23:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-10 08:23:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 761 transitions. [2019-09-10 08:23:13,084 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 761 transitions. Word has length 105 [2019-09-10 08:23:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:13,084 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 761 transitions. [2019-09-10 08:23:13,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:23:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 761 transitions. [2019-09-10 08:23:13,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:23:13,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:13,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:13,086 INFO L418 AbstractCegarLoop]: === Iteration 90 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:13,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1230801955, now seen corresponding path program 1 times [2019-09-10 08:23:13,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:13,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:13,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:13,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:13,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:13,966 INFO 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:23:13,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:13,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:23:13,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:13,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:23:13,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:23:13,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:23:13,967 INFO L87 Difference]: Start difference. First operand 626 states and 761 transitions. Second operand 16 states. [2019-09-10 08:23:14,784 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-09-10 08:23:14,952 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:23:15,128 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2019-09-10 08:23:15,332 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:23:15,525 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-10 08:23:18,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:18,613 INFO L93 Difference]: Finished difference Result 988 states and 1188 transitions. [2019-09-10 08:23:18,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 08:23:18,614 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2019-09-10 08:23:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:18,615 INFO L225 Difference]: With dead ends: 988 [2019-09-10 08:23:18,615 INFO L226 Difference]: Without dead ends: 988 [2019-09-10 08:23:18,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=220, Invalid=710, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:23:18,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-09-10 08:23:18,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 636. [2019-09-10 08:23:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-10 08:23:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 774 transitions. [2019-09-10 08:23:18,622 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 774 transitions. Word has length 105 [2019-09-10 08:23:18,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:18,622 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 774 transitions. [2019-09-10 08:23:18,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:23:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 774 transitions. [2019-09-10 08:23:18,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:23:18,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:18,623 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:18,623 INFO L418 AbstractCegarLoop]: === Iteration 91 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1674768317, now seen corresponding path program 1 times [2019-09-10 08:23:18,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:18,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:18,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:18,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:18,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:19,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:23:19,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:19,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:23:19,391 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:19,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:23:19,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:23:19,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:23:19,392 INFO L87 Difference]: Start difference. First operand 636 states and 774 transitions. Second operand 17 states. [2019-09-10 08:23:20,008 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2019-09-10 08:23:20,208 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-09-10 08:23:20,411 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:23:20,621 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:23:20,899 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:23:21,184 WARN L188 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:23:21,591 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-09-10 08:23:21,956 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 33 [2019-09-10 08:23:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:23,413 INFO L93 Difference]: Finished difference Result 1487 states and 1919 transitions. [2019-09-10 08:23:23,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:23:23,413 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 105 [2019-09-10 08:23:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:23,415 INFO L225 Difference]: With dead ends: 1487 [2019-09-10 08:23:23,415 INFO L226 Difference]: Without dead ends: 1487 [2019-09-10 08:23:23,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2019-09-10 08:23:23,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2019-09-10 08:23:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 600. [2019-09-10 08:23:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-09-10 08:23:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 728 transitions. [2019-09-10 08:23:23,424 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 728 transitions. Word has length 105 [2019-09-10 08:23:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:23,424 INFO L475 AbstractCegarLoop]: Abstraction has 600 states and 728 transitions. [2019-09-10 08:23:23,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:23:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 728 transitions. [2019-09-10 08:23:23,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:23:23,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:23,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] [2019-09-10 08:23:23,425 INFO L418 AbstractCegarLoop]: === Iteration 92 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:23,426 INFO L82 PathProgramCache]: Analyzing trace with hash 390784349, now seen corresponding path program 1 times [2019-09-10 08:23:23,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:23,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:23,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:23,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:23,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:23,965 INFO 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:23:23,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:23,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-10 08:23:23,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:23,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:23:23,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:23:23,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:23:23,966 INFO L87 Difference]: Start difference. First operand 600 states and 728 transitions. Second operand 12 states. [2019-09-10 08:23:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:25,032 INFO L93 Difference]: Finished difference Result 1064 states and 1368 transitions. [2019-09-10 08:23:25,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 08:23:25,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2019-09-10 08:23:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:25,034 INFO L225 Difference]: With dead ends: 1064 [2019-09-10 08:23:25,035 INFO L226 Difference]: Without dead ends: 1064 [2019-09-10 08:23:25,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-10 08:23:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-09-10 08:23:25,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 472. [2019-09-10 08:23:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-10 08:23:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 576 transitions. [2019-09-10 08:23:25,043 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 576 transitions. Word has length 105 [2019-09-10 08:23:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:25,044 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 576 transitions. [2019-09-10 08:23:25,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:23:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 576 transitions. [2019-09-10 08:23:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:23:25,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:25,045 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:25,045 INFO L418 AbstractCegarLoop]: === Iteration 93 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:25,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2094054007, now seen corresponding path program 1 times [2019-09-10 08:23:25,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:25,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:25,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:25,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:25,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:25,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:25,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:25,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:23:25,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:25,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:23:25,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:23:25,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:23:25,885 INFO L87 Difference]: Start difference. First operand 472 states and 576 transitions. Second operand 16 states. [2019-09-10 08:23:26,724 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:23:26,881 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:23:27,028 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:23:27,170 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 08:23:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:29,514 INFO L93 Difference]: Finished difference Result 748 states and 910 transitions. [2019-09-10 08:23:29,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:23:29,514 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 105 [2019-09-10 08:23:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:29,516 INFO L225 Difference]: With dead ends: 748 [2019-09-10 08:23:29,516 INFO L226 Difference]: Without dead ends: 748 [2019-09-10 08:23:29,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:23:29,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-10 08:23:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 479. [2019-09-10 08:23:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2019-09-10 08:23:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 585 transitions. [2019-09-10 08:23:29,523 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 585 transitions. Word has length 105 [2019-09-10 08:23:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:29,523 INFO L475 AbstractCegarLoop]: Abstraction has 479 states and 585 transitions. [2019-09-10 08:23:29,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:23:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 585 transitions. [2019-09-10 08:23:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:23:29,524 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:29,524 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:29,524 INFO L418 AbstractCegarLoop]: === Iteration 94 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:29,525 INFO L82 PathProgramCache]: Analyzing trace with hash 238920912, now seen corresponding path program 1 times [2019-09-10 08:23:29,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:29,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:29,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:29,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:30,216 INFO 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:23:30,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:30,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 08:23:30,217 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:30,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 08:23:30,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 08:23:30,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 08:23:30,218 INFO L87 Difference]: Start difference. First operand 479 states and 585 transitions. Second operand 15 states. [2019-09-10 08:23:30,866 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-10 08:23:31,026 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:23:31,162 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-10 08:23:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:32,564 INFO L93 Difference]: Finished difference Result 915 states and 1185 transitions. [2019-09-10 08:23:32,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 08:23:32,565 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2019-09-10 08:23:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:32,566 INFO L225 Difference]: With dead ends: 915 [2019-09-10 08:23:32,567 INFO L226 Difference]: Without dead ends: 915 [2019-09-10 08:23:32,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:23:32,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-10 08:23:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 418. [2019-09-10 08:23:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-09-10 08:23:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 511 transitions. [2019-09-10 08:23:32,573 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 511 transitions. Word has length 105 [2019-09-10 08:23:32,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:32,573 INFO L475 AbstractCegarLoop]: Abstraction has 418 states and 511 transitions. [2019-09-10 08:23:32,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 08:23:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 511 transitions. [2019-09-10 08:23:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:23:32,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:32,574 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:32,574 INFO L418 AbstractCegarLoop]: === Iteration 95 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:32,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:32,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1983508514, now seen corresponding path program 1 times [2019-09-10 08:23:32,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:32,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:32,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:32,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:33,023 INFO 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:23:33,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:33,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:23:33,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:33,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:23:33,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:23:33,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:23:33,024 INFO L87 Difference]: Start difference. First operand 418 states and 511 transitions. Second operand 11 states. [2019-09-10 08:23:33,521 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-10 08:23:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:34,253 INFO L93 Difference]: Finished difference Result 702 states and 904 transitions. [2019-09-10 08:23:34,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:34,254 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 105 [2019-09-10 08:23:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:34,255 INFO L225 Difference]: With dead ends: 702 [2019-09-10 08:23:34,255 INFO L226 Difference]: Without dead ends: 702 [2019-09-10 08:23:34,255 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-09-10 08:23:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 294. [2019-09-10 08:23:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-10 08:23:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 355 transitions. [2019-09-10 08:23:34,260 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 355 transitions. Word has length 105 [2019-09-10 08:23:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:34,260 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 355 transitions. [2019-09-10 08:23:34,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:23:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 355 transitions. [2019-09-10 08:23:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 08:23:34,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:34,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:34,261 INFO L418 AbstractCegarLoop]: === Iteration 96 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:34,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash -137973323, now seen corresponding path program 1 times [2019-09-10 08:23:34,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:34,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:34,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:34,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:35,000 INFO 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:23:35,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:35,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:23:35,000 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:35,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:23:35,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:23:35,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:23:35,001 INFO L87 Difference]: Start difference. First operand 294 states and 355 transitions. Second operand 13 states. [2019-09-10 08:23:35,153 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-09-10 08:23:35,389 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-09-10 08:23:35,528 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-09-10 08:23:35,710 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2019-09-10 08:23:35,938 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-10 08:23:36,163 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-09-10 08:23:36,518 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 30 [2019-09-10 08:23:36,763 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2019-09-10 08:23:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:37,622 INFO L93 Difference]: Finished difference Result 1030 states and 1412 transitions. [2019-09-10 08:23:37,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 08:23:37,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 105 [2019-09-10 08:23:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:37,625 INFO L225 Difference]: With dead ends: 1030 [2019-09-10 08:23:37,625 INFO L226 Difference]: Without dead ends: 1030 [2019-09-10 08:23:37,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-09-10 08:23:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-09-10 08:23:37,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 250. [2019-09-10 08:23:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-10 08:23:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 302 transitions. [2019-09-10 08:23:37,629 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 302 transitions. Word has length 105 [2019-09-10 08:23:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:37,630 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 302 transitions. [2019-09-10 08:23:37,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:23:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 302 transitions. [2019-09-10 08:23:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:23:37,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:37,631 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:23:37,631 INFO L418 AbstractCegarLoop]: === Iteration 97 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:37,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:37,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1986237959, now seen corresponding path program 1 times [2019-09-10 08:23:37,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:37,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:37,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:37,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:37,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:37,768 INFO 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:23:37,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:37,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:37,768 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:37,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:37,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:37,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:37,769 INFO L87 Difference]: Start difference. First operand 250 states and 302 transitions. Second operand 9 states. [2019-09-10 08:23:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:39,163 INFO L93 Difference]: Finished difference Result 522 states and 681 transitions. [2019-09-10 08:23:39,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:23:39,164 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-09-10 08:23:39,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:39,165 INFO L225 Difference]: With dead ends: 522 [2019-09-10 08:23:39,165 INFO L226 Difference]: Without dead ends: 522 [2019-09-10 08:23:39,166 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:23:39,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-10 08:23:39,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 250. [2019-09-10 08:23:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-10 08:23:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 300 transitions. [2019-09-10 08:23:39,170 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 300 transitions. Word has length 106 [2019-09-10 08:23:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:39,170 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 300 transitions. [2019-09-10 08:23:39,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 300 transitions. [2019-09-10 08:23:39,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 08:23:39,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:39,171 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:23:39,171 INFO L418 AbstractCegarLoop]: === Iteration 98 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:39,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:39,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1571558324, now seen corresponding path program 1 times [2019-09-10 08:23:39,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:39,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:39,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:39,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:39,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:23:39,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:39,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-10 08:23:39,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:39,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 08:23:39,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 08:23:39,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:23:39,592 INFO L87 Difference]: Start difference. First operand 250 states and 300 transitions. Second operand 11 states. [2019-09-10 08:23:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:40,218 INFO L93 Difference]: Finished difference Result 530 states and 692 transitions. [2019-09-10 08:23:40,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 08:23:40,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2019-09-10 08:23:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:40,220 INFO L225 Difference]: With dead ends: 530 [2019-09-10 08:23:40,220 INFO L226 Difference]: Without dead ends: 530 [2019-09-10 08:23:40,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:23:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-09-10 08:23:40,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 195. [2019-09-10 08:23:40,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-10 08:23:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 237 transitions. [2019-09-10 08:23:40,224 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 237 transitions. Word has length 106 [2019-09-10 08:23:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:40,224 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 237 transitions. [2019-09-10 08:23:40,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 08:23:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 237 transitions. [2019-09-10 08:23:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 08:23:40,224 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:40,225 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] [2019-09-10 08:23:40,225 INFO L418 AbstractCegarLoop]: === Iteration 99 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:40,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1740537637, now seen corresponding path program 1 times [2019-09-10 08:23:40,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:40,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:40,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:40,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:40,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:41,453 INFO 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:23:41,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:41,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-10 08:23:41,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:41,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 08:23:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 08:23:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:23:41,454 INFO L87 Difference]: Start difference. First operand 195 states and 237 transitions. Second operand 21 states. [2019-09-10 08:23:41,596 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-10 08:23:42,358 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 08:23:42,555 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-09-10 08:23:42,793 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-10 08:23:42,993 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:23:43,187 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-09-10 08:23:44,122 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-10 08:23:46,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:46,110 INFO L93 Difference]: Finished difference Result 847 states and 1149 transitions. [2019-09-10 08:23:46,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 08:23:46,110 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2019-09-10 08:23:46,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:46,111 INFO L225 Difference]: With dead ends: 847 [2019-09-10 08:23:46,111 INFO L226 Difference]: Without dead ends: 847 [2019-09-10 08:23:46,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=263, Invalid=1143, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 08:23:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-09-10 08:23:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 224. [2019-09-10 08:23:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-10 08:23:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 272 transitions. [2019-09-10 08:23:46,117 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 272 transitions. Word has length 107 [2019-09-10 08:23:46,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:46,117 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 272 transitions. [2019-09-10 08:23:46,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 08:23:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 272 transitions. [2019-09-10 08:23:46,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:23:46,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:46,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] [2019-09-10 08:23:46,118 INFO L418 AbstractCegarLoop]: === Iteration 100 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash -755651892, now seen corresponding path program 1 times [2019-09-10 08:23:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:46,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:46,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:46,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:46,907 INFO 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:23:46,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:46,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-10 08:23:46,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:46,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 08:23:46,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 08:23:46,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-10 08:23:46,908 INFO L87 Difference]: Start difference. First operand 224 states and 272 transitions. Second operand 16 states. [2019-09-10 08:23:47,693 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-09-10 08:23:47,847 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:23:47,998 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:23:48,139 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-10 08:23:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:49,406 INFO L93 Difference]: Finished difference Result 681 states and 915 transitions. [2019-09-10 08:23:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 08:23:49,406 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 108 [2019-09-10 08:23:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:49,407 INFO L225 Difference]: With dead ends: 681 [2019-09-10 08:23:49,407 INFO L226 Difference]: Without dead ends: 681 [2019-09-10 08:23:49,408 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:23:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-09-10 08:23:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 225. [2019-09-10 08:23:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-09-10 08:23:49,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 273 transitions. [2019-09-10 08:23:49,411 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 273 transitions. Word has length 108 [2019-09-10 08:23:49,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:49,411 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 273 transitions. [2019-09-10 08:23:49,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 08:23:49,411 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 273 transitions. [2019-09-10 08:23:49,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 08:23:49,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:49,412 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:23:49,412 INFO L418 AbstractCegarLoop]: === Iteration 101 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:49,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:49,412 INFO L82 PathProgramCache]: Analyzing trace with hash -398163250, now seen corresponding path program 1 times [2019-09-10 08:23:49,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:49,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:49,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:49,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:49,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:50,030 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-09-10 08:23:50,153 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-09-10 08:23:50,285 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-09-10 08:23:50,418 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-09-10 08:23:50,580 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-10 08:23:50,747 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-10 08:23:50,870 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-10 08:23:51,002 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:23:51,130 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:23:51,269 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:23:51,405 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-09-10 08:23:53,311 INFO 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:23:53,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:53,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2019-09-10 08:23:53,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:53,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-10 08:23:53,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-10 08:23:53,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=968, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 08:23:53,313 INFO L87 Difference]: Start difference. First operand 225 states and 273 transitions. Second operand 33 states. [2019-09-10 08:23:53,691 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-10 08:23:54,558 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2019-09-10 08:23:54,751 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-09-10 08:23:55,045 WARN L188 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-10 08:23:55,401 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-09-10 08:23:55,775 WARN L188 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-09-10 08:23:56,164 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:23:56,733 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 51 [2019-09-10 08:23:57,074 WARN L188 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2019-09-10 08:23:57,440 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 66 [2019-09-10 08:23:57,843 WARN L188 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 73 [2019-09-10 08:23:58,290 WARN L188 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2019-09-10 08:23:58,814 WARN L188 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 95 [2019-09-10 08:23:59,190 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-09-10 08:23:59,545 WARN L188 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 79 [2019-09-10 08:23:59,899 WARN L188 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 76 [2019-09-10 08:24:00,291 WARN L188 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2019-09-10 08:24:00,574 WARN L188 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 48 [2019-09-10 08:24:00,928 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 77 [2019-09-10 08:24:01,196 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 08:24:01,437 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-10 08:24:01,826 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:24:02,169 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-09-10 08:24:02,496 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-10 08:24:02,734 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-09-10 08:24:03,122 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-09-10 08:24:03,584 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-09-10 08:24:04,183 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-10 08:24:05,531 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-09-10 08:24:05,821 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-09-10 08:24:06,361 WARN L188 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-09-10 08:24:06,628 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-09-10 08:24:07,013 WARN L188 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2019-09-10 08:24:07,517 WARN L188 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-09-10 08:24:07,881 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-09-10 08:24:10,294 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-09-10 08:24:12,920 WARN L188 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-09-10 08:24:14,702 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 65 [2019-09-10 08:24:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:30,260 INFO L93 Difference]: Finished difference Result 2538 states and 3558 transitions. [2019-09-10 08:24:30,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 08:24:30,261 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 108 [2019-09-10 08:24:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:30,263 INFO L225 Difference]: With dead ends: 2538 [2019-09-10 08:24:30,264 INFO L226 Difference]: Without dead ends: 2538 [2019-09-10 08:24:30,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=1054, Invalid=5426, Unknown=0, NotChecked=0, Total=6480 [2019-09-10 08:24:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2019-09-10 08:24:30,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 240. [2019-09-10 08:24:30,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-10 08:24:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 291 transitions. [2019-09-10 08:24:30,272 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 291 transitions. Word has length 108 [2019-09-10 08:24:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:30,272 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 291 transitions. [2019-09-10 08:24:30,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-10 08:24:30,272 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 291 transitions. [2019-09-10 08:24:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:24:30,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:30,273 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] [2019-09-10 08:24:30,273 INFO L418 AbstractCegarLoop]: === Iteration 102 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:30,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:30,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2007744804, now seen corresponding path program 1 times [2019-09-10 08:24:30,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:30,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:30,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:30,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:30,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:31,255 INFO 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:24:31,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:31,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-10 08:24:31,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:31,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:24:31,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:24:31,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:24:31,258 INFO L87 Difference]: Start difference. First operand 240 states and 291 transitions. Second operand 17 states. [2019-09-10 08:24:32,061 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-09-10 08:24:32,200 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-09-10 08:24:32,607 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-10 08:24:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:34,110 INFO L93 Difference]: Finished difference Result 759 states and 1030 transitions. [2019-09-10 08:24:34,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 08:24:34,110 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2019-09-10 08:24:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:34,112 INFO L225 Difference]: With dead ends: 759 [2019-09-10 08:24:34,112 INFO L226 Difference]: Without dead ends: 759 [2019-09-10 08:24:34,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=214, Invalid=778, Unknown=0, NotChecked=0, Total=992 [2019-09-10 08:24:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-09-10 08:24:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 234. [2019-09-10 08:24:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-10 08:24:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 284 transitions. [2019-09-10 08:24:34,117 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 284 transitions. Word has length 109 [2019-09-10 08:24:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:34,117 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 284 transitions. [2019-09-10 08:24:34,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 08:24:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 284 transitions. [2019-09-10 08:24:34,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 08:24:34,118 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:34,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] [2019-09-10 08:24:34,118 INFO L418 AbstractCegarLoop]: === Iteration 103 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1423793173, now seen corresponding path program 1 times [2019-09-10 08:24:34,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:34,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:34,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:34,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:34,663 INFO 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:24:34,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:34,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-10 08:24:34,664 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:34,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 08:24:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 08:24:34,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:24:34,665 INFO L87 Difference]: Start difference. First operand 234 states and 284 transitions. Second operand 13 states. [2019-09-10 08:24:35,248 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-10 08:24:35,378 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-09-10 08:24:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:36,264 INFO L93 Difference]: Finished difference Result 636 states and 863 transitions. [2019-09-10 08:24:36,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 08:24:36,264 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2019-09-10 08:24:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:36,266 INFO L225 Difference]: With dead ends: 636 [2019-09-10 08:24:36,266 INFO L226 Difference]: Without dead ends: 636 [2019-09-10 08:24:36,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2019-09-10 08:24:36,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-10 08:24:36,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 189. [2019-09-10 08:24:36,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-10 08:24:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 231 transitions. [2019-09-10 08:24:36,271 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 231 transitions. Word has length 109 [2019-09-10 08:24:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:36,271 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 231 transitions. [2019-09-10 08:24:36,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 08:24:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 231 transitions. [2019-09-10 08:24:36,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-10 08:24:36,272 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:36,272 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:36,272 INFO L418 AbstractCegarLoop]: === Iteration 104 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:36,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:36,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1928476296, now seen corresponding path program 1 times [2019-09-10 08:24:36,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:36,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:36,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:36,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:36,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:36,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:24:36,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:36,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:36,709 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:36,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:36,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:36,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:36,711 INFO L87 Difference]: Start difference. First operand 189 states and 231 transitions. Second operand 3 states. [2019-09-10 08:24:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:36,748 INFO L93 Difference]: Finished difference Result 260 states and 332 transitions. [2019-09-10 08:24:36,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:36,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-10 08:24:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:36,749 INFO L225 Difference]: With dead ends: 260 [2019-09-10 08:24:36,749 INFO L226 Difference]: Without dead ends: 260 [2019-09-10 08:24:36,750 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:24:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-10 08:24:36,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2019-09-10 08:24:36,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-10 08:24:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 331 transitions. [2019-09-10 08:24:36,754 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 331 transitions. Word has length 139 [2019-09-10 08:24:36,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:36,754 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 331 transitions. [2019-09-10 08:24:36,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:36,754 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 331 transitions. [2019-09-10 08:24:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:24:36,755 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:36,755 INFO L418 AbstractCegarLoop]: === Iteration 105 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:36,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:36,755 INFO L82 PathProgramCache]: Analyzing trace with hash -458142361, now seen corresponding path program 1 times [2019-09-10 08:24:36,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:36,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:36,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:36,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:36,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:36,863 INFO 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:24:36,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:36,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:24:36,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:36,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:24:36,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:24:36,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:24:36,864 INFO L87 Difference]: Start difference. First operand 258 states and 331 transitions. Second operand 7 states. [2019-09-10 08:24:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:37,474 INFO L93 Difference]: Finished difference Result 866 states and 1209 transitions. [2019-09-10 08:24:37,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:24:37,474 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:24:37,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:37,476 INFO L225 Difference]: With dead ends: 866 [2019-09-10 08:24:37,476 INFO L226 Difference]: Without dead ends: 866 [2019-09-10 08:24:37,476 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:24:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-09-10 08:24:37,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 420. [2019-09-10 08:24:37,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-10 08:24:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 568 transitions. [2019-09-10 08:24:37,482 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 568 transitions. Word has length 141 [2019-09-10 08:24:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:37,482 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 568 transitions. [2019-09-10 08:24:37,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:24:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 568 transitions. [2019-09-10 08:24:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:24:37,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:37,483 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] [2019-09-10 08:24:37,484 INFO L418 AbstractCegarLoop]: === Iteration 106 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:37,484 INFO L82 PathProgramCache]: Analyzing trace with hash 569314779, now seen corresponding path program 1 times [2019-09-10 08:24:37,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:37,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:37,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:37,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:37,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:37,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:37,607 INFO 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:24:37,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:37,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:24:37,608 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:37,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:24:37,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:24:37,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:24:37,608 INFO L87 Difference]: Start difference. First operand 420 states and 568 transitions. Second operand 7 states. [2019-09-10 08:24:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:38,207 INFO L93 Difference]: Finished difference Result 1530 states and 2165 transitions. [2019-09-10 08:24:38,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:24:38,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:24:38,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:38,209 INFO L225 Difference]: With dead ends: 1530 [2019-09-10 08:24:38,209 INFO L226 Difference]: Without dead ends: 1530 [2019-09-10 08:24:38,209 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:24:38,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1530 states. [2019-09-10 08:24:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1530 to 764. [2019-09-10 08:24:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-09-10 08:24:38,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1070 transitions. [2019-09-10 08:24:38,220 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1070 transitions. Word has length 141 [2019-09-10 08:24:38,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:38,220 INFO L475 AbstractCegarLoop]: Abstraction has 764 states and 1070 transitions. [2019-09-10 08:24:38,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:24:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1070 transitions. [2019-09-10 08:24:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:24:38,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:38,222 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] [2019-09-10 08:24:38,222 INFO L418 AbstractCegarLoop]: === Iteration 107 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:38,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:38,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1954899243, now seen corresponding path program 1 times [2019-09-10 08:24:38,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:38,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:38,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:38,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:38,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:38,333 INFO 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:24:38,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:38,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:24:38,334 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:38,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:24:38,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:24:38,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:24:38,334 INFO L87 Difference]: Start difference. First operand 764 states and 1070 transitions. Second operand 7 states. [2019-09-10 08:24:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:38,922 INFO L93 Difference]: Finished difference Result 2938 states and 4189 transitions. [2019-09-10 08:24:38,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:24:38,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:24:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:38,924 INFO L225 Difference]: With dead ends: 2938 [2019-09-10 08:24:38,924 INFO L226 Difference]: Without dead ends: 2938 [2019-09-10 08:24:38,925 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:24:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2019-09-10 08:24:38,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 1492. [2019-09-10 08:24:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2019-09-10 08:24:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 2130 transitions. [2019-09-10 08:24:38,945 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 2130 transitions. Word has length 141 [2019-09-10 08:24:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:38,945 INFO L475 AbstractCegarLoop]: Abstraction has 1492 states and 2130 transitions. [2019-09-10 08:24:38,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:24:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 2130 transitions. [2019-09-10 08:24:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:24:38,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:38,947 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] [2019-09-10 08:24:38,947 INFO L418 AbstractCegarLoop]: === Iteration 108 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:38,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1726425210, now seen corresponding path program 1 times [2019-09-10 08:24:38,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:38,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:38,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:38,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:38,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:39,036 INFO 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:24:39,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:39,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:39,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:39,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:39,037 INFO L87 Difference]: Start difference. First operand 1492 states and 2130 transitions. Second operand 3 states. [2019-09-10 08:24:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:39,089 INFO L93 Difference]: Finished difference Result 2198 states and 3147 transitions. [2019-09-10 08:24:39,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:39,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-10 08:24:39,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:39,092 INFO L225 Difference]: With dead ends: 2198 [2019-09-10 08:24:39,092 INFO L226 Difference]: Without dead ends: 2198 [2019-09-10 08:24:39,092 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:24:39,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2019-09-10 08:24:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2196. [2019-09-10 08:24:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2196 states. [2019-09-10 08:24:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2196 states to 2196 states and 3146 transitions. [2019-09-10 08:24:39,107 INFO L78 Accepts]: Start accepts. Automaton has 2196 states and 3146 transitions. Word has length 141 [2019-09-10 08:24:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:39,107 INFO L475 AbstractCegarLoop]: Abstraction has 2196 states and 3146 transitions. [2019-09-10 08:24:39,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2196 states and 3146 transitions. [2019-09-10 08:24:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:24:39,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:39,108 INFO L418 AbstractCegarLoop]: === Iteration 109 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash 986684889, now seen corresponding path program 1 times [2019-09-10 08:24:39,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:39,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:39,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:39,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:39,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:39,189 INFO 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:24:39,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:39,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:39,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:39,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:39,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:39,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:39,190 INFO L87 Difference]: Start difference. First operand 2196 states and 3146 transitions. Second operand 3 states. [2019-09-10 08:24:39,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:39,223 INFO L93 Difference]: Finished difference Result 3242 states and 4611 transitions. [2019-09-10 08:24:39,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:39,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-10 08:24:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:39,227 INFO L225 Difference]: With dead ends: 3242 [2019-09-10 08:24:39,227 INFO L226 Difference]: Without dead ends: 3242 [2019-09-10 08:24:39,228 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:24:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2019-09-10 08:24:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3240. [2019-09-10 08:24:39,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3240 states. [2019-09-10 08:24:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3240 states to 3240 states and 4610 transitions. [2019-09-10 08:24:39,251 INFO L78 Accepts]: Start accepts. Automaton has 3240 states and 4610 transitions. Word has length 141 [2019-09-10 08:24:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:39,252 INFO L475 AbstractCegarLoop]: Abstraction has 3240 states and 4610 transitions. [2019-09-10 08:24:39,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:39,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3240 states and 4610 transitions. [2019-09-10 08:24:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:24:39,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:39,253 INFO L418 AbstractCegarLoop]: === Iteration 110 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:39,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:39,253 INFO L82 PathProgramCache]: Analyzing trace with hash 358346831, now seen corresponding path program 1 times [2019-09-10 08:24:39,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:39,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:39,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:39,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:39,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:39,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:39,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:24:39,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:39,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:24:39,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:24:39,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:24:39,361 INFO L87 Difference]: Start difference. First operand 3240 states and 4610 transitions. Second operand 7 states. [2019-09-10 08:24:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:39,968 INFO L93 Difference]: Finished difference Result 12906 states and 18221 transitions. [2019-09-10 08:24:39,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:24:39,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:24:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:39,980 INFO L225 Difference]: With dead ends: 12906 [2019-09-10 08:24:39,980 INFO L226 Difference]: Without dead ends: 12906 [2019-09-10 08:24:39,981 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:24:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12906 states. [2019-09-10 08:24:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12906 to 6724. [2019-09-10 08:24:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6724 states. [2019-09-10 08:24:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6724 states to 6724 states and 9602 transitions. [2019-09-10 08:24:40,062 INFO L78 Accepts]: Start accepts. Automaton has 6724 states and 9602 transitions. Word has length 141 [2019-09-10 08:24:40,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:40,062 INFO L475 AbstractCegarLoop]: Abstraction has 6724 states and 9602 transitions. [2019-09-10 08:24:40,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:24:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 6724 states and 9602 transitions. [2019-09-10 08:24:40,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:24:40,063 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:40,063 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] [2019-09-10 08:24:40,064 INFO L418 AbstractCegarLoop]: === Iteration 111 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:40,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1091090079, now seen corresponding path program 1 times [2019-09-10 08:24:40,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:40,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:40,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:40,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:40,168 INFO 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:24:40,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:40,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:24:40,168 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:40,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:24:40,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:24:40,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:24:40,169 INFO L87 Difference]: Start difference. First operand 6724 states and 9602 transitions. Second operand 7 states. [2019-09-10 08:24:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:40,812 INFO L93 Difference]: Finished difference Result 24194 states and 34397 transitions. [2019-09-10 08:24:40,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:24:40,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:24:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:40,835 INFO L225 Difference]: With dead ends: 24194 [2019-09-10 08:24:40,835 INFO L226 Difference]: Without dead ends: 24194 [2019-09-10 08:24:40,835 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:24:40,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24194 states. [2019-09-10 08:24:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24194 to 14052. [2019-09-10 08:24:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14052 states. [2019-09-10 08:24:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14052 states to 14052 states and 20090 transitions. [2019-09-10 08:24:41,091 INFO L78 Accepts]: Start accepts. Automaton has 14052 states and 20090 transitions. Word has length 141 [2019-09-10 08:24:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:41,091 INFO L475 AbstractCegarLoop]: Abstraction has 14052 states and 20090 transitions. [2019-09-10 08:24:41,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:24:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 14052 states and 20090 transitions. [2019-09-10 08:24:41,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-10 08:24:41,093 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:41,093 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] [2019-09-10 08:24:41,093 INFO L418 AbstractCegarLoop]: === Iteration 112 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:41,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1360730605, now seen corresponding path program 1 times [2019-09-10 08:24:41,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:41,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:41,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:41,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:41,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:41,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:24:41,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:41,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 08:24:41,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:41,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 08:24:41,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 08:24:41,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 08:24:41,204 INFO L87 Difference]: Start difference. First operand 14052 states and 20090 transitions. Second operand 7 states. [2019-09-10 08:24:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:41,757 INFO L93 Difference]: Finished difference Result 30010 states and 42237 transitions. [2019-09-10 08:24:41,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 08:24:41,758 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-09-10 08:24:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:41,785 INFO L225 Difference]: With dead ends: 30010 [2019-09-10 08:24:41,785 INFO L226 Difference]: Without dead ends: 30010 [2019-09-10 08:24:41,786 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:24:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30010 states. [2019-09-10 08:24:42,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30010 to 16468. [2019-09-10 08:24:42,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16468 states. [2019-09-10 08:24:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16468 states to 16468 states and 23162 transitions. [2019-09-10 08:24:42,047 INFO L78 Accepts]: Start accepts. Automaton has 16468 states and 23162 transitions. Word has length 141 [2019-09-10 08:24:42,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:42,047 INFO L475 AbstractCegarLoop]: Abstraction has 16468 states and 23162 transitions. [2019-09-10 08:24:42,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 08:24:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 16468 states and 23162 transitions. [2019-09-10 08:24:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 08:24:42,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:42,049 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] [2019-09-10 08:24:42,049 INFO L418 AbstractCegarLoop]: === Iteration 113 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:42,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:42,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1920406526, now seen corresponding path program 1 times [2019-09-10 08:24:42,049 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:42,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:42,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:42,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:42,237 INFO 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:24:42,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:42,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 08:24:42,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:42,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 08:24:42,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 08:24:42,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:24:42,238 INFO L87 Difference]: Start difference. First operand 16468 states and 23162 transitions. Second operand 6 states. [2019-09-10 08:24:42,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:42,380 INFO L93 Difference]: Finished difference Result 27319 states and 37924 transitions. [2019-09-10 08:24:42,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:24:42,381 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-10 08:24:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:42,406 INFO L225 Difference]: With dead ends: 27319 [2019-09-10 08:24:42,406 INFO L226 Difference]: Without dead ends: 27319 [2019-09-10 08:24:42,406 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:24:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27319 states. [2019-09-10 08:24:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27319 to 16660. [2019-09-10 08:24:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16660 states. [2019-09-10 08:24:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16660 states to 16660 states and 23290 transitions. [2019-09-10 08:24:42,585 INFO L78 Accepts]: Start accepts. Automaton has 16660 states and 23290 transitions. Word has length 142 [2019-09-10 08:24:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:42,586 INFO L475 AbstractCegarLoop]: Abstraction has 16660 states and 23290 transitions. [2019-09-10 08:24:42,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 08:24:42,586 INFO L276 IsEmpty]: Start isEmpty. Operand 16660 states and 23290 transitions. [2019-09-10 08:24:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-10 08:24:42,587 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:42,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:42,588 INFO L418 AbstractCegarLoop]: === Iteration 114 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:42,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash 938906370, now seen corresponding path program 1 times [2019-09-10 08:24:42,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:42,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:42,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:42,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:42,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:42,786 INFO 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:24:42,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:42,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:42,786 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:42,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:42,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:42,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:42,787 INFO L87 Difference]: Start difference. First operand 16660 states and 23290 transitions. Second operand 3 states. [2019-09-10 08:24:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:42,858 INFO L93 Difference]: Finished difference Result 27174 states and 38123 transitions. [2019-09-10 08:24:42,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:42,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-10 08:24:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:42,885 INFO L225 Difference]: With dead ends: 27174 [2019-09-10 08:24:42,886 INFO L226 Difference]: Without dead ends: 27174 [2019-09-10 08:24:42,886 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:24:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27174 states. [2019-09-10 08:24:43,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27174 to 19868. [2019-09-10 08:24:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19868 states. [2019-09-10 08:24:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19868 states to 19868 states and 27986 transitions. [2019-09-10 08:24:43,743 INFO L78 Accepts]: Start accepts. Automaton has 19868 states and 27986 transitions. Word has length 142 [2019-09-10 08:24:43,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:43,743 INFO L475 AbstractCegarLoop]: Abstraction has 19868 states and 27986 transitions. [2019-09-10 08:24:43,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 19868 states and 27986 transitions. [2019-09-10 08:24:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-10 08:24:43,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:24:43,745 INFO L418 AbstractCegarLoop]: === Iteration 115 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:43,745 INFO L82 PathProgramCache]: Analyzing trace with hash 824570804, now seen corresponding path program 1 times [2019-09-10 08:24:43,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:43,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:43,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:43,830 INFO 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:24:43,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:43,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:43,830 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:43,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:43,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:43,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:43,831 INFO L87 Difference]: Start difference. First operand 19868 states and 27986 transitions. Second operand 3 states. [2019-09-10 08:24:43,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:43,888 INFO L93 Difference]: Finished difference Result 18610 states and 25887 transitions. [2019-09-10 08:24:43,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:43,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-10 08:24:43,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:43,907 INFO L225 Difference]: With dead ends: 18610 [2019-09-10 08:24:43,907 INFO L226 Difference]: Without dead ends: 18610 [2019-09-10 08:24:43,908 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:24:43,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18610 states. [2019-09-10 08:24:44,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18610 to 15308. [2019-09-10 08:24:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15308 states. [2019-09-10 08:24:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15308 states to 15308 states and 21314 transitions. [2019-09-10 08:24:44,057 INFO L78 Accepts]: Start accepts. Automaton has 15308 states and 21314 transitions. Word has length 143 [2019-09-10 08:24:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:44,057 INFO L475 AbstractCegarLoop]: Abstraction has 15308 states and 21314 transitions. [2019-09-10 08:24:44,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 15308 states and 21314 transitions. [2019-09-10 08:24:44,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 08:24:44,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:44,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, 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:24:44,058 INFO L418 AbstractCegarLoop]: === Iteration 116 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:44,058 INFO L82 PathProgramCache]: Analyzing trace with hash 883260062, now seen corresponding path program 1 times [2019-09-10 08:24:44,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:44,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:44,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:44,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:44,209 INFO 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:24:44,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:44,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:44,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:44,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:44,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:44,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:44,210 INFO L87 Difference]: Start difference. First operand 15308 states and 21314 transitions. Second operand 3 states. [2019-09-10 08:24:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:44,257 INFO L93 Difference]: Finished difference Result 14338 states and 19695 transitions. [2019-09-10 08:24:44,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:44,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-10 08:24:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:44,271 INFO L225 Difference]: With dead ends: 14338 [2019-09-10 08:24:44,271 INFO L226 Difference]: Without dead ends: 14338 [2019-09-10 08:24:44,271 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:24:44,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14338 states. [2019-09-10 08:24:44,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 14012. [2019-09-10 08:24:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14012 states. [2019-09-10 08:24:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14012 states to 14012 states and 19316 transitions. [2019-09-10 08:24:44,395 INFO L78 Accepts]: Start accepts. Automaton has 14012 states and 19316 transitions. Word has length 144 [2019-09-10 08:24:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:44,395 INFO L475 AbstractCegarLoop]: Abstraction has 14012 states and 19316 transitions. [2019-09-10 08:24:44,395 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:44,395 INFO L276 IsEmpty]: Start isEmpty. Operand 14012 states and 19316 transitions. [2019-09-10 08:24:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 08:24:44,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:44,396 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] [2019-09-10 08:24:44,396 INFO L418 AbstractCegarLoop]: === Iteration 117 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:44,396 INFO L82 PathProgramCache]: Analyzing trace with hash -49666577, now seen corresponding path program 1 times [2019-09-10 08:24:44,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:44,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:44,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:44,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:44,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:44,470 INFO 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:24:44,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:44,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:44,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:44,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:44,471 INFO L87 Difference]: Start difference. First operand 14012 states and 19316 transitions. Second operand 3 states. [2019-09-10 08:24:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:44,522 INFO L93 Difference]: Finished difference Result 17386 states and 23607 transitions. [2019-09-10 08:24:44,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:44,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-10 08:24:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:44,541 INFO L225 Difference]: With dead ends: 17386 [2019-09-10 08:24:44,541 INFO L226 Difference]: Without dead ends: 17386 [2019-09-10 08:24:44,541 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:24:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-09-10 08:24:44,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 12932. [2019-09-10 08:24:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12932 states. [2019-09-10 08:24:44,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12932 states to 12932 states and 17570 transitions. [2019-09-10 08:24:44,735 INFO L78 Accepts]: Start accepts. Automaton has 12932 states and 17570 transitions. Word has length 145 [2019-09-10 08:24:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:44,736 INFO L475 AbstractCegarLoop]: Abstraction has 12932 states and 17570 transitions. [2019-09-10 08:24:44,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 12932 states and 17570 transitions. [2019-09-10 08:24:44,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-10 08:24:44,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:44,737 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] [2019-09-10 08:24:44,737 INFO L418 AbstractCegarLoop]: === Iteration 118 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:44,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:44,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1737226224, now seen corresponding path program 1 times [2019-09-10 08:24:44,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:44,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:44,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:44,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:44,813 INFO 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:24:44,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:44,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:44,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:44,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:44,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:44,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:44,814 INFO L87 Difference]: Start difference. First operand 12932 states and 17570 transitions. Second operand 3 states. [2019-09-10 08:24:44,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:44,863 INFO L93 Difference]: Finished difference Result 15946 states and 21387 transitions. [2019-09-10 08:24:44,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:44,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-09-10 08:24:44,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:44,879 INFO L225 Difference]: With dead ends: 15946 [2019-09-10 08:24:44,880 INFO L226 Difference]: Without dead ends: 15946 [2019-09-10 08:24:44,880 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:24:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15946 states. [2019-09-10 08:24:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15946 to 15344. [2019-09-10 08:24:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15344 states. [2019-09-10 08:24:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15344 states to 15344 states and 20666 transitions. [2019-09-10 08:24:45,121 INFO L78 Accepts]: Start accepts. Automaton has 15344 states and 20666 transitions. Word has length 146 [2019-09-10 08:24:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:45,122 INFO L475 AbstractCegarLoop]: Abstraction has 15344 states and 20666 transitions. [2019-09-10 08:24:45,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:45,122 INFO L276 IsEmpty]: Start isEmpty. Operand 15344 states and 20666 transitions. [2019-09-10 08:24:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-10 08:24:45,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:45,122 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] [2019-09-10 08:24:45,123 INFO L418 AbstractCegarLoop]: === Iteration 119 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:45,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:45,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1679831150, now seen corresponding path program 1 times [2019-09-10 08:24:45,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:45,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:45,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:45,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:45,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:45,206 INFO 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:24:45,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:45,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:45,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:45,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:45,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:45,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:45,207 INFO L87 Difference]: Start difference. First operand 15344 states and 20666 transitions. Second operand 3 states. [2019-09-10 08:24:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:45,259 INFO L93 Difference]: Finished difference Result 17990 states and 24059 transitions. [2019-09-10 08:24:45,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:45,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-09-10 08:24:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:45,276 INFO L225 Difference]: With dead ends: 17990 [2019-09-10 08:24:45,276 INFO L226 Difference]: Without dead ends: 17990 [2019-09-10 08:24:45,277 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:24:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17990 states. [2019-09-10 08:24:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17990 to 17668. [2019-09-10 08:24:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17668 states. [2019-09-10 08:24:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17668 states to 17668 states and 23658 transitions. [2019-09-10 08:24:45,427 INFO L78 Accepts]: Start accepts. Automaton has 17668 states and 23658 transitions. Word has length 147 [2019-09-10 08:24:45,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:45,427 INFO L475 AbstractCegarLoop]: Abstraction has 17668 states and 23658 transitions. [2019-09-10 08:24:45,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 17668 states and 23658 transitions. [2019-09-10 08:24:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 08:24:45,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:45,428 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] [2019-09-10 08:24:45,429 INFO L418 AbstractCegarLoop]: === Iteration 120 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:45,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:45,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1063301003, now seen corresponding path program 1 times [2019-09-10 08:24:45,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:45,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:45,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:45,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:45,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:45,498 INFO 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:24:45,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:45,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:24:45,499 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:45,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:24:45,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:24:45,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:24:45,499 INFO L87 Difference]: Start difference. First operand 17668 states and 23658 transitions. Second operand 3 states. [2019-09-10 08:24:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:45,620 INFO L93 Difference]: Finished difference Result 19430 states and 25947 transitions. [2019-09-10 08:24:45,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:24:45,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-09-10 08:24:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:45,639 INFO L225 Difference]: With dead ends: 19430 [2019-09-10 08:24:45,640 INFO L226 Difference]: Without dead ends: 19430 [2019-09-10 08:24:45,640 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:24:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19430 states. [2019-09-10 08:24:45,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19430 to 19428. [2019-09-10 08:24:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19428 states. [2019-09-10 08:24:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19428 states to 19428 states and 25946 transitions. [2019-09-10 08:24:45,801 INFO L78 Accepts]: Start accepts. Automaton has 19428 states and 25946 transitions. Word has length 148 [2019-09-10 08:24:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:45,801 INFO L475 AbstractCegarLoop]: Abstraction has 19428 states and 25946 transitions. [2019-09-10 08:24:45,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:24:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 19428 states and 25946 transitions. [2019-09-10 08:24:45,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:24:45,804 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:45,804 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:45,804 INFO L418 AbstractCegarLoop]: === Iteration 121 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:45,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:45,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1338732557, now seen corresponding path program 1 times [2019-09-10 08:24:45,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:45,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:45,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 08:24:45,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:45,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:24:45,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:45,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:24:45,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:24:45,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:24:45,942 INFO L87 Difference]: Start difference. First operand 19428 states and 25946 transitions. Second operand 5 states. [2019-09-10 08:24:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:46,232 INFO L93 Difference]: Finished difference Result 52686 states and 70237 transitions. [2019-09-10 08:24:46,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:24:46,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:24:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:46,284 INFO L225 Difference]: With dead ends: 52686 [2019-09-10 08:24:46,284 INFO L226 Difference]: Without dead ends: 52686 [2019-09-10 08:24:46,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:24:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52686 states. [2019-09-10 08:24:46,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52686 to 50964. [2019-09-10 08:24:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50964 states. [2019-09-10 08:24:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50964 states to 50964 states and 67930 transitions. [2019-09-10 08:24:46,998 INFO L78 Accepts]: Start accepts. Automaton has 50964 states and 67930 transitions. Word has length 183 [2019-09-10 08:24:46,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:46,998 INFO L475 AbstractCegarLoop]: Abstraction has 50964 states and 67930 transitions. [2019-09-10 08:24:46,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:24:46,999 INFO L276 IsEmpty]: Start isEmpty. Operand 50964 states and 67930 transitions. [2019-09-10 08:24:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:24:47,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:47,003 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:47,003 INFO L418 AbstractCegarLoop]: === Iteration 122 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:47,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash -311275417, now seen corresponding path program 1 times [2019-09-10 08:24:47,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:47,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:47,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:24:47,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:24:47,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:24:47,310 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2019-09-10 08:24:47,312 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], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [205], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [240], [243], [245], [247], [250], [253], [256], [258], [260], [263], [266], [269], [271], [273], [276], [286], [289], [293], [296], [299], [303], [305], [308], [311], [319], [321], [324], [332], [334], [337], [345], [347], [350], [353], [358], [360], [363], [371], [373], [376], [384], [386], [388], [390], [393], [400], [402], [404], [407], [408], [410], [412], [421], [424], [428], [437], [439], [442], [445], [447], [462], [464], [467], [470], [472], [480], [483], [489], [492], [495], [497], [512], [514], [517], [520], [522], [537], [539], [542], [545], [547], [562], [564], [567], [570], [572], [608], [4346], [4347], [4351], [4352], [4353] [2019-09-10 08:24:47,360 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:24:47,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:24:47,661 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:24:49,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:24:49,852 INFO L272 AbstractInterpreter]: Visited 171 different actions 1054 times. Merged at 63 different actions 772 times. Widened at 30 different actions 158 times. Performed 4013 root evaluator evaluations with a maximum evaluation depth of 6. Performed 4013 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 92 fixpoints after 20 different actions. Largest state had 406 variables. [2019-09-10 08:24:49,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:49,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:24:49,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:24:49,858 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) [2019-09-10 08:24:49,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:49,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:24:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:50,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 2280 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-10 08:24:50,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:24:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:24:50,659 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:24:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 08:24:51,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:24:51,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 8] total 22 [2019-09-10 08:24:51,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:51,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:24:51,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:24:51,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:24:51,858 INFO L87 Difference]: Start difference. First operand 50964 states and 67930 transitions. Second operand 8 states. [2019-09-10 08:24:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:52,495 INFO L93 Difference]: Finished difference Result 159644 states and 212672 transitions. [2019-09-10 08:24:52,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:24:52,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 183 [2019-09-10 08:24:52,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:53,045 INFO L225 Difference]: With dead ends: 159644 [2019-09-10 08:24:53,045 INFO L226 Difference]: Without dead ends: 159644 [2019-09-10 08:24:53,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2019-09-10 08:24:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159644 states. [2019-09-10 08:24:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159644 to 63188. [2019-09-10 08:24:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63188 states. [2019-09-10 08:24:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63188 states to 63188 states and 84090 transitions. [2019-09-10 08:24:54,871 INFO L78 Accepts]: Start accepts. Automaton has 63188 states and 84090 transitions. Word has length 183 [2019-09-10 08:24:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:54,871 INFO L475 AbstractCegarLoop]: Abstraction has 63188 states and 84090 transitions. [2019-09-10 08:24:54,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:24:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 63188 states and 84090 transitions. [2019-09-10 08:24:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:24:54,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:54,884 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:54,885 INFO L418 AbstractCegarLoop]: === Iteration 123 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:54,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:54,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1459477857, now seen corresponding path program 1 times [2019-09-10 08:24:54,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:54,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:54,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:54,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:54,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:55,102 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-10 08:24:55,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:55,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:24:55,103 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:55,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:24:55,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:24:55,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:24:55,104 INFO L87 Difference]: Start difference. First operand 63188 states and 84090 transitions. Second operand 5 states. [2019-09-10 08:24:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:55,427 INFO L93 Difference]: Finished difference Result 88696 states and 117708 transitions. [2019-09-10 08:24:55,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:24:55,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:24:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:55,598 INFO L225 Difference]: With dead ends: 88696 [2019-09-10 08:24:55,598 INFO L226 Difference]: Without dead ends: 88696 [2019-09-10 08:24:55,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:24:55,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88696 states. [2019-09-10 08:24:57,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88696 to 75540. [2019-09-10 08:24:57,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75540 states. [2019-09-10 08:24:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75540 states to 75540 states and 100570 transitions. [2019-09-10 08:24:57,922 INFO L78 Accepts]: Start accepts. Automaton has 75540 states and 100570 transitions. Word has length 183 [2019-09-10 08:24:57,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:57,923 INFO L475 AbstractCegarLoop]: Abstraction has 75540 states and 100570 transitions. [2019-09-10 08:24:57,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:24:57,923 INFO L276 IsEmpty]: Start isEmpty. Operand 75540 states and 100570 transitions. [2019-09-10 08:24:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:24:57,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:57,928 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:57,928 INFO L418 AbstractCegarLoop]: === Iteration 124 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:57,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:57,928 INFO L82 PathProgramCache]: Analyzing trace with hash -522243365, now seen corresponding path program 1 times [2019-09-10 08:24:57,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:57,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:57,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:24:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:24:58,145 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 08:24:58,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:24:58,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:24:58,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:24:58,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:24:58,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:24:58,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:24:58,147 INFO L87 Difference]: Start difference. First operand 75540 states and 100570 transitions. Second operand 5 states. [2019-09-10 08:24:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:58,555 INFO L93 Difference]: Finished difference Result 100472 states and 133372 transitions. [2019-09-10 08:24:58,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:24:58,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-10 08:24:58,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:58,705 INFO L225 Difference]: With dead ends: 100472 [2019-09-10 08:24:58,706 INFO L226 Difference]: Without dead ends: 100472 [2019-09-10 08:24:58,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 08:24:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100472 states. [2019-09-10 08:24:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100472 to 87892. [2019-09-10 08:24:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87892 states. [2019-09-10 08:24:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87892 states to 87892 states and 117050 transitions. [2019-09-10 08:24:59,969 INFO L78 Accepts]: Start accepts. Automaton has 87892 states and 117050 transitions. Word has length 183 [2019-09-10 08:24:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:24:59,969 INFO L475 AbstractCegarLoop]: Abstraction has 87892 states and 117050 transitions. [2019-09-10 08:24:59,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:24:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 87892 states and 117050 transitions. [2019-09-10 08:24:59,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:24:59,974 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:24:59,974 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:59,975 INFO L418 AbstractCegarLoop]: === Iteration 125 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:24:59,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:24:59,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1971680275, now seen corresponding path program 1 times [2019-09-10 08:24:59,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:24:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:59,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:24:59,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:24:59,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 08:25:00,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:00,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:25:00,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:00,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:25:00,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:25:00,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:25:00,766 INFO L87 Difference]: Start difference. First operand 87892 states and 117050 transitions. Second operand 8 states. [2019-09-10 08:25:01,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:01,455 INFO L93 Difference]: Finished difference Result 227976 states and 303864 transitions. [2019-09-10 08:25:01,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:25:01,456 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 183 [2019-09-10 08:25:01,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:01,783 INFO L225 Difference]: With dead ends: 227976 [2019-09-10 08:25:01,783 INFO L226 Difference]: Without dead ends: 227976 [2019-09-10 08:25:01,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-10 08:25:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227976 states. [2019-09-10 08:25:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227976 to 106164. [2019-09-10 08:25:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106164 states. [2019-09-10 08:25:05,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106164 states to 106164 states and 141130 transitions. [2019-09-10 08:25:05,649 INFO L78 Accepts]: Start accepts. Automaton has 106164 states and 141130 transitions. Word has length 183 [2019-09-10 08:25:05,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:05,649 INFO L475 AbstractCegarLoop]: Abstraction has 106164 states and 141130 transitions. [2019-09-10 08:25:05,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:25:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 106164 states and 141130 transitions. [2019-09-10 08:25:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-10 08:25:05,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:05,656 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,656 INFO L418 AbstractCegarLoop]: === Iteration 126 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash 480140409, now seen corresponding path program 1 times [2019-09-10 08:25:05,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:05,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:05,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:05,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:05,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:06,003 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 08:25:06,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:25:06,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 08:25:06,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:25:06,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 08:25:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 08:25:06,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 08:25:06,006 INFO L87 Difference]: Start difference. First operand 106164 states and 141130 transitions. Second operand 8 states. [2019-09-10 08:25:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:25:07,149 INFO L93 Difference]: Finished difference Result 208084 states and 277136 transitions. [2019-09-10 08:25:07,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 08:25:07,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 183 [2019-09-10 08:25:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:25:07,391 INFO L225 Difference]: With dead ends: 208084 [2019-09-10 08:25:07,391 INFO L226 Difference]: Without dead ends: 208084 [2019-09-10 08:25:07,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:25:07,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208084 states. [2019-09-10 08:25:11,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208084 to 118388. [2019-09-10 08:25:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118388 states. [2019-09-10 08:25:11,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118388 states to 118388 states and 157290 transitions. [2019-09-10 08:25:11,316 INFO L78 Accepts]: Start accepts. Automaton has 118388 states and 157290 transitions. Word has length 183 [2019-09-10 08:25:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:11,317 INFO L475 AbstractCegarLoop]: Abstraction has 118388 states and 157290 transitions. [2019-09-10 08:25:11,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 08:25:11,317 INFO L276 IsEmpty]: Start isEmpty. Operand 118388 states and 157290 transitions. [2019-09-10 08:25:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-10 08:25:11,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:11,705 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,708 INFO L418 AbstractCegarLoop]: === Iteration 127 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:11,709 INFO L82 PathProgramCache]: Analyzing trace with hash -589585930, now seen corresponding path program 1 times [2019-09-10 08:25:11,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:11,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:11,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:11,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:11,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:12,067 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 17 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:12,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:12,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:25:12,068 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2019-09-10 08:25:12,069 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], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [205], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [240], [243], [245], [247], [250], [253], [256], [258], [260], [263], [266], [269], [271], [273], [276], [286], [289], [293], [296], [299], [303], [305], [308], [311], [319], [321], [324], [332], [334], [337], [345], [347], [350], [358], [360], [363], [371], [373], [376], [384], [386], [388], [390], [393], [396], [400], [402], [404], [407], [408], [410], [412], [414], [419], [421], [424], [437], [439], [442], [445], [447], [462], [464], [467], [470], [472], [487], [489], [492], [495], [497], [512], [514], [517], [520], [522], [537], [539], [542], [545], [547], [562], [564], [567], [570], [572], [608], [4346], [4347], [4351], [4352], [4353] [2019-09-10 08:25:12,079 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:25:12,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:25:12,222 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:25:13,922 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:25:13,923 INFO L272 AbstractInterpreter]: Visited 171 different actions 1391 times. Merged at 65 different actions 1059 times. Widened at 33 different actions 211 times. Performed 5185 root evaluator evaluations with a maximum evaluation depth of 8. Performed 5185 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 164 fixpoints after 31 different actions. Largest state had 406 variables. [2019-09-10 08:25:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:13,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:25:13,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:13,923 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:25:13,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:13,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:25:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:14,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 2279 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-10 08:25:14,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:25:14,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:14,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:14,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:16,732 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:25:16,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:17,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:17,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:17,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:17,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:20,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:20,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:25:20,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2019-09-10 08:25:20,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:25:20,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:25:20,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:25:20,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2019-09-10 08:25:20,418 INFO L87 Difference]: Start difference. First operand 118388 states and 157290 transitions. Second operand 20 states. [2019-09-10 08:25:23,829 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-10 08:25:24,455 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 08:25:27,044 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2019-09-10 08:25:27,934 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 08:25:37,110 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 08:25:37,257 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-10 08:25:37,410 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:25:37,561 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:25:37,901 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:25:38,059 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-09-10 08:25:38,203 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-09-10 08:25:38,343 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 40 [2019-09-10 08:25:38,724 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-09-10 08:25:40,530 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 08:25:40,702 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2019-09-10 08:25:43,936 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2019-09-10 08:25:45,376 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 40 [2019-09-10 08:25:48,174 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 40 [2019-09-10 08:25:49,540 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2019-09-10 08:25:50,097 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-09-10 08:25:52,910 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2019-09-10 08:25:54,491 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-09-10 08:26:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:12,288 INFO L93 Difference]: Finished difference Result 2361845 states and 3084562 transitions. [2019-09-10 08:26:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2019-09-10 08:26:12,288 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 184 [2019-09-10 08:26:12,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:26:17,421 INFO L225 Difference]: With dead ends: 2361845 [2019-09-10 08:26:17,421 INFO L226 Difference]: Without dead ends: 2361845 [2019-09-10 08:26:17,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 294 SyntacticMatches, 57 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37654 ImplicationChecksByTransitivity, 31.3s TimeCoverageRelationStatistics Valid=11066, Invalid=77440, Unknown=0, NotChecked=0, Total=88506 [2019-09-10 08:26:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361845 states. [2019-09-10 08:26:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361845 to 595864. [2019-09-10 08:26:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595864 states. [2019-09-10 08:26:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595864 states to 595864 states and 786012 transitions. [2019-09-10 08:26:52,924 INFO L78 Accepts]: Start accepts. Automaton has 595864 states and 786012 transitions. Word has length 184 [2019-09-10 08:26:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:26:52,924 INFO L475 AbstractCegarLoop]: Abstraction has 595864 states and 786012 transitions. [2019-09-10 08:26:52,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 08:26:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 595864 states and 786012 transitions. [2019-09-10 08:26:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-10 08:26:52,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:26:52,953 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,954 INFO L418 AbstractCegarLoop]: === Iteration 128 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr20ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr21ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr18ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr19ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:26:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:52,955 INFO L82 PathProgramCache]: Analyzing trace with hash -764861400, now seen corresponding path program 1 times [2019-09-10 08:26:52,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:26:52,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:52,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:52,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:26:52,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:26:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:53,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:53,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:53,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:26:53,311 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 186 with the following transitions: [2019-09-10 08:26:53,311 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], [130], [133], [136], [140], [143], [146], [150], [153], [156], [160], [163], [166], [170], [173], [176], [180], [183], [186], [189], [193], [196], [199], [203], [205], [208], [211], [214], [217], [219], [221], [224], [227], [230], [232], [234], [237], [240], [243], [245], [247], [250], [253], [256], [258], [260], [263], [266], [269], [271], [273], [276], [286], [289], [293], [296], [299], [303], [305], [308], [311], [314], [319], [321], [324], [327], [332], [334], [337], [345], [347], [350], [358], [360], [363], [371], [373], [376], [384], [386], [388], [390], [393], [400], [402], [404], [407], [408], [410], [412], [421], [424], [428], [437], [439], [442], [445], [447], [462], [464], [467], [470], [472], [487], [489], [492], [495], [497], [512], [514], [517], [520], [522], [530], [533], [539], [542], [545], [547], [555], [558], [564], [567], [570], [572], [608], [4346], [4347], [4351], [4352], [4353] [2019-09-10 08:26:53,319 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:26:53,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:26:53,425 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:26:54,336 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:26:54,336 INFO L272 AbstractInterpreter]: Visited 173 different actions 1020 times. Merged at 67 different actions 745 times. Widened at 28 different actions 140 times. Performed 3998 root evaluator evaluations with a maximum evaluation depth of 6. Performed 3998 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 90 fixpoints after 21 different actions. Largest state had 406 variables. [2019-09-10 08:26:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:26:54,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:26:54,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:26:54,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:26:54,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:26:54,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:26:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:26:54,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 2284 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:26:54,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:26:54,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:54,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:54,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:55,212 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:55,213 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:26:55,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:55,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:55,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:55,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:55,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:55,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:55,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:55,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:55,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:55,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:26:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:26:56,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:26:56,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2019-09-10 08:26:56,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:26:56,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 08:26:56,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 08:26:56,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2019-09-10 08:26:56,975 INFO L87 Difference]: Start difference. First operand 595864 states and 786012 transitions. Second operand 20 states. [2019-09-10 08:26:59,599 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:26:59,747 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:26:59,925 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:27:00,223 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:27:00,774 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:01,580 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:27:01,808 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:01,970 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:27:02,116 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-09-10 08:27:02,294 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:27:02,457 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:27:02,689 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:02,877 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:27:03,058 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:27:03,222 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:27:03,398 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:03,831 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:04,023 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:27:04,243 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:04,424 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:27:04,641 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:27:10,426 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-10 08:27:11,313 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:27:11,487 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:27:11,685 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:27:11,898 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:27:12,120 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:27:12,552 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:27:12,730 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:27:12,930 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:27:13,133 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:27:13,340 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:13,572 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:27:13,792 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:27:14,035 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:27:14,343 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:14,533 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:27:14,687 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:27:14,923 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:27:15,214 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:27:15,516 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:27:15,718 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:27:15,878 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:27:16,087 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:16,270 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:27:16,495 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:27:16,691 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:27:17,092 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:27:17,260 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:27:17,449 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:17,625 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:17,843 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:27:18,037 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:27:18,268 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:18,525 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:18,740 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:27:18,959 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:19,210 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:19,574 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:27:19,760 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:19,938 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:27:20,127 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-09-10 08:27:20,343 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:27:20,574 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:20,810 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:27:21,043 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:27:21,300 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:27:22,000 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-10 08:27:22,186 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:27:22,426 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:27:22,687 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:27:22,972 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:27:23,358 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2019-09-10 08:27:23,503 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-10 08:27:23,671 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:27:23,847 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:24,113 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-09-10 08:27:27,302 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:27,493 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:27,735 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:27,948 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:28,155 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:27:28,321 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:28,641 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:27:29,132 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:29,310 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:29,534 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:27:29,757 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:27:30,034 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:27:30,223 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:27:30,446 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:27:30,680 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:27:30,864 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:27:31,080 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:31,263 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:27:31,496 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:31,678 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:27:31,868 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:32,266 WARN L188 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:27:32,518 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:27:32,787 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:32,979 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:33,223 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:27:33,410 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:33,585 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:33,899 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:27:34,094 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:27:34,401 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-09-10 08:27:34,588 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-09-10 08:27:35,135 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:27:35,317 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:27:35,578 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:35,805 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:35,988 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:27:36,182 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:27:36,412 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:27:36,662 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:27:36,894 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:27:37,115 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:27:37,279 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:27:37,434 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:27:37,643 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:37,841 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:38,086 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:27:38,325 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:27:38,483 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:27:38,631 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:27:38,826 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:39,027 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:39,233 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:27:39,426 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:39,648 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:27:39,801 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:27:39,989 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:27:40,163 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:40,510 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:40,676 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:40,869 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:27:41,035 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:27:41,336 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:27:41,649 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:27:41,907 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:42,114 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:42,303 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:27:42,482 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:27:42,687 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:27:42,889 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:27:43,158 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:27:43,357 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-09-10 08:27:43,615 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:27:43,864 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:27:44,049 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:27:44,267 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-09-10 08:27:44,502 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:27:44,695 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:27:44,935 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:27:45,183 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:27:45,337 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-10 08:27:45,555 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:45,771 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:46,004 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:27:46,240 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 60 [2019-09-10 08:27:46,498 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 08:27:46,784 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-09-10 08:27:47,088 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:27:47,288 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:27:47,543 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-09-10 08:27:47,741 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:27:47,971 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:27:48,199 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:27:48,381 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:27:48,655 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 63 [2019-09-10 08:27:48,843 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:27:49,033 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:49,213 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:27:49,425 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:49,589 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-09-10 08:27:49,745 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:27:49,937 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:50,133 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:50,329 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:50,603 WARN L188 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:27:50,832 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:27:50,994 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:27:51,377 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-10 08:27:51,571 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:27:51,932 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:27:52,127 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-10 08:27:52,362 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-09-10 08:27:52,556 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:27:52,783 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:27:52,953 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:27:53,183 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:27:53,378 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:27:53,568 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:53,789 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:54,038 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:27:54,269 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:27:54,456 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:27:54,799 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:27:54,984 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:27:55,166 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:27:55,463 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:27:55,629 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:27:56,097 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:27:56,296 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:27:56,527 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:27:57,063 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:27:57,237 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:27:57,432 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:27:57,629 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:27:57,842 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:27:58,220 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-09-10 08:27:58,509 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-09-10 08:27:58,769 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-09-10 08:27:58,949 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2019-09-10 08:27:59,297 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 55 [2019-09-10 08:27:59,455 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:27:59,798 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2019-09-10 08:28:00,152 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2019-09-10 08:28:00,327 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2019-09-10 08:28:00,513 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:28:00,709 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-10 08:28:00,881 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:28:01,057 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2019-09-10 08:28:01,843 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-09-10 08:28:02,126 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-09-10 08:28:02,408 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-09-10 08:28:02,727 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-09-10 08:28:02,980 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-10 08:28:03,270 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 45 [2019-09-10 08:28:03,611 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-09-10 08:28:06,156 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:28:06,438 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:28:06,612 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:28:06,832 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:28:08,442 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:28:08,624 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-10 08:28:08,874 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:28:09,077 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-09-10 08:28:09,407 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-09-10 08:28:09,616 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:28:09,810 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:28:09,995 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:28:10,330 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2019-09-10 08:28:10,687 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:28:10,919 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-09-10 08:28:11,112 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:28:11,326 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2019-09-10 08:28:11,506 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-09-10 08:28:11,664 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2019-09-10 08:28:11,977 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2019-09-10 08:28:12,157 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:28:13,095 WARN L188 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-09-10 08:28:13,453 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-09-10 08:28:13,633 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 49 [2019-09-10 08:28:14,010 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-09-10 08:28:14,207 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:28:14,371 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-09-10 08:28:14,695 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-10 08:28:14,919 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-10 08:28:15,196 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-09-10 08:28:15,585 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 55 [2019-09-10 08:28:15,774 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-09-10 08:28:15,959 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-09-10 08:28:16,455 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-10 08:28:16,602 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-09-10 08:28:16,972 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-09-10 08:28:17,310 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-10 08:28:17,529 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-10 08:28:17,768 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2019-09-10 08:28:17,979 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2019-09-10 08:28:18,202 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-09-10 08:28:18,512 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-10 08:28:18,736 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:28:19,143 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-09-10 08:28:19,386 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-09-10 08:28:19,600 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2019-09-10 08:28:20,224 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2019-09-10 08:28:21,137 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-09-10 08:28:21,462 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-09-10 08:28:21,728 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2019-09-10 08:28:22,028 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 65 [2019-09-10 08:28:22,279 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59