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.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:54:04,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:54:04,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:54:04,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:54:04,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:54:04,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:54:04,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:54:04,118 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:54:04,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:54:04,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:54:04,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:54:04,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:54:04,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:54:04,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:54:04,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:54:04,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:54:04,128 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:54:04,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:54:04,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:54:04,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:54:04,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:54:04,139 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:54:04,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:54:04,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:54:04,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:54:04,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:54:04,146 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:54:04,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:54:04,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:54:04,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:54:04,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:54:04,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:54:04,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:54:04,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:54:04,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:54:04,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:54:04,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:54:04,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:54:04,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:54:04,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:54:04,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:54:04,163 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:54:04,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:54:04,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:54:04,187 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:54:04,187 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:54:04,188 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:54:04,188 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:54:04,188 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:54:04,189 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:54:04,189 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:54:04,189 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:54:04,190 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:54:04,190 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:54:04,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:54:04,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:54:04,191 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:54:04,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:54:04,191 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:54:04,191 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:54:04,191 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:54:04,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:54:04,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:54:04,192 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:54:04,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:54:04,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:54:04,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:54:04,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:54:04,193 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:54:04,193 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:54:04,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:54:04,194 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:54:04,221 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:54:04,236 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:54:04,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:54:04,244 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:54:04,245 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:54:04,246 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.BOUNDED-10.pals.c [2019-09-10 03:54:04,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71971436c/4c3d9da9988646589dd6921fc0eebc1e/FLAG289e2751c [2019-09-10 03:54:04,846 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:54:04,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-09-10 03:54:04,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71971436c/4c3d9da9988646589dd6921fc0eebc1e/FLAG289e2751c [2019-09-10 03:54:05,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71971436c/4c3d9da9988646589dd6921fc0eebc1e [2019-09-10 03:54:05,167 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:54:05,169 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:54:05,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:54:05,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:54:05,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:54:05,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:54:05" (1/1) ... [2019-09-10 03:54:05,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2baf7c8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05, skipping insertion in model container [2019-09-10 03:54:05,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:54:05" (1/1) ... [2019-09-10 03:54:05,185 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:54:05,243 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:54:05,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:54:05,601 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:54:05,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:54:05,696 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:54:05,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05 WrapperNode [2019-09-10 03:54:05,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:54:05,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:54:05,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:54:05,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:54:05,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05" (1/1) ... [2019-09-10 03:54:05,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05" (1/1) ... [2019-09-10 03:54:05,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05" (1/1) ... [2019-09-10 03:54:05,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05" (1/1) ... [2019-09-10 03:54:05,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05" (1/1) ... [2019-09-10 03:54:05,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05" (1/1) ... [2019-09-10 03:54:05,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05" (1/1) ... [2019-09-10 03:54:05,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:54:05,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:54:05,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:54:05,800 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:54:05,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:54:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:54:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:54:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2019-09-10 03:54:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2019-09-10 03:54:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2019-09-10 03:54:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_int8 [2019-09-10 03:54:05,851 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2019-09-10 03:54:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 03:54:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 03:54:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure gate1_each_pals_period [2019-09-10 03:54:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure gate2_each_pals_period [2019-09-10 03:54:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure gate3_each_pals_period [2019-09-10 03:54:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure voter [2019-09-10 03:54:05,852 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:54:05,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 03:54:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:54:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 03:54:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 03:54:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 03:54:05,853 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 03:54:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 03:54:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 03:54:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2019-09-10 03:54:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2019-09-10 03:54:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2019-09-10 03:54:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_int8 [2019-09-10 03:54:05,854 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2019-09-10 03:54:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 03:54:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 03:54:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure gate1_each_pals_period [2019-09-10 03:54:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure gate2_each_pals_period [2019-09-10 03:54:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure gate3_each_pals_period [2019-09-10 03:54:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure voter [2019-09-10 03:54:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:54:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:54:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:54:06,732 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:54:06,735 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 03:54:06,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:54:06 BoogieIcfgContainer [2019-09-10 03:54:06,738 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:54:06,739 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:54:06,739 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:54:06,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:54:06,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:54:05" (1/3) ... [2019-09-10 03:54:06,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536e5897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:54:06, skipping insertion in model container [2019-09-10 03:54:06,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:54:05" (2/3) ... [2019-09-10 03:54:06,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@536e5897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:54:06, skipping insertion in model container [2019-09-10 03:54:06,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:54:06" (3/3) ... [2019-09-10 03:54:06,748 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-09-10 03:54:06,759 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:54:06,769 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:54:06,786 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:54:06,821 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:54:06,822 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:54:06,822 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:54:06,822 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:54:06,822 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:54:06,823 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:54:06,823 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:54:06,823 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:54:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states. [2019-09-10 03:54:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-10 03:54:06,864 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:06,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:54:06,868 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:06,874 INFO L82 PathProgramCache]: Analyzing trace with hash -968101902, now seen corresponding path program 1 times [2019-09-10 03:54:06,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:06,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:06,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:06,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:07,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:54:07,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:07,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:07,160 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:07,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:07,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:07,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:07,185 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 4 states. [2019-09-10 03:54:07,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:07,360 INFO L93 Difference]: Finished difference Result 218 states and 326 transitions. [2019-09-10 03:54:07,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:07,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-09-10 03:54:07,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:07,395 INFO L225 Difference]: With dead ends: 218 [2019-09-10 03:54:07,396 INFO L226 Difference]: Without dead ends: 213 [2019-09-10 03:54:07,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:07,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-10 03:54:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2019-09-10 03:54:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-09-10 03:54:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 314 transitions. [2019-09-10 03:54:07,507 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 314 transitions. Word has length 21 [2019-09-10 03:54:07,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:07,507 INFO L475 AbstractCegarLoop]: Abstraction has 211 states and 314 transitions. [2019-09-10 03:54:07,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:07,508 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 314 transitions. [2019-09-10 03:54:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-10 03:54:07,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:07,511 INFO L399 BasicCegarLoop]: 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-09-10 03:54:07,512 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:07,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:07,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1316040493, now seen corresponding path program 1 times [2019-09-10 03:54:07,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:07,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:07,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:07,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:07,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:54:07,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:07,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:07,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:07,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:07,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:07,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:07,649 INFO L87 Difference]: Start difference. First operand 211 states and 314 transitions. Second operand 4 states. [2019-09-10 03:54:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:07,720 INFO L93 Difference]: Finished difference Result 227 states and 335 transitions. [2019-09-10 03:54:07,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:07,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-09-10 03:54:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:07,724 INFO L225 Difference]: With dead ends: 227 [2019-09-10 03:54:07,724 INFO L226 Difference]: Without dead ends: 227 [2019-09-10 03:54:07,725 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-10 03:54:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-09-10 03:54:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-10 03:54:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 330 transitions. [2019-09-10 03:54:07,747 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 330 transitions. Word has length 22 [2019-09-10 03:54:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:07,747 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 330 transitions. [2019-09-10 03:54:07,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 330 transitions. [2019-09-10 03:54:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-10 03:54:07,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:07,750 INFO L399 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-09-10 03:54:07,750 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:07,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash 919864782, now seen corresponding path program 1 times [2019-09-10 03:54:07,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:07,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:07,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:07,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:07,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:54:07,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:07,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:54:07,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:07,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:54:07,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:54:07,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:54:07,826 INFO L87 Difference]: Start difference. First operand 224 states and 330 transitions. Second operand 3 states. [2019-09-10 03:54:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:07,842 INFO L93 Difference]: Finished difference Result 253 states and 375 transitions. [2019-09-10 03:54:07,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:54:07,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-10 03:54:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:07,848 INFO L225 Difference]: With dead ends: 253 [2019-09-10 03:54:07,849 INFO L226 Difference]: Without dead ends: 253 [2019-09-10 03:54:07,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:54:07,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-09-10 03:54:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2019-09-10 03:54:07,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-10 03:54:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 332 transitions. [2019-09-10 03:54:07,888 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 332 transitions. Word has length 30 [2019-09-10 03:54:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:07,889 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 332 transitions. [2019-09-10 03:54:07,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:54:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 332 transitions. [2019-09-10 03:54:07,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-10 03:54:07,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:07,892 INFO L399 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-09-10 03:54:07,893 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:07,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1667611779, now seen corresponding path program 1 times [2019-09-10 03:54:07,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:07,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:07,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:07,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:07,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:07,989 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:54:07,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:07,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:07,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:07,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:07,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:07,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:07,991 INFO L87 Difference]: Start difference. First operand 226 states and 332 transitions. Second operand 5 states. [2019-09-10 03:54:08,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:08,026 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2019-09-10 03:54:08,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:08,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-09-10 03:54:08,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:08,029 INFO L225 Difference]: With dead ends: 234 [2019-09-10 03:54:08,029 INFO L226 Difference]: Without dead ends: 234 [2019-09-10 03:54:08,030 INFO L628 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-09-10 03:54:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-10 03:54:08,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2019-09-10 03:54:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-10 03:54:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 336 transitions. [2019-09-10 03:54:08,043 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 336 transitions. Word has length 38 [2019-09-10 03:54:08,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:08,044 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 336 transitions. [2019-09-10 03:54:08,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:08,044 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 336 transitions. [2019-09-10 03:54:08,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 03:54:08,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:08,046 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:54:08,046 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:08,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1792772014, now seen corresponding path program 1 times [2019-09-10 03:54:08,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:08,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:08,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:54:08,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:08,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:08,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:08,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:08,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:08,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:08,126 INFO L87 Difference]: Start difference. First operand 230 states and 336 transitions. Second operand 4 states. [2019-09-10 03:54:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:08,143 INFO L93 Difference]: Finished difference Result 233 states and 338 transitions. [2019-09-10 03:54:08,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:08,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-09-10 03:54:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:08,146 INFO L225 Difference]: With dead ends: 233 [2019-09-10 03:54:08,146 INFO L226 Difference]: Without dead ends: 226 [2019-09-10 03:54:08,147 INFO L628 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-09-10 03:54:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-09-10 03:54:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2019-09-10 03:54:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-10 03:54:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2019-09-10 03:54:08,158 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 39 [2019-09-10 03:54:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:08,159 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2019-09-10 03:54:08,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2019-09-10 03:54:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 03:54:08,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:08,161 INFO L399 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-09-10 03:54:08,161 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:08,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:08,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1839866744, now seen corresponding path program 1 times [2019-09-10 03:54:08,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:08,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:54:08,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:08,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:08,212 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:08,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:08,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:08,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:08,213 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand 4 states. [2019-09-10 03:54:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:08,272 INFO L93 Difference]: Finished difference Result 245 states and 350 transitions. [2019-09-10 03:54:08,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:08,275 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-10 03:54:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:08,277 INFO L225 Difference]: With dead ends: 245 [2019-09-10 03:54:08,277 INFO L226 Difference]: Without dead ends: 245 [2019-09-10 03:54:08,278 INFO L628 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-09-10 03:54:08,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-10 03:54:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-09-10 03:54:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-10 03:54:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 346 transitions. [2019-09-10 03:54:08,292 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 346 transitions. Word has length 41 [2019-09-10 03:54:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:08,292 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 346 transitions. [2019-09-10 03:54:08,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 346 transitions. [2019-09-10 03:54:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 03:54:08,294 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:08,295 INFO L399 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-09-10 03:54:08,295 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:08,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:08,295 INFO L82 PathProgramCache]: Analyzing trace with hash 968772057, now seen corresponding path program 1 times [2019-09-10 03:54:08,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:08,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:08,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:08,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:54:08,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:08,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:08,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:08,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:08,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:08,362 INFO L87 Difference]: Start difference. First operand 242 states and 346 transitions. Second operand 4 states. [2019-09-10 03:54:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:08,416 INFO L93 Difference]: Finished difference Result 251 states and 358 transitions. [2019-09-10 03:54:08,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:08,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-09-10 03:54:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:08,421 INFO L225 Difference]: With dead ends: 251 [2019-09-10 03:54:08,422 INFO L226 Difference]: Without dead ends: 251 [2019-09-10 03:54:08,422 INFO L628 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-09-10 03:54:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-10 03:54:08,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-09-10 03:54:08,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-10 03:54:08,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 354 transitions. [2019-09-10 03:54:08,443 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 354 transitions. Word has length 41 [2019-09-10 03:54:08,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:08,444 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 354 transitions. [2019-09-10 03:54:08,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 354 transitions. [2019-09-10 03:54:08,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-10 03:54:08,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:08,448 INFO L399 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-09-10 03:54:08,448 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:08,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:08,449 INFO L82 PathProgramCache]: Analyzing trace with hash -966374096, now seen corresponding path program 1 times [2019-09-10 03:54:08,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:08,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:08,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-10 03:54:08,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:08,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:08,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:08,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:08,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:08,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:08,543 INFO L87 Difference]: Start difference. First operand 249 states and 354 transitions. Second operand 5 states. [2019-09-10 03:54:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:08,564 INFO L93 Difference]: Finished difference Result 255 states and 360 transitions. [2019-09-10 03:54:08,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:08,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-10 03:54:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:08,568 INFO L225 Difference]: With dead ends: 255 [2019-09-10 03:54:08,568 INFO L226 Difference]: Without dead ends: 251 [2019-09-10 03:54:08,568 INFO L628 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-09-10 03:54:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-10 03:54:08,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2019-09-10 03:54:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-09-10 03:54:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 353 transitions. [2019-09-10 03:54:08,580 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 353 transitions. Word has length 59 [2019-09-10 03:54:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:08,581 INFO L475 AbstractCegarLoop]: Abstraction has 249 states and 353 transitions. [2019-09-10 03:54:08,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 353 transitions. [2019-09-10 03:54:08,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-10 03:54:08,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:08,584 INFO L399 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-09-10 03:54:08,584 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:08,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:08,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1964020213, now seen corresponding path program 1 times [2019-09-10 03:54:08,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:08,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 03:54:08,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:08,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:08,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:08,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:08,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:08,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:08,671 INFO L87 Difference]: Start difference. First operand 249 states and 353 transitions. Second operand 4 states. [2019-09-10 03:54:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:08,724 INFO L93 Difference]: Finished difference Result 270 states and 377 transitions. [2019-09-10 03:54:08,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:08,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-10 03:54:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:08,727 INFO L225 Difference]: With dead ends: 270 [2019-09-10 03:54:08,727 INFO L226 Difference]: Without dead ends: 270 [2019-09-10 03:54:08,728 INFO L628 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-09-10 03:54:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-10 03:54:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-09-10 03:54:08,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-09-10 03:54:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 374 transitions. [2019-09-10 03:54:08,746 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 374 transitions. Word has length 62 [2019-09-10 03:54:08,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:08,746 INFO L475 AbstractCegarLoop]: Abstraction has 267 states and 374 transitions. [2019-09-10 03:54:08,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:08,746 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 374 transitions. [2019-09-10 03:54:08,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-10 03:54:08,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:08,749 INFO L399 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-09-10 03:54:08,749 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:08,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2021002903, now seen corresponding path program 1 times [2019-09-10 03:54:08,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:08,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:08,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 03:54:08,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:08,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:08,813 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:08,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:08,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:08,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:08,814 INFO L87 Difference]: Start difference. First operand 267 states and 374 transitions. Second operand 4 states. [2019-09-10 03:54:08,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:08,861 INFO L93 Difference]: Finished difference Result 261 states and 360 transitions. [2019-09-10 03:54:08,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:08,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-10 03:54:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:08,863 INFO L225 Difference]: With dead ends: 261 [2019-09-10 03:54:08,864 INFO L226 Difference]: Without dead ends: 261 [2019-09-10 03:54:08,864 INFO L628 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-09-10 03:54:08,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-10 03:54:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-09-10 03:54:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-10 03:54:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 360 transitions. [2019-09-10 03:54:08,873 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 360 transitions. Word has length 63 [2019-09-10 03:54:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:08,873 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 360 transitions. [2019-09-10 03:54:08,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 360 transitions. [2019-09-10 03:54:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 03:54:08,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:08,875 INFO L399 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-09-10 03:54:08,875 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:08,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1782318518, now seen corresponding path program 1 times [2019-09-10 03:54:08,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:08,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:08,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 03:54:08,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:08,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:08,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:08,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:08,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:08,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:08,936 INFO L87 Difference]: Start difference. First operand 261 states and 360 transitions. Second operand 5 states. [2019-09-10 03:54:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:08,960 INFO L93 Difference]: Finished difference Result 267 states and 365 transitions. [2019-09-10 03:54:08,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:08,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-10 03:54:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:08,963 INFO L225 Difference]: With dead ends: 267 [2019-09-10 03:54:08,963 INFO L226 Difference]: Without dead ends: 263 [2019-09-10 03:54:08,964 INFO L628 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-09-10 03:54:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-09-10 03:54:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2019-09-10 03:54:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-10 03:54:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 359 transitions. [2019-09-10 03:54:08,975 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 359 transitions. Word has length 82 [2019-09-10 03:54:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:08,975 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 359 transitions. [2019-09-10 03:54:08,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 359 transitions. [2019-09-10 03:54:08,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 03:54:08,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:08,977 INFO L399 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-09-10 03:54:08,977 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:08,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:08,977 INFO L82 PathProgramCache]: Analyzing trace with hash 77251503, now seen corresponding path program 1 times [2019-09-10 03:54:08,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:08,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:08,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:09,046 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-10 03:54:09,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:09,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:09,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:09,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:09,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:09,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:09,049 INFO L87 Difference]: Start difference. First operand 261 states and 359 transitions. Second operand 4 states. [2019-09-10 03:54:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:09,108 INFO L93 Difference]: Finished difference Result 259 states and 355 transitions. [2019-09-10 03:54:09,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:09,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-09-10 03:54:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:09,111 INFO L225 Difference]: With dead ends: 259 [2019-09-10 03:54:09,111 INFO L226 Difference]: Without dead ends: 259 [2019-09-10 03:54:09,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-09-10 03:54:09,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-09-10 03:54:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-09-10 03:54:09,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 355 transitions. [2019-09-10 03:54:09,121 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 355 transitions. Word has length 85 [2019-09-10 03:54:09,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:09,121 INFO L475 AbstractCegarLoop]: Abstraction has 259 states and 355 transitions. [2019-09-10 03:54:09,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:09,121 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 355 transitions. [2019-09-10 03:54:09,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 03:54:09,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:09,125 INFO L399 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-09-10 03:54:09,125 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:09,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:09,126 INFO L82 PathProgramCache]: Analyzing trace with hash -763139322, now seen corresponding path program 1 times [2019-09-10 03:54:09,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:09,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:09,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:09,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:09,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-10 03:54:09,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:54:09,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:54:09,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 101 with the following transitions: [2019-09-10 03:54:09,197 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], [377], [382], [387], [392], [434], [435], [436], [439], [441], [497], [537], [538], [539], [540], [541], [542], [543], [544], [551], [552], [553], [554], [555], [556], [559], [560], [561], [603], [607], [608], [609], [615] [2019-09-10 03:54:09,269 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:54:09,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:54:09,433 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:54:09,638 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:54:09,640 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-09-10 03:54:09,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:09,645 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:54:09,825 INFO L227 lantSequenceWeakener]: Weakened 77 states. On average, predicates are now at 93.62% of their original sizes. [2019-09-10 03:54:09,826 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:54:10,613 INFO L420 sIntCurrentIteration]: We unified 99 AI predicates to 99 [2019-09-10 03:54:10,613 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:54:10,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:54:10,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [4] total 37 [2019-09-10 03:54:10,614 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:10,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 03:54:10,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 03:54:10,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:54:10,616 INFO L87 Difference]: Start difference. First operand 259 states and 355 transitions. Second operand 35 states. [2019-09-10 03:54:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:22,601 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2019-09-10 03:54:22,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-10 03:54:22,601 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2019-09-10 03:54:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:22,605 INFO L225 Difference]: With dead ends: 375 [2019-09-10 03:54:22,605 INFO L226 Difference]: Without dead ends: 375 [2019-09-10 03:54:22,608 INFO L628 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-09-10 03:54:22,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-09-10 03:54:22,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 307. [2019-09-10 03:54:22,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-10 03:54:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 405 transitions. [2019-09-10 03:54:22,622 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 405 transitions. Word has length 100 [2019-09-10 03:54:22,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:22,623 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 405 transitions. [2019-09-10 03:54:22,623 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 03:54:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 405 transitions. [2019-09-10 03:54:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-10 03:54:22,624 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:22,625 INFO L399 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-09-10 03:54:22,625 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash -267545431, now seen corresponding path program 1 times [2019-09-10 03:54:22,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:22,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:22,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-09-10 03:54:22,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:22,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:54:22,696 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:22,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:54:22,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:54:22,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:22,698 INFO L87 Difference]: Start difference. First operand 307 states and 405 transitions. Second operand 5 states. [2019-09-10 03:54:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:22,749 INFO L93 Difference]: Finished difference Result 311 states and 408 transitions. [2019-09-10 03:54:22,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:22,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-10 03:54:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:22,752 INFO L225 Difference]: With dead ends: 311 [2019-09-10 03:54:22,752 INFO L226 Difference]: Without dead ends: 307 [2019-09-10 03:54:22,753 INFO L628 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-09-10 03:54:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-10 03:54:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-09-10 03:54:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-09-10 03:54:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 400 transitions. [2019-09-10 03:54:22,763 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 400 transitions. Word has length 144 [2019-09-10 03:54:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:22,764 INFO L475 AbstractCegarLoop]: Abstraction has 307 states and 400 transitions. [2019-09-10 03:54:22,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:54:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 400 transitions. [2019-09-10 03:54:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-10 03:54:22,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:22,769 INFO L399 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-09-10 03:54:22,770 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:22,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:22,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1981470506, now seen corresponding path program 1 times [2019-09-10 03:54:22,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:22,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:22,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:22,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 72 proven. 8 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-09-10 03:54:22,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:54:22,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:54:22,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 154 with the following transitions: [2019-09-10 03:54:22,858 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], [377], [382], [387], [392], [434], [435], [436], [439], [441], [497], [537], [538], [539], [540], [541], [542], [543], [544], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [603], [607], [608], [609], [615] [2019-09-10 03:54:22,865 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:54:22,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:54:22,888 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:54:23,020 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:54:23,020 INFO L272 AbstractInterpreter]: Visited 77 different actions 269 times. Merged at 21 different actions 64 times. Never widened. Performed 1254 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1254 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 4 fixpoints after 1 different actions. Largest state had 89 variables. [2019-09-10 03:54:23,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:23,021 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:54:23,207 INFO L227 lantSequenceWeakener]: Weakened 145 states. On average, predicates are now at 90.81% of their original sizes. [2019-09-10 03:54:23,207 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:54:24,650 INFO L420 sIntCurrentIteration]: We unified 152 AI predicates to 152 [2019-09-10 03:54:24,650 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:54:24,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:54:24,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [5] total 60 [2019-09-10 03:54:24,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:24,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 03:54:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 03:54:24,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=2893, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 03:54:24,654 INFO L87 Difference]: Start difference. First operand 307 states and 400 transitions. Second operand 57 states. [2019-09-10 03:54:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:45,887 INFO L93 Difference]: Finished difference Result 491 states and 661 transitions. [2019-09-10 03:54:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 03:54:45,888 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 153 [2019-09-10 03:54:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:45,891 INFO L225 Difference]: With dead ends: 491 [2019-09-10 03:54:45,891 INFO L226 Difference]: Without dead ends: 491 [2019-09-10 03:54:45,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=721, Invalid=8981, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 03:54:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-09-10 03:54:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 462. [2019-09-10 03:54:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-09-10 03:54:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 619 transitions. [2019-09-10 03:54:45,909 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 619 transitions. Word has length 153 [2019-09-10 03:54:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:45,910 INFO L475 AbstractCegarLoop]: Abstraction has 462 states and 619 transitions. [2019-09-10 03:54:45,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-10 03:54:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 619 transitions. [2019-09-10 03:54:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 03:54:45,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:45,912 INFO L399 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-09-10 03:54:45,913 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:45,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:45,913 INFO L82 PathProgramCache]: Analyzing trace with hash -243298260, now seen corresponding path program 1 times [2019-09-10 03:54:45,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:45,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:45,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:45,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:45,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-10 03:54:45,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:45,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:45,997 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:45,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:45,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:45,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:45,998 INFO L87 Difference]: Start difference. First operand 462 states and 619 transitions. Second operand 4 states. [2019-09-10 03:54:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:46,027 INFO L93 Difference]: Finished difference Result 476 states and 631 transitions. [2019-09-10 03:54:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:46,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-10 03:54:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:46,031 INFO L225 Difference]: With dead ends: 476 [2019-09-10 03:54:46,031 INFO L226 Difference]: Without dead ends: 476 [2019-09-10 03:54:46,031 INFO L628 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-09-10 03:54:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-09-10 03:54:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 472. [2019-09-10 03:54:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-09-10 03:54:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 627 transitions. [2019-09-10 03:54:46,052 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 627 transitions. Word has length 173 [2019-09-10 03:54:46,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:46,053 INFO L475 AbstractCegarLoop]: Abstraction has 472 states and 627 transitions. [2019-09-10 03:54:46,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:46,053 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 627 transitions. [2019-09-10 03:54:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-10 03:54:46,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:46,055 INFO L399 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-09-10 03:54:46,055 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:46,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:46,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1314652604, now seen corresponding path program 1 times [2019-09-10 03:54:46,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:46,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:46,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:46,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:46,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-10 03:54:46,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:46,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:46,162 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:46,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:46,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:46,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:46,163 INFO L87 Difference]: Start difference. First operand 472 states and 627 transitions. Second operand 4 states. [2019-09-10 03:54:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:46,190 INFO L93 Difference]: Finished difference Result 470 states and 617 transitions. [2019-09-10 03:54:46,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:46,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-09-10 03:54:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:46,193 INFO L225 Difference]: With dead ends: 470 [2019-09-10 03:54:46,193 INFO L226 Difference]: Without dead ends: 470 [2019-09-10 03:54:46,196 INFO L628 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-09-10 03:54:46,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-10 03:54:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2019-09-10 03:54:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2019-09-10 03:54:46,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 617 transitions. [2019-09-10 03:54:46,209 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 617 transitions. Word has length 186 [2019-09-10 03:54:46,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:46,210 INFO L475 AbstractCegarLoop]: Abstraction has 470 states and 617 transitions. [2019-09-10 03:54:46,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 617 transitions. [2019-09-10 03:54:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-10 03:54:46,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:46,212 INFO L399 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-09-10 03:54:46,212 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:46,213 INFO L82 PathProgramCache]: Analyzing trace with hash 507025156, now seen corresponding path program 1 times [2019-09-10 03:54:46,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:46,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:46,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-10 03:54:46,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:46,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:46,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:46,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:46,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:46,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:46,303 INFO L87 Difference]: Start difference. First operand 470 states and 617 transitions. Second operand 4 states. [2019-09-10 03:54:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:46,318 INFO L93 Difference]: Finished difference Result 374 states and 474 transitions. [2019-09-10 03:54:46,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:46,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2019-09-10 03:54:46,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:46,323 INFO L225 Difference]: With dead ends: 374 [2019-09-10 03:54:46,323 INFO L226 Difference]: Without dead ends: 374 [2019-09-10 03:54:46,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:54:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-10 03:54:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 369. [2019-09-10 03:54:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-10 03:54:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 466 transitions. [2019-09-10 03:54:46,334 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 466 transitions. Word has length 199 [2019-09-10 03:54:46,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:46,335 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 466 transitions. [2019-09-10 03:54:46,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:46,336 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 466 transitions. [2019-09-10 03:54:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-10 03:54:46,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:46,338 INFO L399 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-09-10 03:54:46,338 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:46,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:46,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1935753462, now seen corresponding path program 1 times [2019-09-10 03:54:46,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:46,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:46,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:46,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:46,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-10 03:54:46,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:46,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:46,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:46,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:46,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:46,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:46,480 INFO L87 Difference]: Start difference. First operand 369 states and 466 transitions. Second operand 4 states. [2019-09-10 03:54:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:46,834 INFO L93 Difference]: Finished difference Result 684 states and 893 transitions. [2019-09-10 03:54:46,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:54:46,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-09-10 03:54:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:46,843 INFO L225 Difference]: With dead ends: 684 [2019-09-10 03:54:46,844 INFO L226 Difference]: Without dead ends: 684 [2019-09-10 03:54:46,844 INFO L628 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-09-10 03:54:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-09-10 03:54:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 481. [2019-09-10 03:54:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2019-09-10 03:54:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 632 transitions. [2019-09-10 03:54:46,880 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 632 transitions. Word has length 201 [2019-09-10 03:54:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:46,884 INFO L475 AbstractCegarLoop]: Abstraction has 481 states and 632 transitions. [2019-09-10 03:54:46,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 632 transitions. [2019-09-10 03:54:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 03:54:46,890 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:46,891 INFO L399 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-09-10 03:54:46,891 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:46,892 INFO L82 PathProgramCache]: Analyzing trace with hash -833946183, now seen corresponding path program 1 times [2019-09-10 03:54:46,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:46,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:46,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:46,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:46,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:47,047 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-10 03:54:47,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:47,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:47,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:47,048 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:47,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:47,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:47,049 INFO L87 Difference]: Start difference. First operand 481 states and 632 transitions. Second operand 4 states. [2019-09-10 03:54:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:47,237 INFO L93 Difference]: Finished difference Result 819 states and 1100 transitions. [2019-09-10 03:54:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:47,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-09-10 03:54:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:47,245 INFO L225 Difference]: With dead ends: 819 [2019-09-10 03:54:47,246 INFO L226 Difference]: Without dead ends: 819 [2019-09-10 03:54:47,246 INFO L628 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-09-10 03:54:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-09-10 03:54:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 804. [2019-09-10 03:54:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-09-10 03:54:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1081 transitions. [2019-09-10 03:54:47,271 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1081 transitions. Word has length 236 [2019-09-10 03:54:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:47,271 INFO L475 AbstractCegarLoop]: Abstraction has 804 states and 1081 transitions. [2019-09-10 03:54:47,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1081 transitions. [2019-09-10 03:54:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:54:47,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:47,277 INFO L399 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-09-10 03:54:47,277 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:47,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:47,278 INFO L82 PathProgramCache]: Analyzing trace with hash -758669803, now seen corresponding path program 1 times [2019-09-10 03:54:47,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:47,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:47,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:47,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:47,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-10 03:54:47,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:47,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:47,397 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:47,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:47,398 INFO L87 Difference]: Start difference. First operand 804 states and 1081 transitions. Second operand 4 states. [2019-09-10 03:54:47,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:47,609 INFO L93 Difference]: Finished difference Result 1474 states and 2014 transitions. [2019-09-10 03:54:47,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:47,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-09-10 03:54:47,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:47,619 INFO L225 Difference]: With dead ends: 1474 [2019-09-10 03:54:47,619 INFO L226 Difference]: Without dead ends: 1474 [2019-09-10 03:54:47,619 INFO L628 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-09-10 03:54:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2019-09-10 03:54:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1111. [2019-09-10 03:54:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-09-10 03:54:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1509 transitions. [2019-09-10 03:54:47,662 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1509 transitions. Word has length 237 [2019-09-10 03:54:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:47,663 INFO L475 AbstractCegarLoop]: Abstraction has 1111 states and 1509 transitions. [2019-09-10 03:54:47,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1509 transitions. [2019-09-10 03:54:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 03:54:47,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:47,668 INFO L399 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-09-10 03:54:47,668 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:47,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1887576620, now seen corresponding path program 1 times [2019-09-10 03:54:47,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:47,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:47,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:47,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:47,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-09-10 03:54:47,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:54:47,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:54:47,765 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:47,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:54:47,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:54:47,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:54:47,766 INFO L87 Difference]: Start difference. First operand 1111 states and 1509 transitions. Second operand 4 states. [2019-09-10 03:54:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:54:47,987 INFO L93 Difference]: Finished difference Result 2115 states and 2909 transitions. [2019-09-10 03:54:47,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:54:47,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-09-10 03:54:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:54:48,001 INFO L225 Difference]: With dead ends: 2115 [2019-09-10 03:54:48,001 INFO L226 Difference]: Without dead ends: 2115 [2019-09-10 03:54:48,002 INFO L628 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-09-10 03:54:48,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2019-09-10 03:54:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1401. [2019-09-10 03:54:48,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-09-10 03:54:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1915 transitions. [2019-09-10 03:54:48,059 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1915 transitions. Word has length 238 [2019-09-10 03:54:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:54:48,059 INFO L475 AbstractCegarLoop]: Abstraction has 1401 states and 1915 transitions. [2019-09-10 03:54:48,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:54:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1915 transitions. [2019-09-10 03:54:48,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 03:54:48,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:54:48,065 INFO L399 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-09-10 03:54:48,065 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:54:48,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:48,066 INFO L82 PathProgramCache]: Analyzing trace with hash 163407378, now seen corresponding path program 1 times [2019-09-10 03:54:48,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:54:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:48,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:54:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:54:48,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:54:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:54:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-09-10 03:54:48,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:54:48,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:54:48,172 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 239 with the following transitions: [2019-09-10 03:54:48,172 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], [216], [221], [226], [231], [233], [235], [307], [310], [343], [346], [373], [375], [376], [377], [380], [382], [385], [387], [390], [395], [396], [400], [405], [407], [433], [434], [435], [436], [439], [441], [450], [453], [496], [497], [501], [506], [508], [534], [535], [536], [537], [538], [539], [540], [541], [542], [543], [544], [551], [552], [553], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [564], [565], [566], [567], [568], [569], [570], [571], [573], [574], [585], [586], [595], [596], [605], [606], [607], [608], [609], [613], [614], [615], [616] [2019-09-10 03:54:48,176 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:54:48,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:54:48,191 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 03:54:48,384 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:54:48,385 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-09-10 03:54:48,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:54:48,386 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:54:48,609 INFO L227 lantSequenceWeakener]: Weakened 208 states. On average, predicates are now at 84.42% of their original sizes. [2019-09-10 03:54:48,609 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:54:52,213 INFO L420 sIntCurrentIteration]: We unified 237 AI predicates to 237 [2019-09-10 03:54:52,213 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:54:52,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:54:52,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [77] imperfect sequences [7] total 82 [2019-09-10 03:54:52,214 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:54:52,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 03:54:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 03:54:52,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=5431, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 03:54:52,219 INFO L87 Difference]: Start difference. First operand 1401 states and 1915 transitions. Second operand 77 states. [2019-09-10 03:55:03,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-10 03:55:03,315 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:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) 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-09-10 03:55:03,321 INFO L168 Benchmark]: Toolchain (without parser) took 58151.79 ms. Allocated memory was 132.1 MB in the beginning and 801.6 MB in the end (delta: 669.5 MB). Free memory was 87.6 MB in the beginning and 159.4 MB in the end (delta: -71.8 MB). Peak memory consumption was 597.7 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:03,322 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 132.1 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:55:03,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 528.09 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 87.2 MB in the beginning and 169.7 MB in the end (delta: -82.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:03,323 INFO L168 Benchmark]: Boogie Preprocessor took 101.87 ms. Allocated memory is still 198.7 MB. Free memory was 169.7 MB in the beginning and 166.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:03,324 INFO L168 Benchmark]: RCFGBuilder took 937.64 ms. Allocated memory is still 198.7 MB. Free memory was 166.8 MB in the beginning and 112.7 MB in the end (delta: 54.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:03,325 INFO L168 Benchmark]: TraceAbstraction took 56580.35 ms. Allocated memory was 198.7 MB in the beginning and 801.6 MB in the end (delta: 602.9 MB). Free memory was 112.7 MB in the beginning and 159.4 MB in the end (delta: -46.7 MB). Peak memory consumption was 556.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:55:03,329 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 132.1 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 528.09 ms. Allocated memory was 132.1 MB in the beginning and 198.7 MB in the end (delta: 66.6 MB). Free memory was 87.2 MB in the beginning and 169.7 MB in the end (delta: -82.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 101.87 ms. Allocated memory is still 198.7 MB. Free memory was 169.7 MB in the beginning and 166.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 937.64 ms. Allocated memory is still 198.7 MB. Free memory was 166.8 MB in the beginning and 112.7 MB in the end (delta: 54.2 MB). Peak memory consumption was 54.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56580.35 ms. Allocated memory was 198.7 MB in the beginning and 801.6 MB in the end (delta: 602.9 MB). Free memory was 112.7 MB in the beginning and 159.4 MB in the end (delta: -46.7 MB). Peak memory consumption was 556.2 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...