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/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 03:09:14,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 03:09:14,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 03:09:14,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 03:09:14,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 03:09:14,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 03:09:14,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 03:09:14,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 03:09:14,946 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 03:09:14,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 03:09:14,950 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 03:09:14,952 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 03:09:14,952 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 03:09:14,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 03:09:14,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 03:09:14,958 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 03:09:14,960 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 03:09:14,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 03:09:14,964 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 03:09:14,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 03:09:14,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 03:09:14,975 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 03:09:14,976 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 03:09:14,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 03:09:14,981 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 03:09:14,981 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 03:09:14,981 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 03:09:14,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 03:09:14,985 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 03:09:14,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 03:09:14,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 03:09:14,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 03:09:14,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 03:09:14,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 03:09:14,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 03:09:14,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 03:09:14,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 03:09:14,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 03:09:14,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 03:09:14,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 03:09:14,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 03:09:14,998 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 03:09:15,023 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 03:09:15,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 03:09:15,024 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 03:09:15,025 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 03:09:15,025 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 03:09:15,026 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 03:09:15,026 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 03:09:15,026 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 03:09:15,026 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 03:09:15,026 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 03:09:15,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 03:09:15,029 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 03:09:15,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 03:09:15,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 03:09:15,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 03:09:15,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 03:09:15,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 03:09:15,030 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 03:09:15,030 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 03:09:15,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 03:09:15,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 03:09:15,031 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 03:09:15,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 03:09:15,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:09:15,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 03:09:15,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 03:09:15,032 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 03:09:15,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 03:09:15,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 03:09:15,033 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 03:09:15,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 03:09:15,088 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 03:09:15,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 03:09:15,095 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 03:09:15,096 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 03:09:15,097 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-03 03:09:15,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdb6a2e4/5d9bedd8d26a4c7a989dfe6096040e4a/FLAGf26a73cd1 [2019-10-03 03:09:15,732 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 03:09:15,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-03 03:09:15,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdb6a2e4/5d9bedd8d26a4c7a989dfe6096040e4a/FLAGf26a73cd1 [2019-10-03 03:09:16,054 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bdb6a2e4/5d9bedd8d26a4c7a989dfe6096040e4a [2019-10-03 03:09:16,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 03:09:16,065 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 03:09:16,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 03:09:16,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 03:09:16,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 03:09:16,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:09:16" (1/1) ... [2019-10-03 03:09:16,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fef2b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16, skipping insertion in model container [2019-10-03 03:09:16,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 03:09:16" (1/1) ... [2019-10-03 03:09:16,081 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 03:09:16,133 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 03:09:16,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:09:16,526 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 03:09:16,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 03:09:16,621 INFO L192 MainTranslator]: Completed translation [2019-10-03 03:09:16,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16 WrapperNode [2019-10-03 03:09:16,623 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 03:09:16,624 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 03:09:16,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 03:09:16,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 03:09:16,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16" (1/1) ... [2019-10-03 03:09:16,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16" (1/1) ... [2019-10-03 03:09:16,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16" (1/1) ... [2019-10-03 03:09:16,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16" (1/1) ... [2019-10-03 03:09:16,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16" (1/1) ... [2019-10-03 03:09:16,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16" (1/1) ... [2019-10-03 03:09:16,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16" (1/1) ... [2019-10-03 03:09:16,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 03:09:16,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 03:09:16,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 03:09:16,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 03:09:16,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 03:09:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 03:09:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 03:09:16,772 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-10-03 03:09:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-10-03 03:09:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-10-03 03:09:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-10-03 03:09:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-10-03 03:09:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-10-03 03:09:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-03 03:09:16,773 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-10-03 03:09:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-10-03 03:09:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-10-03 03:09:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-10-03 03:09:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 03:09:16,774 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-10-03 03:09:16,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 03:09:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-03 03:09:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-03 03:09:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-03 03:09:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-03 03:09:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 03:09:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-03 03:09:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-10-03 03:09:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-10-03 03:09:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-10-03 03:09:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-10-03 03:09:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-10-03 03:09:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-03 03:09:16,776 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-03 03:09:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-10-03 03:09:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-10-03 03:09:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-10-03 03:09:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-10-03 03:09:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 03:09:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 03:09:16,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 03:09:17,591 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 03:09:17,592 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-03 03:09:17,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:09:17 BoogieIcfgContainer [2019-10-03 03:09:17,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 03:09:17,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 03:09:17,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 03:09:17,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 03:09:17,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 03:09:16" (1/3) ... [2019-10-03 03:09:17,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48920077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:09:17, skipping insertion in model container [2019-10-03 03:09:17,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 03:09:16" (2/3) ... [2019-10-03 03:09:17,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48920077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 03:09:17, skipping insertion in model container [2019-10-03 03:09:17,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 03:09:17" (3/3) ... [2019-10-03 03:09:17,606 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2019-10-03 03:09:17,617 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 03:09:17,626 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 03:09:17,643 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 03:09:17,680 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 03:09:17,680 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 03:09:17,680 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 03:09:17,680 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 03:09:17,681 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 03:09:17,682 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 03:09:17,682 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 03:09:17,682 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 03:09:17,712 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states. [2019-10-03 03:09:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-03 03:09:17,726 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:17,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:17,730 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:17,736 INFO L82 PathProgramCache]: Analyzing trace with hash 310880814, now seen corresponding path program 1 times [2019-10-03 03:09:17,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:17,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:17,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:17,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:17,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:18,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:18,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:18,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:18,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:18,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:18,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:18,106 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 4 states. [2019-10-03 03:09:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:18,253 INFO L93 Difference]: Finished difference Result 212 states and 320 transitions. [2019-10-03 03:09:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:18,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-03 03:09:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:18,291 INFO L225 Difference]: With dead ends: 212 [2019-10-03 03:09:18,292 INFO L226 Difference]: Without dead ends: 212 [2019-10-03 03:09:18,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-03 03:09:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2019-10-03 03:09:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-10-03 03:09:18,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 313 transitions. [2019-10-03 03:09:18,363 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 313 transitions. Word has length 21 [2019-10-03 03:09:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:18,363 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 313 transitions. [2019-10-03 03:09:18,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:18,364 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 313 transitions. [2019-10-03 03:09:18,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 03:09:18,366 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:18,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:18,367 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:18,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1405375627, now seen corresponding path program 1 times [2019-10-03 03:09:18,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:18,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:18,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:18,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:18,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:18,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:18,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:18,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:18,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:18,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:18,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:18,489 INFO L87 Difference]: Start difference. First operand 210 states and 313 transitions. Second operand 4 states. [2019-10-03 03:09:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:18,571 INFO L93 Difference]: Finished difference Result 226 states and 334 transitions. [2019-10-03 03:09:18,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:18,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-03 03:09:18,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:18,580 INFO L225 Difference]: With dead ends: 226 [2019-10-03 03:09:18,581 INFO L226 Difference]: Without dead ends: 226 [2019-10-03 03:09:18,582 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-10-03 03:09:18,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2019-10-03 03:09:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-03 03:09:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 329 transitions. [2019-10-03 03:09:18,636 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 329 transitions. Word has length 22 [2019-10-03 03:09:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:18,637 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 329 transitions. [2019-10-03 03:09:18,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 329 transitions. [2019-10-03 03:09:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 03:09:18,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:18,640 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:09:18,640 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:18,644 INFO L82 PathProgramCache]: Analyzing trace with hash -152672816, now seen corresponding path program 1 times [2019-10-03 03:09:18,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:18,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:18,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:18,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:18,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:18,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:18,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:18,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 03:09:18,782 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:18,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 03:09:18,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 03:09:18,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 03:09:18,785 INFO L87 Difference]: Start difference. First operand 223 states and 329 transitions. Second operand 3 states. [2019-10-03 03:09:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:18,815 INFO L93 Difference]: Finished difference Result 252 states and 374 transitions. [2019-10-03 03:09:18,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 03:09:18,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-03 03:09:18,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:18,823 INFO L225 Difference]: With dead ends: 252 [2019-10-03 03:09:18,824 INFO L226 Difference]: Without dead ends: 252 [2019-10-03 03:09:18,825 INFO L640 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-10-03 03:09:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-10-03 03:09:18,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 225. [2019-10-03 03:09:18,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-03 03:09:18,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 331 transitions. [2019-10-03 03:09:18,862 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 331 transitions. Word has length 30 [2019-10-03 03:09:18,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:18,863 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 331 transitions. [2019-10-03 03:09:18,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 03:09:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 331 transitions. [2019-10-03 03:09:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-03 03:09:18,868 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:18,868 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:09:18,869 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 279611359, now seen corresponding path program 1 times [2019-10-03 03:09:18,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:18,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:18,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:18,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:18,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:18,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:18,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:09:18,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:18,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:09:18,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:09:18,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:18,988 INFO L87 Difference]: Start difference. First operand 225 states and 331 transitions. Second operand 5 states. [2019-10-03 03:09:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:19,023 INFO L93 Difference]: Finished difference Result 233 states and 341 transitions. [2019-10-03 03:09:19,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:19,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-03 03:09:19,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:19,026 INFO L225 Difference]: With dead ends: 233 [2019-10-03 03:09:19,026 INFO L226 Difference]: Without dead ends: 233 [2019-10-03 03:09:19,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:19,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-10-03 03:09:19,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2019-10-03 03:09:19,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-10-03 03:09:19,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 335 transitions. [2019-10-03 03:09:19,040 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 335 transitions. Word has length 38 [2019-10-03 03:09:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:19,040 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 335 transitions. [2019-10-03 03:09:19,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:09:19,040 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 335 transitions. [2019-10-03 03:09:19,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 03:09:19,042 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:19,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:19,043 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:19,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:19,043 INFO L82 PathProgramCache]: Analyzing trace with hash -955467248, now seen corresponding path program 1 times [2019-10-03 03:09:19,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,046 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:19,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 03:09:19,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:19,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:19,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:19,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:19,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:19,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:19,114 INFO L87 Difference]: Start difference. First operand 229 states and 335 transitions. Second operand 4 states. [2019-10-03 03:09:19,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:19,143 INFO L93 Difference]: Finished difference Result 232 states and 337 transitions. [2019-10-03 03:09:19,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:19,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-10-03 03:09:19,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:19,148 INFO L225 Difference]: With dead ends: 232 [2019-10-03 03:09:19,148 INFO L226 Difference]: Without dead ends: 225 [2019-10-03 03:09:19,148 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:19,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-10-03 03:09:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2019-10-03 03:09:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-10-03 03:09:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 326 transitions. [2019-10-03 03:09:19,165 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 326 transitions. Word has length 39 [2019-10-03 03:09:19,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:19,166 INFO L475 AbstractCegarLoop]: Abstraction has 225 states and 326 transitions. [2019-10-03 03:09:19,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:19,166 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 326 transitions. [2019-10-03 03:09:19,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 03:09:19,171 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:19,172 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:09:19,173 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:19,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash -13889788, now seen corresponding path program 1 times [2019-10-03 03:09:19,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:19,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-03 03:09:19,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:19,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:19,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:19,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:19,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:19,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:19,247 INFO L87 Difference]: Start difference. First operand 225 states and 326 transitions. Second operand 4 states. [2019-10-03 03:09:19,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:19,301 INFO L93 Difference]: Finished difference Result 244 states and 349 transitions. [2019-10-03 03:09:19,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:19,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-03 03:09:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:19,303 INFO L225 Difference]: With dead ends: 244 [2019-10-03 03:09:19,304 INFO L226 Difference]: Without dead ends: 244 [2019-10-03 03:09:19,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:19,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-10-03 03:09:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-10-03 03:09:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-10-03 03:09:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 345 transitions. [2019-10-03 03:09:19,315 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 345 transitions. Word has length 41 [2019-10-03 03:09:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:19,315 INFO L475 AbstractCegarLoop]: Abstraction has 241 states and 345 transitions. [2019-10-03 03:09:19,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 345 transitions. [2019-10-03 03:09:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 03:09:19,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:19,316 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 03:09:19,317 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:19,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:19,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1194739861, now seen corresponding path program 1 times [2019-10-03 03:09:19,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:19,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-03 03:09:19,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:19,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:19,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:19,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:19,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:19,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:19,367 INFO L87 Difference]: Start difference. First operand 241 states and 345 transitions. Second operand 4 states. [2019-10-03 03:09:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:19,418 INFO L93 Difference]: Finished difference Result 250 states and 357 transitions. [2019-10-03 03:09:19,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:19,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-10-03 03:09:19,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:19,421 INFO L225 Difference]: With dead ends: 250 [2019-10-03 03:09:19,421 INFO L226 Difference]: Without dead ends: 250 [2019-10-03 03:09:19,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-03 03:09:19,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-10-03 03:09:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-03 03:09:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 353 transitions. [2019-10-03 03:09:19,438 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 353 transitions. Word has length 41 [2019-10-03 03:09:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:19,441 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 353 transitions. [2019-10-03 03:09:19,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 353 transitions. [2019-10-03 03:09:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-03 03:09:19,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:19,445 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-03 03:09:19,445 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:19,445 INFO L82 PathProgramCache]: Analyzing trace with hash -291623798, now seen corresponding path program 1 times [2019-10-03 03:09:19,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:19,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-03 03:09:19,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:19,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:09:19,540 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:19,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:09:19,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:09:19,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:19,543 INFO L87 Difference]: Start difference. First operand 248 states and 353 transitions. Second operand 5 states. [2019-10-03 03:09:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:19,580 INFO L93 Difference]: Finished difference Result 254 states and 359 transitions. [2019-10-03 03:09:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:19,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-10-03 03:09:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:19,587 INFO L225 Difference]: With dead ends: 254 [2019-10-03 03:09:19,588 INFO L226 Difference]: Without dead ends: 250 [2019-10-03 03:09:19,588 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-10-03 03:09:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-10-03 03:09:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-03 03:09:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 352 transitions. [2019-10-03 03:09:19,600 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 352 transitions. Word has length 59 [2019-10-03 03:09:19,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:19,600 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 352 transitions. [2019-10-03 03:09:19,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:09:19,601 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 352 transitions. [2019-10-03 03:09:19,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-03 03:09:19,602 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:19,602 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-03 03:09:19,602 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:19,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:19,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1361992071, now seen corresponding path program 1 times [2019-10-03 03:09:19,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:19,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:19,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 03:09:19,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:19,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:19,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:19,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:19,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:19,675 INFO L87 Difference]: Start difference. First operand 248 states and 352 transitions. Second operand 4 states. [2019-10-03 03:09:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:19,730 INFO L93 Difference]: Finished difference Result 269 states and 376 transitions. [2019-10-03 03:09:19,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:19,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-10-03 03:09:19,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:19,736 INFO L225 Difference]: With dead ends: 269 [2019-10-03 03:09:19,736 INFO L226 Difference]: Without dead ends: 269 [2019-10-03 03:09:19,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-03 03:09:19,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-10-03 03:09:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-10-03 03:09:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2019-10-03 03:09:19,756 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 62 [2019-10-03 03:09:19,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:19,758 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2019-10-03 03:09:19,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:19,758 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2019-10-03 03:09:19,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-03 03:09:19,763 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:19,764 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-10-03 03:09:19,765 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:19,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:19,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1503019715, now seen corresponding path program 1 times [2019-10-03 03:09:19,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:19,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:19,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-03 03:09:19,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:19,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:19,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:19,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:19,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:19,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:19,866 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand 4 states. [2019-10-03 03:09:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:19,918 INFO L93 Difference]: Finished difference Result 260 states and 359 transitions. [2019-10-03 03:09:19,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:19,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-03 03:09:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:19,920 INFO L225 Difference]: With dead ends: 260 [2019-10-03 03:09:19,920 INFO L226 Difference]: Without dead ends: 260 [2019-10-03 03:09:19,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-10-03 03:09:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-10-03 03:09:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-03 03:09:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 359 transitions. [2019-10-03 03:09:19,930 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 359 transitions. Word has length 63 [2019-10-03 03:09:19,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:19,930 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 359 transitions. [2019-10-03 03:09:19,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 359 transitions. [2019-10-03 03:09:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-03 03:09:19,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:19,932 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-10-03 03:09:19,932 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:19,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:19,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1498693946, now seen corresponding path program 1 times [2019-10-03 03:09:19,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:19,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:19,984 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-03 03:09:19,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:19,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:09:19,985 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:19,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:09:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:09:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:19,986 INFO L87 Difference]: Start difference. First operand 260 states and 359 transitions. Second operand 5 states. [2019-10-03 03:09:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:20,008 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2019-10-03 03:09:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:20,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-03 03:09:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:20,011 INFO L225 Difference]: With dead ends: 266 [2019-10-03 03:09:20,011 INFO L226 Difference]: Without dead ends: 262 [2019-10-03 03:09:20,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-10-03 03:09:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2019-10-03 03:09:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-03 03:09:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 358 transitions. [2019-10-03 03:09:20,020 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 358 transitions. Word has length 82 [2019-10-03 03:09:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:20,021 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 358 transitions. [2019-10-03 03:09:20,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:09:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 358 transitions. [2019-10-03 03:09:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-03 03:09:20,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:20,022 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-03 03:09:20,022 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:20,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1251929143, now seen corresponding path program 1 times [2019-10-03 03:09:20,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:20,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:20,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:20,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:20,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-03 03:09:20,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:20,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:20,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:20,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:20,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:20,091 INFO L87 Difference]: Start difference. First operand 260 states and 358 transitions. Second operand 4 states. [2019-10-03 03:09:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:20,155 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2019-10-03 03:09:20,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:20,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-03 03:09:20,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:20,158 INFO L225 Difference]: With dead ends: 258 [2019-10-03 03:09:20,158 INFO L226 Difference]: Without dead ends: 258 [2019-10-03 03:09:20,159 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:20,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-03 03:09:20,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-10-03 03:09:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-03 03:09:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 354 transitions. [2019-10-03 03:09:20,167 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 354 transitions. Word has length 85 [2019-10-03 03:09:20,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:20,167 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 354 transitions. [2019-10-03 03:09:20,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 354 transitions. [2019-10-03 03:09:20,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-03 03:09:20,169 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:20,169 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-10-03 03:09:20,169 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:20,169 INFO L82 PathProgramCache]: Analyzing trace with hash 599019244, now seen corresponding path program 1 times [2019-10-03 03:09:20,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:20,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:20,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:20,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:20,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-03 03:09:20,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:20,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:09:20,240 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-10-03 03:09:20,243 INFO L207 CegarAbsIntRunner]: [38], [40], [44], [46], [50], [52], [56], [58], [62], [63], [80], [83], [86], [92], [95], [98], [104], [107], [110], [119], [129], [136], [138], [141], [143], [147], [149], [152], [154], [158], [160], [163], [165], [169], [171], [182], [184], [188], [189], [190], [192], [201], [376], [381], [386], [391], [433], [434], [435], [438], [440], [496], [536], [537], [538], [539], [540], [541], [542], [543], [550], [551], [552], [553], [554], [555], [558], [559], [560], [602], [606], [607], [608], [614] [2019-10-03 03:09:20,314 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:09:20,314 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:09:20,482 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:09:20,641 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:09:20,644 INFO L272 AbstractInterpreter]: Visited 56 different actions 205 times. Merged at 16 different actions 45 times. Never widened. Performed 959 root evaluator evaluations with a maximum evaluation depth of 5. Performed 959 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 1 different actions. Largest state had 89 variables. [2019-10-03 03:09:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:20,651 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:09:20,885 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-10-03 03:09:20,885 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:09:21,638 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-10-03 03:09:21,638 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:09:21,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:09:21,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [4] total 37 [2019-10-03 03:09:21,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:21,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-03 03:09:21,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-03 03:09:21,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2019-10-03 03:09:21,641 INFO L87 Difference]: Start difference. First operand 258 states and 354 transitions. Second operand 35 states. [2019-10-03 03:09:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:33,938 INFO L93 Difference]: Finished difference Result 374 states and 493 transitions. [2019-10-03 03:09:33,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-03 03:09:33,939 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-10-03 03:09:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:33,942 INFO L225 Difference]: With dead ends: 374 [2019-10-03 03:09:33,942 INFO L226 Difference]: Without dead ends: 374 [2019-10-03 03:09:33,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=540, Invalid=5312, Unknown=0, NotChecked=0, Total=5852 [2019-10-03 03:09:33,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-10-03 03:09:33,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 306. [2019-10-03 03:09:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-10-03 03:09:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 404 transitions. [2019-10-03 03:09:33,967 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 404 transitions. Word has length 100 [2019-10-03 03:09:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:33,968 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 404 transitions. [2019-10-03 03:09:33,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-03 03:09:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 404 transitions. [2019-10-03 03:09:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-03 03:09:33,970 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:33,970 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:33,970 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:33,971 INFO L82 PathProgramCache]: Analyzing trace with hash 158839533, now seen corresponding path program 1 times [2019-10-03 03:09:33,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:33,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:33,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:33,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:33,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:34,063 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-10-03 03:09:34,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:34,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 03:09:34,064 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:34,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 03:09:34,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 03:09:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:34,065 INFO L87 Difference]: Start difference. First operand 306 states and 404 transitions. Second operand 5 states. [2019-10-03 03:09:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:34,081 INFO L93 Difference]: Finished difference Result 310 states and 407 transitions. [2019-10-03 03:09:34,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:34,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-10-03 03:09:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:34,084 INFO L225 Difference]: With dead ends: 310 [2019-10-03 03:09:34,084 INFO L226 Difference]: Without dead ends: 306 [2019-10-03 03:09:34,085 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-03 03:09:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2019-10-03 03:09:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-10-03 03:09:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 399 transitions. [2019-10-03 03:09:34,097 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 399 transitions. Word has length 144 [2019-10-03 03:09:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:34,098 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 399 transitions. [2019-10-03 03:09:34,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 03:09:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 399 transitions. [2019-10-03 03:09:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-03 03:09:34,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:34,103 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:34,103 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:34,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1526725128, now seen corresponding path program 1 times [2019-10-03 03:09:34,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:34,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:34,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:34,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:34,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-03 03:09:34,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:34,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:09:34,194 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-10-03 03:09:34,195 INFO L207 CegarAbsIntRunner]: [38], [40], [44], [46], [50], [52], [56], [58], [62], [63], [64], [67], [70], [79], [80], [83], [86], [92], [95], [98], [104], [107], [110], [119], [129], [136], [138], [141], [143], [147], [149], [152], [154], [158], [160], [163], [165], [169], [171], [174], [176], [180], [182], [184], [188], [189], [190], [192], [201], [376], [381], [386], [391], [433], [434], [435], [438], [440], [496], [536], [537], [538], [539], [540], [541], [542], [543], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [602], [606], [607], [608], [614] [2019-10-03 03:09:34,202 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:09:34,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:09:34,221 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:09:34,371 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:09:34,372 INFO L272 AbstractInterpreter]: Visited 77 different actions 290 times. Merged at 24 different actions 74 times. Widened at 1 different actions 1 times. Performed 1352 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1352 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 5 fixpoints after 2 different actions. Largest state had 89 variables. [2019-10-03 03:09:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:34,373 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:09:34,577 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 90.82% of their original sizes. [2019-10-03 03:09:34,578 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:09:35,944 INFO L420 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2019-10-03 03:09:35,945 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:09:35,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:09:35,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [5] total 60 [2019-10-03 03:09:35,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:35,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-03 03:09:35,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-03 03:09:35,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2876, Unknown=0, NotChecked=0, Total=3192 [2019-10-03 03:09:35,948 INFO L87 Difference]: Start difference. First operand 306 states and 399 transitions. Second operand 57 states. [2019-10-03 03:09:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:55,211 INFO L93 Difference]: Finished difference Result 474 states and 635 transitions. [2019-10-03 03:09:55,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-03 03:09:55,211 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 153 [2019-10-03 03:09:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:55,214 INFO L225 Difference]: With dead ends: 474 [2019-10-03 03:09:55,214 INFO L226 Difference]: Without dead ends: 474 [2019-10-03 03:09:55,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2561 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=748, Invalid=8564, Unknown=0, NotChecked=0, Total=9312 [2019-10-03 03:09:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-03 03:09:55,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 460. [2019-10-03 03:09:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-10-03 03:09:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 617 transitions. [2019-10-03 03:09:55,230 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 617 transitions. Word has length 153 [2019-10-03 03:09:55,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:55,230 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 617 transitions. [2019-10-03 03:09:55,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-03 03:09:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 617 transitions. [2019-10-03 03:09:55,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-03 03:09:55,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:55,233 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:55,233 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:55,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:55,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2129561686, now seen corresponding path program 1 times [2019-10-03 03:09:55,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:55,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:55,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:55,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:55,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:55,323 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-03 03:09:55,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:55,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:55,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:55,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:55,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:55,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:55,325 INFO L87 Difference]: Start difference. First operand 460 states and 617 transitions. Second operand 4 states. [2019-10-03 03:09:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:55,350 INFO L93 Difference]: Finished difference Result 474 states and 629 transitions. [2019-10-03 03:09:55,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:55,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-03 03:09:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:55,354 INFO L225 Difference]: With dead ends: 474 [2019-10-03 03:09:55,354 INFO L226 Difference]: Without dead ends: 474 [2019-10-03 03:09:55,354 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-10-03 03:09:55,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 470. [2019-10-03 03:09:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-10-03 03:09:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 625 transitions. [2019-10-03 03:09:55,366 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 625 transitions. Word has length 173 [2019-10-03 03:09:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:55,367 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 625 transitions. [2019-10-03 03:09:55,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 625 transitions. [2019-10-03 03:09:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-03 03:09:55,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:55,369 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:55,370 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:55,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:55,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1138890084, now seen corresponding path program 1 times [2019-10-03 03:09:55,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:55,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:55,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:55,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:55,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-10-03 03:09:55,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:55,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:55,516 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:55,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:55,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:55,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:55,517 INFO L87 Difference]: Start difference. First operand 470 states and 625 transitions. Second operand 4 states. [2019-10-03 03:09:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:55,545 INFO L93 Difference]: Finished difference Result 468 states and 615 transitions. [2019-10-03 03:09:55,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:55,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-10-03 03:09:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:55,550 INFO L225 Difference]: With dead ends: 468 [2019-10-03 03:09:55,550 INFO L226 Difference]: Without dead ends: 468 [2019-10-03 03:09:55,551 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2019-10-03 03:09:55,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2019-10-03 03:09:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2019-10-03 03:09:55,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 615 transitions. [2019-10-03 03:09:55,572 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 615 transitions. Word has length 186 [2019-10-03 03:09:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:55,573 INFO L475 AbstractCegarLoop]: Abstraction has 468 states and 615 transitions. [2019-10-03 03:09:55,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 615 transitions. [2019-10-03 03:09:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-03 03:09:55,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:55,576 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:55,576 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:55,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1259328643, now seen corresponding path program 1 times [2019-10-03 03:09:55,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:55,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:55,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:55,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:55,668 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-03 03:09:55,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:55,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:55,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:55,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:55,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:55,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:55,670 INFO L87 Difference]: Start difference. First operand 468 states and 615 transitions. Second operand 4 states. [2019-10-03 03:09:55,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:55,684 INFO L93 Difference]: Finished difference Result 373 states and 473 transitions. [2019-10-03 03:09:55,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:55,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-10-03 03:09:55,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:55,688 INFO L225 Difference]: With dead ends: 373 [2019-10-03 03:09:55,689 INFO L226 Difference]: Without dead ends: 373 [2019-10-03 03:09:55,689 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-10-03 03:09:55,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 368. [2019-10-03 03:09:55,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-03 03:09:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 465 transitions. [2019-10-03 03:09:55,698 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 465 transitions. Word has length 199 [2019-10-03 03:09:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:55,699 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 465 transitions. [2019-10-03 03:09:55,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:55,699 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 465 transitions. [2019-10-03 03:09:55,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-03 03:09:55,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:55,702 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:55,702 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:55,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:55,703 INFO L82 PathProgramCache]: Analyzing trace with hash 714584693, now seen corresponding path program 1 times [2019-10-03 03:09:55,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:55,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:55,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:55,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:55,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:55,787 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-10-03 03:09:55,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:55,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:55,788 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:55,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:55,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:55,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:55,789 INFO L87 Difference]: Start difference. First operand 368 states and 465 transitions. Second operand 4 states. [2019-10-03 03:09:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:56,073 INFO L93 Difference]: Finished difference Result 681 states and 890 transitions. [2019-10-03 03:09:56,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 03:09:56,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-10-03 03:09:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:56,077 INFO L225 Difference]: With dead ends: 681 [2019-10-03 03:09:56,077 INFO L226 Difference]: Without dead ends: 681 [2019-10-03 03:09:56,078 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-03 03:09:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-10-03 03:09:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 480. [2019-10-03 03:09:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-10-03 03:09:56,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 631 transitions. [2019-10-03 03:09:56,095 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 631 transitions. Word has length 201 [2019-10-03 03:09:56,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:56,096 INFO L475 AbstractCegarLoop]: Abstraction has 480 states and 631 transitions. [2019-10-03 03:09:56,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:56,096 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 631 transitions. [2019-10-03 03:09:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-03 03:09:56,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:56,100 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:56,100 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:56,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:56,100 INFO L82 PathProgramCache]: Analyzing trace with hash -708936932, now seen corresponding path program 1 times [2019-10-03 03:09:56,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:56,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:56,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:56,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-03 03:09:56,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:56,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:56,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:56,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:56,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:56,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:56,222 INFO L87 Difference]: Start difference. First operand 480 states and 631 transitions. Second operand 4 states. [2019-10-03 03:09:56,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:56,427 INFO L93 Difference]: Finished difference Result 817 states and 1098 transitions. [2019-10-03 03:09:56,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:56,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-10-03 03:09:56,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:56,434 INFO L225 Difference]: With dead ends: 817 [2019-10-03 03:09:56,435 INFO L226 Difference]: Without dead ends: 817 [2019-10-03 03:09:56,435 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-10-03 03:09:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 803. [2019-10-03 03:09:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-10-03 03:09:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1080 transitions. [2019-10-03 03:09:56,471 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1080 transitions. Word has length 236 [2019-10-03 03:09:56,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:56,471 INFO L475 AbstractCegarLoop]: Abstraction has 803 states and 1080 transitions. [2019-10-03 03:09:56,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1080 transitions. [2019-10-03 03:09:56,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-03 03:09:56,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:56,477 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:56,477 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash 847110771, now seen corresponding path program 1 times [2019-10-03 03:09:56,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:56,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:56,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:56,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-03 03:09:56,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:56,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:56,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:56,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:56,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:56,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:56,588 INFO L87 Difference]: Start difference. First operand 803 states and 1080 transitions. Second operand 4 states. [2019-10-03 03:09:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:56,817 INFO L93 Difference]: Finished difference Result 1472 states and 2012 transitions. [2019-10-03 03:09:56,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:56,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-03 03:09:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:56,825 INFO L225 Difference]: With dead ends: 1472 [2019-10-03 03:09:56,826 INFO L226 Difference]: Without dead ends: 1472 [2019-10-03 03:09:56,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:56,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2019-10-03 03:09:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1110. [2019-10-03 03:09:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-10-03 03:09:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1508 transitions. [2019-10-03 03:09:56,873 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1508 transitions. Word has length 237 [2019-10-03 03:09:56,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:56,874 INFO L475 AbstractCegarLoop]: Abstraction has 1110 states and 1508 transitions. [2019-10-03 03:09:56,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1508 transitions. [2019-10-03 03:09:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-03 03:09:56,879 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:56,879 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:56,879 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:56,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:56,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1622525289, now seen corresponding path program 1 times [2019-10-03 03:09:56,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:56,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:56,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:56,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-03 03:09:56,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 03:09:56,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 03:09:56,984 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:09:56,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 03:09:56,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 03:09:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:56,986 INFO L87 Difference]: Start difference. First operand 1110 states and 1508 transitions. Second operand 4 states. [2019-10-03 03:09:57,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 03:09:57,188 INFO L93 Difference]: Finished difference Result 2113 states and 2907 transitions. [2019-10-03 03:09:57,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 03:09:57,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-10-03 03:09:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 03:09:57,200 INFO L225 Difference]: With dead ends: 2113 [2019-10-03 03:09:57,201 INFO L226 Difference]: Without dead ends: 2113 [2019-10-03 03:09:57,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 03:09:57,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2019-10-03 03:09:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 1400. [2019-10-03 03:09:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2019-10-03 03:09:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1914 transitions. [2019-10-03 03:09:57,260 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1914 transitions. Word has length 238 [2019-10-03 03:09:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 03:09:57,260 INFO L475 AbstractCegarLoop]: Abstraction has 1400 states and 1914 transitions. [2019-10-03 03:09:57,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 03:09:57,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1914 transitions. [2019-10-03 03:09:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-03 03:09:57,266 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 03:09:57,266 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 03:09:57,266 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 03:09:57,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:57,267 INFO L82 PathProgramCache]: Analyzing trace with hash 428458709, now seen corresponding path program 1 times [2019-10-03 03:09:57,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 03:09:57,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:57,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 03:09:57,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 03:09:57,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 03:09:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 03:09:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-10-03 03:09:57,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 03:09:57,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 03:09:57,387 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2019-10-03 03:09:57,387 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [37], [38], [40], [44], [46], [50], [52], [56], [58], [62], [63], [64], [67], [70], [79], [80], [83], [86], [92], [95], [98], [104], [107], [110], [119], [120], [123], [128], [129], [136], [138], [141], [143], [147], [149], [152], [154], [158], [160], [163], [165], [169], [171], [174], [176], [180], [184], [188], [189], [190], [192], [201], [206], [208], [215], [220], [225], [230], [232], [234], [306], [309], [342], [345], [372], [374], [375], [376], [379], [381], [384], [386], [389], [394], [395], [399], [404], [406], [432], [433], [434], [435], [438], [440], [449], [452], [495], [496], [500], [505], [507], [533], [534], [535], [536], [537], [538], [539], [540], [541], [542], [543], [550], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [572], [573], [584], [585], [594], [595], [604], [605], [606], [607], [608], [612], [613], [614], [615] [2019-10-03 03:09:57,391 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 03:09:57,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 03:09:57,403 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 03:09:57,512 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 03:09:57,513 INFO L272 AbstractInterpreter]: Visited 123 different actions 364 times. Merged at 24 different actions 82 times. Widened at 1 different actions 1 times. Performed 1848 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1848 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 3 different actions. Largest state had 90 variables. [2019-10-03 03:09:57,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 03:09:57,513 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 03:09:57,753 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 84.44% of their original sizes. [2019-10-03 03:09:57,753 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 03:10:01,380 INFO L420 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2019-10-03 03:10:01,380 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 03:10:01,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 03:10:01,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [76] imperfect sequences [7] total 81 [2019-10-03 03:10:01,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 03:10:01,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-10-03 03:10:01,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-10-03 03:10:01,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=5287, Unknown=0, NotChecked=0, Total=5700 [2019-10-03 03:10:01,384 INFO L87 Difference]: Start difference. First operand 1400 states and 1914 transitions. Second operand 76 states. [2019-10-03 03:10:13,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-03 03:10:13,534 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: There is no value of variable ~nomsg~0. at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.lambda$0(SingletonVariableExpressionEvaluator.java:83) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunctionPerType(TypeUtils.java:114) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.util.typeutils.TypeUtils.applyVariableFunction(TypeUtils.java:103) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.SingletonVariableExpressionEvaluator.evaluate(SingletonVariableExpressionEvaluator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:90) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.BinaryExpressionEvaluator.evaluate(BinaryExpressionEvaluator.java:88) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.evaluator.Evaluator.evaluate(Evaluator.java:96) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalEvaluator.evaluate(NonrelationalEvaluator.java:81) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:297) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:156) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:138) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:107) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:422) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:413) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:140) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:323) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalTransitionWithValidState(AbsIntHoareTripleChecker.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternalAbsInt(AbsIntHoareTripleChecker.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.AbsIntHoareTripleChecker.checkInternal(AbsIntHoareTripleChecker.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:72) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:708) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:637) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-03 03:10:13,551 INFO L168 Benchmark]: Toolchain (without parser) took 57482.24 ms. Allocated memory was 138.9 MB in the beginning and 673.7 MB in the end (delta: 534.8 MB). Free memory was 88.5 MB in the beginning and 161.4 MB in the end (delta: -72.9 MB). Peak memory consumption was 461.9 MB. Max. memory is 7.1 GB. [2019-10-03 03:10:13,551 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 03:10:13,552 INFO L168 Benchmark]: CACSL2BoogieTranslator took 558.61 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 88.3 MB in the beginning and 170.7 MB in the end (delta: -82.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-10-03 03:10:13,553 INFO L168 Benchmark]: Boogie Preprocessor took 81.39 ms. Allocated memory is still 199.8 MB. Free memory was 170.7 MB in the beginning and 167.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-10-03 03:10:13,556 INFO L168 Benchmark]: RCFGBuilder took 887.78 ms. Allocated memory is still 199.8 MB. Free memory was 167.9 MB in the beginning and 112.4 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. [2019-10-03 03:10:13,557 INFO L168 Benchmark]: TraceAbstraction took 55948.43 ms. Allocated memory was 199.8 MB in the beginning and 673.7 MB in the end (delta: 474.0 MB). Free memory was 112.4 MB in the beginning and 161.4 MB in the end (delta: -49.0 MB). Peak memory consumption was 425.0 MB. Max. memory is 7.1 GB. [2019-10-03 03:10:13,562 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 558.61 ms. Allocated memory was 138.9 MB in the beginning and 199.8 MB in the end (delta: 60.8 MB). Free memory was 88.3 MB in the beginning and 170.7 MB in the end (delta: -82.4 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.39 ms. Allocated memory is still 199.8 MB. Free memory was 170.7 MB in the beginning and 167.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 887.78 ms. Allocated memory is still 199.8 MB. Free memory was 167.9 MB in the beginning and 112.4 MB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55948.43 ms. Allocated memory was 199.8 MB in the beginning and 673.7 MB in the end (delta: 474.0 MB). Free memory was 112.4 MB in the beginning and 161.4 MB in the end (delta: -49.0 MB). Peak memory consumption was 425.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: There is no value of variable ~nomsg~0. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: There is no value of variable ~nomsg~0.: de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalState.getValue(NonrelationalState.java:147) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...