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/systemc/token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:22:34,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:22:34,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:22:34,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:22:34,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:22:34,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:22:34,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:22:34,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:22:34,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:22:34,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:22:34,951 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:22:34,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:22:34,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:22:34,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:22:34,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:22:34,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:22:34,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:22:34,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:22:34,960 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:22:34,962 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:22:34,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:22:34,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:22:34,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:22:34,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:22:34,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:22:34,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:22:34,970 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:22:34,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:22:34,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:22:34,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:22:34,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:22:34,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:22:34,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:22:34,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:22:34,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:22:34,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:22:34,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:22:34,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:22:34,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:22:34,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:22:34,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:22:34,980 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:22:34,996 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:22:34,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:22:34,997 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:22:34,997 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:22:34,997 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:22:34,998 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:22:34,998 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:22:34,998 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:22:34,998 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:22:34,998 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:22:34,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:22:34,999 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:22:35,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:22:35,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:22:35,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:22:35,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:22:35,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:22:35,001 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:22:35,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:22:35,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:22:35,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:22:35,001 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:22:35,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:22:35,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:22:35,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:22:35,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:22:35,003 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:22:35,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:22:35,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:22:35,003 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:22:35,032 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:22:35,045 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:22:35,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:22:35,050 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:22:35,050 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:22:35,051 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-09-10 03:22:35,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994b14421/178f74c3ba924b0cadd4c5bf91635ca8/FLAG1e0d77204 [2019-09-10 03:22:35,553 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:22:35,554 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.03.cil-2.c [2019-09-10 03:22:35,565 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994b14421/178f74c3ba924b0cadd4c5bf91635ca8/FLAG1e0d77204 [2019-09-10 03:22:35,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/994b14421/178f74c3ba924b0cadd4c5bf91635ca8 [2019-09-10 03:22:35,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:22:35,962 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:22:35,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:22:35,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:22:35,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:22:35,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:22:35" (1/1) ... [2019-09-10 03:22:35,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@89f1d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:35, skipping insertion in model container [2019-09-10 03:22:35,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:22:35" (1/1) ... [2019-09-10 03:22:35,980 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:22:36,045 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:22:36,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:22:36,328 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:22:36,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:22:36,494 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:22:36,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:36 WrapperNode [2019-09-10 03:22:36,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:22:36,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:22:36,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:22:36,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:22:36,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:36" (1/1) ... [2019-09-10 03:22:36,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:36" (1/1) ... [2019-09-10 03:22:36,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:36" (1/1) ... [2019-09-10 03:22:36,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:36" (1/1) ... [2019-09-10 03:22:36,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:36" (1/1) ... [2019-09-10 03:22:36,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:36" (1/1) ... [2019-09-10 03:22:36,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:36" (1/1) ... [2019-09-10 03:22:36,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:22:36,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:22:36,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:22:36,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:22:36,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:36" (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:22:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:22:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:22:36,604 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:22:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:22:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:22:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:22:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:22:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:22:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:22:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:22:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:22:36,605 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:22:36,606 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:22:36,606 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:22:36,606 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:22:36,606 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:22:36,606 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:22:36,606 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:22:36,607 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:22:36,607 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:22:36,607 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:22:36,607 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:22:36,607 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:22:36,607 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:22:36,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:22:36,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:22:36,608 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:22:36,608 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:22:36,608 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:22:36,608 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:22:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:22:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:22:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:22:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:22:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:22:36,609 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:22:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:22:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:22:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:22:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:22:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:22:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:22:36,610 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:22:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:22:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:22:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:22:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:22:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:22:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:22:36,611 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:22:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:22:36,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:22:37,298 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:22:37,299 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-09-10 03:22:37,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:22:37 BoogieIcfgContainer [2019-09-10 03:22:37,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:22:37,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:22:37,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:22:37,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:22:37,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:22:35" (1/3) ... [2019-09-10 03:22:37,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a15a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:22:37, skipping insertion in model container [2019-09-10 03:22:37,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:22:36" (2/3) ... [2019-09-10 03:22:37,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a15a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:22:37, skipping insertion in model container [2019-09-10 03:22:37,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:22:37" (3/3) ... [2019-09-10 03:22:37,312 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-2.c [2019-09-10 03:22:37,323 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:22:37,345 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:22:37,363 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:22:37,391 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:22:37,392 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:22:37,392 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:22:37,392 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:22:37,392 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:22:37,393 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:22:37,393 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:22:37,393 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:22:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states. [2019-09-10 03:22:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:37,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:37,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:22:37,451 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:37,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:37,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1386466573, now seen corresponding path program 1 times [2019-09-10 03:22:37,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:37,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:37,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:37,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:37,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:37,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:22:37,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:37,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:37,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:37,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:37,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:37,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:37,919 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 5 states. [2019-09-10 03:22:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:38,624 INFO L93 Difference]: Finished difference Result 241 states and 340 transitions. [2019-09-10 03:22:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:22:38,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:38,646 INFO L225 Difference]: With dead ends: 241 [2019-09-10 03:22:38,647 INFO L226 Difference]: Without dead ends: 229 [2019-09-10 03:22:38,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-10 03:22:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 195. [2019-09-10 03:22:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-10 03:22:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 268 transitions. [2019-09-10 03:22:38,720 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 268 transitions. Word has length 105 [2019-09-10 03:22:38,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:38,721 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 268 transitions. [2019-09-10 03:22:38,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 268 transitions. [2019-09-10 03:22:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:38,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:38,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:38,726 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:38,726 INFO L82 PathProgramCache]: Analyzing trace with hash 180291377, now seen corresponding path program 1 times [2019-09-10 03:22:38,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:38,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:38,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:38,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:38,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:38,929 INFO L134 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:22:38,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:38,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:38,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:38,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:38,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:38,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:38,937 INFO L87 Difference]: Start difference. First operand 195 states and 268 transitions. Second operand 5 states. [2019-09-10 03:22:39,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:39,468 INFO L93 Difference]: Finished difference Result 229 states and 327 transitions. [2019-09-10 03:22:39,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:22:39,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:39,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:39,473 INFO L225 Difference]: With dead ends: 229 [2019-09-10 03:22:39,473 INFO L226 Difference]: Without dead ends: 229 [2019-09-10 03:22:39,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:39,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-10 03:22:39,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 195. [2019-09-10 03:22:39,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-10 03:22:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 267 transitions. [2019-09-10 03:22:39,493 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 267 transitions. Word has length 105 [2019-09-10 03:22:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:39,494 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 267 transitions. [2019-09-10 03:22:39,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:39,494 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 267 transitions. [2019-09-10 03:22:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:39,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:39,497 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:22:39,497 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:39,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash -877546701, now seen corresponding path program 1 times [2019-09-10 03:22:39,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:39,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:39,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:39,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:39,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:39,600 INFO L134 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:22:39,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:39,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:39,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:39,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:39,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:39,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:39,602 INFO L87 Difference]: Start difference. First operand 195 states and 267 transitions. Second operand 5 states. [2019-09-10 03:22:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:40,049 INFO L93 Difference]: Finished difference Result 227 states and 322 transitions. [2019-09-10 03:22:40,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:22:40,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:40,052 INFO L225 Difference]: With dead ends: 227 [2019-09-10 03:22:40,053 INFO L226 Difference]: Without dead ends: 227 [2019-09-10 03:22:40,053 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:40,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-10 03:22:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 195. [2019-09-10 03:22:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-10 03:22:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 266 transitions. [2019-09-10 03:22:40,070 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 266 transitions. Word has length 105 [2019-09-10 03:22:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:40,071 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 266 transitions. [2019-09-10 03:22:40,071 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 266 transitions. [2019-09-10 03:22:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:40,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:40,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:40,076 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2020049167, now seen corresponding path program 1 times [2019-09-10 03:22:40,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:40,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:40,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:40,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:40,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:40,224 INFO L134 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:22:40,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:40,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:40,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:40,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:40,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:40,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:40,226 INFO L87 Difference]: Start difference. First operand 195 states and 266 transitions. Second operand 5 states. [2019-09-10 03:22:40,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:40,703 INFO L93 Difference]: Finished difference Result 245 states and 351 transitions. [2019-09-10 03:22:40,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:22:40,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:40,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:40,706 INFO L225 Difference]: With dead ends: 245 [2019-09-10 03:22:40,707 INFO L226 Difference]: Without dead ends: 245 [2019-09-10 03:22:40,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-09-10 03:22:40,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 195. [2019-09-10 03:22:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-10 03:22:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 265 transitions. [2019-09-10 03:22:40,723 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 265 transitions. Word has length 105 [2019-09-10 03:22:40,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:40,723 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 265 transitions. [2019-09-10 03:22:40,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 265 transitions. [2019-09-10 03:22:40,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:40,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:40,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:40,726 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:40,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:40,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1181015505, now seen corresponding path program 1 times [2019-09-10 03:22:40,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:40,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:40,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:40,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:40,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:40,792 INFO L134 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:22:40,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:40,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:40,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:40,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:40,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:40,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:40,794 INFO L87 Difference]: Start difference. First operand 195 states and 265 transitions. Second operand 5 states. [2019-09-10 03:22:41,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:41,217 INFO L93 Difference]: Finished difference Result 239 states and 341 transitions. [2019-09-10 03:22:41,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:22:41,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:41,220 INFO L225 Difference]: With dead ends: 239 [2019-09-10 03:22:41,220 INFO L226 Difference]: Without dead ends: 239 [2019-09-10 03:22:41,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:41,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-09-10 03:22:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 195. [2019-09-10 03:22:41,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-10 03:22:41,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 264 transitions. [2019-09-10 03:22:41,233 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 264 transitions. Word has length 105 [2019-09-10 03:22:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:41,233 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 264 transitions. [2019-09-10 03:22:41,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:41,234 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 264 transitions. [2019-09-10 03:22:41,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:41,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:41,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:22:41,236 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:41,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:41,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1153949903, now seen corresponding path program 1 times [2019-09-10 03:22:41,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:41,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:41,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:41,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:41,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:41,347 INFO L134 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:22:41,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:41,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:41,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:41,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:41,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:41,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:41,351 INFO L87 Difference]: Start difference. First operand 195 states and 264 transitions. Second operand 5 states. [2019-09-10 03:22:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:41,769 INFO L93 Difference]: Finished difference Result 241 states and 341 transitions. [2019-09-10 03:22:41,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:22:41,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:41,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:41,772 INFO L225 Difference]: With dead ends: 241 [2019-09-10 03:22:41,772 INFO L226 Difference]: Without dead ends: 241 [2019-09-10 03:22:41,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:41,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-10 03:22:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 195. [2019-09-10 03:22:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-10 03:22:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 263 transitions. [2019-09-10 03:22:41,783 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 263 transitions. Word has length 105 [2019-09-10 03:22:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:41,783 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 263 transitions. [2019-09-10 03:22:41,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 263 transitions. [2019-09-10 03:22:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:41,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:41,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:41,786 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:41,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1063680495, now seen corresponding path program 1 times [2019-09-10 03:22:41,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:41,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:41,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:41,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:41,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:41,843 INFO L134 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:22:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:41,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:41,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:41,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:41,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:41,845 INFO L87 Difference]: Start difference. First operand 195 states and 263 transitions. Second operand 5 states. [2019-09-10 03:22:42,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:42,289 INFO L93 Difference]: Finished difference Result 239 states and 336 transitions. [2019-09-10 03:22:42,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:22:42,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:42,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:42,295 INFO L225 Difference]: With dead ends: 239 [2019-09-10 03:22:42,295 INFO L226 Difference]: Without dead ends: 239 [2019-09-10 03:22:42,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-09-10 03:22:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 195. [2019-09-10 03:22:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-10 03:22:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 262 transitions. [2019-09-10 03:22:42,306 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 262 transitions. Word has length 105 [2019-09-10 03:22:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:42,306 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 262 transitions. [2019-09-10 03:22:42,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 262 transitions. [2019-09-10 03:22:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:42,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:42,312 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:42,313 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:42,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1497182351, now seen corresponding path program 1 times [2019-09-10 03:22:42,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:42,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:42,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:42,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:42,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:42,375 INFO L134 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:22:42,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:42,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:22:42,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:42,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:22:42,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:22:42,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:42,377 INFO L87 Difference]: Start difference. First operand 195 states and 262 transitions. Second operand 6 states. [2019-09-10 03:22:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:42,412 INFO L93 Difference]: Finished difference Result 211 states and 287 transitions. [2019-09-10 03:22:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:22:42,413 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-10 03:22:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:42,415 INFO L225 Difference]: With dead ends: 211 [2019-09-10 03:22:42,415 INFO L226 Difference]: Without dead ends: 211 [2019-09-10 03:22:42,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:22:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-10 03:22:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 200. [2019-09-10 03:22:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-10 03:22:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 267 transitions. [2019-09-10 03:22:42,427 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 267 transitions. Word has length 105 [2019-09-10 03:22:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:42,427 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 267 transitions. [2019-09-10 03:22:42,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:22:42,427 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 267 transitions. [2019-09-10 03:22:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:42,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:42,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:42,429 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash -817910097, now seen corresponding path program 1 times [2019-09-10 03:22:42,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:42,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:42,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:42,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:42,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:42,495 INFO L134 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:22:42,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:42,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:22:42,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:42,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:22:42,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:22:42,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:42,497 INFO L87 Difference]: Start difference. First operand 200 states and 267 transitions. Second operand 6 states. [2019-09-10 03:22:42,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:42,538 INFO L93 Difference]: Finished difference Result 213 states and 287 transitions. [2019-09-10 03:22:42,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:22:42,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-10 03:22:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:42,543 INFO L225 Difference]: With dead ends: 213 [2019-09-10 03:22:42,543 INFO L226 Difference]: Without dead ends: 213 [2019-09-10 03:22:42,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:22:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-09-10 03:22:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2019-09-10 03:22:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-09-10 03:22:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 272 transitions. [2019-09-10 03:22:42,551 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 272 transitions. Word has length 105 [2019-09-10 03:22:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:42,552 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 272 transitions. [2019-09-10 03:22:42,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:22:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 272 transitions. [2019-09-10 03:22:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:42,554 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:42,554 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:42,554 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:42,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash -374009423, now seen corresponding path program 1 times [2019-09-10 03:22:42,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:42,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:42,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:42,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:22:42,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:42,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:22:42,609 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:42,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:22:42,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:22:42,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:42,610 INFO L87 Difference]: Start difference. First operand 205 states and 272 transitions. Second operand 6 states. [2019-09-10 03:22:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:42,639 INFO L93 Difference]: Finished difference Result 215 states and 287 transitions. [2019-09-10 03:22:42,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:22:42,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-10 03:22:42,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:42,642 INFO L225 Difference]: With dead ends: 215 [2019-09-10 03:22:42,642 INFO L226 Difference]: Without dead ends: 215 [2019-09-10 03:22:42,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:22:42,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-10 03:22:42,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 210. [2019-09-10 03:22:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-10 03:22:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 277 transitions. [2019-09-10 03:22:42,651 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 277 transitions. Word has length 105 [2019-09-10 03:22:42,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:42,651 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 277 transitions. [2019-09-10 03:22:42,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:22:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 277 transitions. [2019-09-10 03:22:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:42,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:42,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:22:42,653 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:42,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:42,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1871570031, now seen corresponding path program 1 times [2019-09-10 03:22:42,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:42,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:42,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:42,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:42,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:22:42,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:42,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:22:42,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:42,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:22:42,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:22:42,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:42,715 INFO L87 Difference]: Start difference. First operand 210 states and 277 transitions. Second operand 6 states. [2019-09-10 03:22:42,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:42,739 INFO L93 Difference]: Finished difference Result 217 states and 287 transitions. [2019-09-10 03:22:42,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:22:42,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-10 03:22:42,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:42,741 INFO L225 Difference]: With dead ends: 217 [2019-09-10 03:22:42,741 INFO L226 Difference]: Without dead ends: 217 [2019-09-10 03:22:42,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:22:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-10 03:22:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2019-09-10 03:22:42,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-10 03:22:42,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 282 transitions. [2019-09-10 03:22:42,749 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 282 transitions. Word has length 105 [2019-09-10 03:22:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:42,750 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 282 transitions. [2019-09-10 03:22:42,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:22:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 282 transitions. [2019-09-10 03:22:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:42,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:42,752 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:42,752 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:42,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1027564529, now seen corresponding path program 1 times [2019-09-10 03:22:42,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:42,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:42,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:42,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:42,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:22:42,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:42,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:42,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:42,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:42,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:42,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:42,851 INFO L87 Difference]: Start difference. First operand 215 states and 282 transitions. Second operand 5 states. [2019-09-10 03:22:43,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:43,324 INFO L93 Difference]: Finished difference Result 303 states and 396 transitions. [2019-09-10 03:22:43,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:22:43,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:43,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:43,327 INFO L225 Difference]: With dead ends: 303 [2019-09-10 03:22:43,327 INFO L226 Difference]: Without dead ends: 303 [2019-09-10 03:22:43,328 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:22:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-09-10 03:22:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 278. [2019-09-10 03:22:43,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-10 03:22:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 355 transitions. [2019-09-10 03:22:43,340 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 355 transitions. Word has length 105 [2019-09-10 03:22:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:43,341 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 355 transitions. [2019-09-10 03:22:43,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:43,341 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 355 transitions. [2019-09-10 03:22:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:43,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:43,342 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:43,343 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1729164403, now seen corresponding path program 1 times [2019-09-10 03:22:43,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:43,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:43,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:43,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:43,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:43,420 INFO L134 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:22:43,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:43,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:43,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:43,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:43,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:43,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:43,422 INFO L87 Difference]: Start difference. First operand 278 states and 355 transitions. Second operand 5 states. [2019-09-10 03:22:43,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:43,825 INFO L93 Difference]: Finished difference Result 278 states and 353 transitions. [2019-09-10 03:22:43,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:22:43,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:43,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:43,828 INFO L225 Difference]: With dead ends: 278 [2019-09-10 03:22:43,828 INFO L226 Difference]: Without dead ends: 278 [2019-09-10 03:22:43,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-10 03:22:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-09-10 03:22:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-10 03:22:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 353 transitions. [2019-09-10 03:22:43,841 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 353 transitions. Word has length 105 [2019-09-10 03:22:43,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:43,841 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 353 transitions. [2019-09-10 03:22:43,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:43,842 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 353 transitions. [2019-09-10 03:22:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:43,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:43,844 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:43,844 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:43,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1751796657, now seen corresponding path program 1 times [2019-09-10 03:22:43,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:43,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:43,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:43,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:43,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:43,933 INFO L134 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:22:43,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:43,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:43,934 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:43,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:43,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:43,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:43,936 INFO L87 Difference]: Start difference. First operand 278 states and 353 transitions. Second operand 5 states. [2019-09-10 03:22:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:44,335 INFO L93 Difference]: Finished difference Result 278 states and 351 transitions. [2019-09-10 03:22:44,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:22:44,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:44,338 INFO L225 Difference]: With dead ends: 278 [2019-09-10 03:22:44,339 INFO L226 Difference]: Without dead ends: 278 [2019-09-10 03:22:44,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:22:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-09-10 03:22:44,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-09-10 03:22:44,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-10 03:22:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 351 transitions. [2019-09-10 03:22:44,358 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 351 transitions. Word has length 105 [2019-09-10 03:22:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:44,359 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 351 transitions. [2019-09-10 03:22:44,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 351 transitions. [2019-09-10 03:22:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:44,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:44,362 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:44,362 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:44,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1156967245, now seen corresponding path program 1 times [2019-09-10 03:22:44,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:44,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:44,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:44,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:22:44,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:44,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:44,453 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:44,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:44,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:44,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:44,454 INFO L87 Difference]: Start difference. First operand 278 states and 351 transitions. Second operand 5 states. [2019-09-10 03:22:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:44,973 INFO L93 Difference]: Finished difference Result 379 states and 484 transitions. [2019-09-10 03:22:44,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:22:44,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:44,977 INFO L225 Difference]: With dead ends: 379 [2019-09-10 03:22:44,978 INFO L226 Difference]: Without dead ends: 379 [2019-09-10 03:22:44,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:22:44,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-10 03:22:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 361. [2019-09-10 03:22:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-09-10 03:22:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 454 transitions. [2019-09-10 03:22:44,997 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 454 transitions. Word has length 105 [2019-09-10 03:22:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:44,998 INFO L475 AbstractCegarLoop]: Abstraction has 361 states and 454 transitions. [2019-09-10 03:22:44,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:44,999 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 454 transitions. [2019-09-10 03:22:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:45,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:45,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:45,001 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:45,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:45,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1666440335, now seen corresponding path program 1 times [2019-09-10 03:22:45,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:45,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:45,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:45,082 INFO L134 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:22:45,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:45,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:45,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:45,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:45,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:45,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:45,087 INFO L87 Difference]: Start difference. First operand 361 states and 454 transitions. Second operand 5 states. [2019-09-10 03:22:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:45,683 INFO L93 Difference]: Finished difference Result 504 states and 642 transitions. [2019-09-10 03:22:45,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:22:45,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:45,687 INFO L225 Difference]: With dead ends: 504 [2019-09-10 03:22:45,687 INFO L226 Difference]: Without dead ends: 504 [2019-09-10 03:22:45,688 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:22:45,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-09-10 03:22:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 412. [2019-09-10 03:22:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-09-10 03:22:45,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 510 transitions. [2019-09-10 03:22:45,703 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 510 transitions. Word has length 105 [2019-09-10 03:22:45,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:45,703 INFO L475 AbstractCegarLoop]: Abstraction has 412 states and 510 transitions. [2019-09-10 03:22:45,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 510 transitions. [2019-09-10 03:22:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:45,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:45,705 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:45,706 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:45,706 INFO L82 PathProgramCache]: Analyzing trace with hash 256787699, now seen corresponding path program 1 times [2019-09-10 03:22:45,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:45,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:45,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:45,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:45,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:22:45,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:45,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:45,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:45,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:45,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:45,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:45,763 INFO L87 Difference]: Start difference. First operand 412 states and 510 transitions. Second operand 5 states. [2019-09-10 03:22:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:46,291 INFO L93 Difference]: Finished difference Result 526 states and 661 transitions. [2019-09-10 03:22:46,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:22:46,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:46,294 INFO L225 Difference]: With dead ends: 526 [2019-09-10 03:22:46,294 INFO L226 Difference]: Without dead ends: 526 [2019-09-10 03:22:46,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:22:46,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-10 03:22:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 453. [2019-09-10 03:22:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2019-09-10 03:22:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 552 transitions. [2019-09-10 03:22:46,309 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 552 transitions. Word has length 105 [2019-09-10 03:22:46,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:46,310 INFO L475 AbstractCegarLoop]: Abstraction has 453 states and 552 transitions. [2019-09-10 03:22:46,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:46,310 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 552 transitions. [2019-09-10 03:22:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:46,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:46,312 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:46,312 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:46,312 INFO L82 PathProgramCache]: Analyzing trace with hash 318827313, now seen corresponding path program 1 times [2019-09-10 03:22:46,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:46,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:46,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:46,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:46,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:46,371 INFO L134 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:22:46,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:46,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:22:46,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:46,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:22:46,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:22:46,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:22:46,372 INFO L87 Difference]: Start difference. First operand 453 states and 552 transitions. Second operand 5 states. [2019-09-10 03:22:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:46,909 INFO L93 Difference]: Finished difference Result 531 states and 658 transitions. [2019-09-10 03:22:46,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:22:46,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-10 03:22:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:46,913 INFO L225 Difference]: With dead ends: 531 [2019-09-10 03:22:46,913 INFO L226 Difference]: Without dead ends: 531 [2019-09-10 03:22:46,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:22:46,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-10 03:22:46,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 484. [2019-09-10 03:22:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-09-10 03:22:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 580 transitions. [2019-09-10 03:22:46,930 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 580 transitions. Word has length 105 [2019-09-10 03:22:46,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:46,931 INFO L475 AbstractCegarLoop]: Abstraction has 484 states and 580 transitions. [2019-09-10 03:22:46,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:22:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 580 transitions. [2019-09-10 03:22:46,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 03:22:46,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:46,933 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:46,933 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:46,934 INFO L82 PathProgramCache]: Analyzing trace with hash 184813807, now seen corresponding path program 1 times [2019-09-10 03:22:46,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:46,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:46,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:46,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:46,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:46,993 INFO L134 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:22:46,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:22:46,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:22:46,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:46,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:22:46,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:22:46,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:22:46,996 INFO L87 Difference]: Start difference. First operand 484 states and 580 transitions. Second operand 3 states. [2019-09-10 03:22:47,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:22:47,022 INFO L93 Difference]: Finished difference Result 920 states and 1115 transitions. [2019-09-10 03:22:47,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:22:47,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 03:22:47,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:22:47,027 INFO L225 Difference]: With dead ends: 920 [2019-09-10 03:22:47,027 INFO L226 Difference]: Without dead ends: 920 [2019-09-10 03:22:47,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:22:47,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2019-09-10 03:22:47,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 919. [2019-09-10 03:22:47,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-09-10 03:22:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1114 transitions. [2019-09-10 03:22:47,056 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1114 transitions. Word has length 105 [2019-09-10 03:22:47,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:22:47,058 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1114 transitions. [2019-09-10 03:22:47,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:22:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1114 transitions. [2019-09-10 03:22:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 03:22:47,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:22:47,062 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-10 03:22:47,062 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:22:47,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:47,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1241286252, now seen corresponding path program 1 times [2019-09-10 03:22:47,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:22:47,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:47,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:22:47,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:22:47,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:22:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:22:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 03:22:47,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:22:47,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:22:47,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2019-09-10 03:22:47,167 INFO L207 CegarAbsIntRunner]: [87], [92], [106], [109], [112], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [181], [183], [185], [186], [237], [238], [240], [245], [248], [253], [256], [259], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [484], [497], [510], [516], [517], [531], [533], [566], [567], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:22:47,247 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:22:47,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:22:47,552 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:22:47,554 INFO L272 AbstractInterpreter]: Visited 116 different actions 157 times. Never merged. Never widened. Performed 638 root evaluator evaluations with a maximum evaluation depth of 4. Performed 638 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 52 variables. [2019-09-10 03:22:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:22:47,559 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:22:47,822 INFO L227 lantSequenceWeakener]: Weakened 160 states. On average, predicates are now at 75.04% of their original sizes. [2019-09-10 03:22:47,823 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:22:49,638 INFO L420 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2019-09-10 03:22:49,639 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:22:49,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:22:49,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [4] total 68 [2019-09-10 03:22:49,640 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:22:49,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 03:22:49,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 03:22:49,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=3918, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 03:22:49,643 INFO L87 Difference]: Start difference. First operand 919 states and 1114 transitions. Second operand 66 states. [2019-09-10 03:23:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:15,000 INFO L93 Difference]: Finished difference Result 1336 states and 1565 transitions. [2019-09-10 03:23:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-10 03:23:15,000 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 170 [2019-09-10 03:23:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:15,007 INFO L225 Difference]: With dead ends: 1336 [2019-09-10 03:23:15,007 INFO L226 Difference]: Without dead ends: 1336 [2019-09-10 03:23:15,012 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5166 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1569, Invalid=15461, Unknown=0, NotChecked=0, Total=17030 [2019-09-10 03:23:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2019-09-10 03:23:15,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1318. [2019-09-10 03:23:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1318 states. [2019-09-10 03:23:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1546 transitions. [2019-09-10 03:23:15,047 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1546 transitions. Word has length 170 [2019-09-10 03:23:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:15,047 INFO L475 AbstractCegarLoop]: Abstraction has 1318 states and 1546 transitions. [2019-09-10 03:23:15,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 03:23:15,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1546 transitions. [2019-09-10 03:23:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:23:15,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:15,051 INFO L399 BasicCegarLoop]: trace histogram [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, 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] [2019-09-10 03:23:15,052 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:15,052 INFO L82 PathProgramCache]: Analyzing trace with hash -469290912, now seen corresponding path program 1 times [2019-09-10 03:23:15,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:15,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:15,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:15,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:15,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-10 03:23:15,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:15,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:15,133 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:15,133 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:15,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:15,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:15,134 INFO L87 Difference]: Start difference. First operand 1318 states and 1546 transitions. Second operand 5 states. [2019-09-10 03:23:15,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:15,868 INFO L93 Difference]: Finished difference Result 2214 states and 2697 transitions. [2019-09-10 03:23:15,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:23:15,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:23:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:15,878 INFO L225 Difference]: With dead ends: 2214 [2019-09-10 03:23:15,879 INFO L226 Difference]: Without dead ends: 1854 [2019-09-10 03:23:15,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:23:15,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2019-09-10 03:23:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1779. [2019-09-10 03:23:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1779 states. [2019-09-10 03:23:15,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2113 transitions. [2019-09-10 03:23:15,939 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2113 transitions. Word has length 176 [2019-09-10 03:23:15,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:15,940 INFO L475 AbstractCegarLoop]: Abstraction has 1779 states and 2113 transitions. [2019-09-10 03:23:15,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:15,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2113 transitions. [2019-09-10 03:23:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 03:23:15,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:15,945 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:23:15,946 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:15,946 INFO L82 PathProgramCache]: Analyzing trace with hash 540736306, now seen corresponding path program 1 times [2019-09-10 03:23:15,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:15,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:15,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:15,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:15,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 03:23:16,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:16,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:16,054 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2019-09-10 03:23:16,056 INFO L207 CegarAbsIntRunner]: [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [475], [481], [488], [494], [501], [504], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:23:16,074 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:23:16,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:23:16,164 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:23:16,165 INFO L272 AbstractInterpreter]: Visited 122 different actions 162 times. Never merged. Never widened. Performed 707 root evaluator evaluations with a maximum evaluation depth of 4. Performed 707 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-09-10 03:23:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:16,165 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:23:16,390 INFO L227 lantSequenceWeakener]: Weakened 168 states. On average, predicates are now at 73.96% of their original sizes. [2019-09-10 03:23:16,390 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:23:19,074 INFO L420 sIntCurrentIteration]: We unified 223 AI predicates to 223 [2019-09-10 03:23:19,075 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:23:19,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:23:19,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [6] total 74 [2019-09-10 03:23:19,075 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:19,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 03:23:19,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 03:23:19,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=4417, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 03:23:19,078 INFO L87 Difference]: Start difference. First operand 1779 states and 2113 transitions. Second operand 70 states. [2019-09-10 03:23:45,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:45,108 INFO L93 Difference]: Finished difference Result 1825 states and 2171 transitions. [2019-09-10 03:23:45,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 03:23:45,109 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 224 [2019-09-10 03:23:45,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:45,117 INFO L225 Difference]: With dead ends: 1825 [2019-09-10 03:23:45,117 INFO L226 Difference]: Without dead ends: 1825 [2019-09-10 03:23:45,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5978 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1642, Invalid=18380, Unknown=0, NotChecked=0, Total=20022 [2019-09-10 03:23:45,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2019-09-10 03:23:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1782. [2019-09-10 03:23:45,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1782 states. [2019-09-10 03:23:45,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2117 transitions. [2019-09-10 03:23:45,168 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2117 transitions. Word has length 224 [2019-09-10 03:23:45,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:45,168 INFO L475 AbstractCegarLoop]: Abstraction has 1782 states and 2117 transitions. [2019-09-10 03:23:45,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 03:23:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2117 transitions. [2019-09-10 03:23:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-10 03:23:45,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:45,174 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:23:45,174 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:45,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:45,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1488032333, now seen corresponding path program 1 times [2019-09-10 03:23:45,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:45,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:45,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:45,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 03:23:45,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:45,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:45,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 230 with the following transitions: [2019-09-10 03:23:45,260 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [475], [478], [497], [501], [504], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:23:45,266 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:23:45,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:23:45,297 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:23:45,297 INFO L272 AbstractInterpreter]: Visited 123 different actions 163 times. Never merged. Never widened. Performed 696 root evaluator evaluations with a maximum evaluation depth of 4. Performed 696 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 52 variables. [2019-09-10 03:23:45,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:45,298 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:23:45,389 INFO L227 lantSequenceWeakener]: Weakened 169 states. On average, predicates are now at 73.93% of their original sizes. [2019-09-10 03:23:45,389 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:23:47,221 INFO L420 sIntCurrentIteration]: We unified 228 AI predicates to 228 [2019-09-10 03:23:47,221 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:23:47,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:23:47,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [68] imperfect sequences [5] total 71 [2019-09-10 03:23:47,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:47,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-10 03:23:47,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-10 03:23:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=4153, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 03:23:47,224 INFO L87 Difference]: Start difference. First operand 1782 states and 2117 transitions. Second operand 68 states. [2019-09-10 03:24:09,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:24:09,218 INFO L93 Difference]: Finished difference Result 2051 states and 2418 transitions. [2019-09-10 03:24:09,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-10 03:24:09,219 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 229 [2019-09-10 03:24:09,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:24:09,227 INFO L225 Difference]: With dead ends: 2051 [2019-09-10 03:24:09,227 INFO L226 Difference]: Without dead ends: 2051 [2019-09-10 03:24:09,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5493 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1576, Invalid=16784, Unknown=0, NotChecked=0, Total=18360 [2019-09-10 03:24:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2051 states. [2019-09-10 03:24:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2051 to 2025. [2019-09-10 03:24:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-09-10 03:24:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2389 transitions. [2019-09-10 03:24:09,281 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2389 transitions. Word has length 229 [2019-09-10 03:24:09,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:24:09,281 INFO L475 AbstractCegarLoop]: Abstraction has 2025 states and 2389 transitions. [2019-09-10 03:24:09,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-10 03:24:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2389 transitions. [2019-09-10 03:24:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 03:24:09,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:24:09,287 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:24:09,288 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:24:09,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:09,288 INFO L82 PathProgramCache]: Analyzing trace with hash 554222668, now seen corresponding path program 1 times [2019-09-10 03:24:09,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:24:09,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:09,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:24:09,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:09,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:24:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:24:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 03:24:09,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:24:09,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:24:09,374 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2019-09-10 03:24:09,374 INFO L207 CegarAbsIntRunner]: [33], [36], [47], [49], [51], [53], [57], [60], [76], [78], [86], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [475], [481], [488], [491], [501], [504], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:24:09,377 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:24:09,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:24:09,425 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:24:09,426 INFO L272 AbstractInterpreter]: Visited 128 different actions 168 times. Never merged. Never widened. Performed 759 root evaluator evaluations with a maximum evaluation depth of 4. Performed 759 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-09-10 03:24:09,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:09,426 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:24:09,517 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 74.35% of their original sizes. [2019-09-10 03:24:09,517 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:24:11,556 INFO L420 sIntCurrentIteration]: We unified 229 AI predicates to 229 [2019-09-10 03:24:11,557 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:24:11,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:24:11,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [5] total 75 [2019-09-10 03:24:11,557 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:11,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 03:24:11,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 03:24:11,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=4693, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 03:24:11,559 INFO L87 Difference]: Start difference. First operand 2025 states and 2389 transitions. Second operand 72 states. [2019-09-10 03:24:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:24:47,211 INFO L93 Difference]: Finished difference Result 2341 states and 2762 transitions. [2019-09-10 03:24:47,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 03:24:47,212 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 230 [2019-09-10 03:24:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:24:47,221 INFO L225 Difference]: With dead ends: 2341 [2019-09-10 03:24:47,221 INFO L226 Difference]: Without dead ends: 2341 [2019-09-10 03:24:47,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6059 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1633, Invalid=18673, Unknown=0, NotChecked=0, Total=20306 [2019-09-10 03:24:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2019-09-10 03:24:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2293. [2019-09-10 03:24:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2293 states. [2019-09-10 03:24:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 2699 transitions. [2019-09-10 03:24:47,279 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 2699 transitions. Word has length 230 [2019-09-10 03:24:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:24:47,279 INFO L475 AbstractCegarLoop]: Abstraction has 2293 states and 2699 transitions. [2019-09-10 03:24:47,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 03:24:47,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 2699 transitions. [2019-09-10 03:24:47,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-10 03:24:47,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:24:47,286 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:24:47,286 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:24:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -387820532, now seen corresponding path program 1 times [2019-09-10 03:24:47,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:24:47,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:47,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:24:47,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:47,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:24:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:24:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 03:24:47,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:24:47,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:24:47,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 231 with the following transitions: [2019-09-10 03:24:47,388 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [475], [478], [488], [494], [501], [504], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:24:47,390 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:24:47,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:24:47,432 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:24:47,433 INFO L272 AbstractInterpreter]: Visited 128 different actions 168 times. Never merged. Never widened. Performed 759 root evaluator evaluations with a maximum evaluation depth of 4. Performed 759 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-09-10 03:24:47,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:47,433 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:24:47,561 INFO L227 lantSequenceWeakener]: Weakened 174 states. On average, predicates are now at 74.27% of their original sizes. [2019-09-10 03:24:47,561 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:24:49,627 INFO L420 sIntCurrentIteration]: We unified 229 AI predicates to 229 [2019-09-10 03:24:49,628 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:24:49,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:24:49,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [5] total 75 [2019-09-10 03:24:49,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:49,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 03:24:49,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 03:24:49,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=4695, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 03:24:49,630 INFO L87 Difference]: Start difference. First operand 2293 states and 2699 transitions. Second operand 72 states. [2019-09-10 03:25:21,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:25:21,375 INFO L93 Difference]: Finished difference Result 2347 states and 2769 transitions. [2019-09-10 03:25:21,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 03:25:21,375 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 230 [2019-09-10 03:25:21,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:25:21,385 INFO L225 Difference]: With dead ends: 2347 [2019-09-10 03:25:21,385 INFO L226 Difference]: Without dead ends: 2347 [2019-09-10 03:25:21,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6080 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1613, Invalid=18693, Unknown=0, NotChecked=0, Total=20306 [2019-09-10 03:25:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2019-09-10 03:25:21,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 2302. [2019-09-10 03:25:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2302 states. [2019-09-10 03:25:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2302 states to 2302 states and 2712 transitions. [2019-09-10 03:25:21,440 INFO L78 Accepts]: Start accepts. Automaton has 2302 states and 2712 transitions. Word has length 230 [2019-09-10 03:25:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:25:21,441 INFO L475 AbstractCegarLoop]: Abstraction has 2302 states and 2712 transitions. [2019-09-10 03:25:21,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 03:25:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2302 states and 2712 transitions. [2019-09-10 03:25:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 03:25:21,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:25:21,446 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:25:21,447 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:25:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:25:21,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1059286618, now seen corresponding path program 1 times [2019-09-10 03:25:21,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:25:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:25:21,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:25:21,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:25:21,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:25:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:25:21,535 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-10 03:25:21,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:25:21,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:25:21,535 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2019-09-10 03:25:21,537 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [60], [76], [78], [86], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [475], [478], [488], [491], [501], [504], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:25:21,540 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:25:21,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:25:21,585 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:25:21,585 INFO L272 AbstractInterpreter]: Visited 134 different actions 174 times. Never merged. Never widened. Performed 811 root evaluator evaluations with a maximum evaluation depth of 4. Performed 811 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-09-10 03:25:21,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:25:21,586 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:25:21,680 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 74.63% of their original sizes. [2019-09-10 03:25:21,681 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:25:23,891 INFO L420 sIntCurrentIteration]: We unified 235 AI predicates to 235 [2019-09-10 03:25:23,891 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:25:23,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:25:23,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [74] imperfect sequences [5] total 77 [2019-09-10 03:25:23,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:25:23,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 03:25:23,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 03:25:23,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=4979, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 03:25:23,894 INFO L87 Difference]: Start difference. First operand 2302 states and 2712 transitions. Second operand 74 states. [2019-09-10 03:26:00,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:26:00,572 INFO L93 Difference]: Finished difference Result 2622 states and 3089 transitions. [2019-09-10 03:26:00,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-10 03:26:00,573 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 236 [2019-09-10 03:26:00,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:26:00,584 INFO L225 Difference]: With dead ends: 2622 [2019-09-10 03:26:00,585 INFO L226 Difference]: Without dead ends: 2622 [2019-09-10 03:26:00,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6165 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1609, Invalid=18983, Unknown=0, NotChecked=0, Total=20592 [2019-09-10 03:26:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2019-09-10 03:26:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 2566. [2019-09-10 03:26:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2566 states. [2019-09-10 03:26:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3015 transitions. [2019-09-10 03:26:00,646 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3015 transitions. Word has length 236 [2019-09-10 03:26:00,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:26:00,647 INFO L475 AbstractCegarLoop]: Abstraction has 2566 states and 3015 transitions. [2019-09-10 03:26:00,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 03:26:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3015 transitions. [2019-09-10 03:26:00,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-10 03:26:00,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:26:00,653 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:26:00,654 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:26:00,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:00,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1230025892, now seen corresponding path program 1 times [2019-09-10 03:26:00,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:26:00,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:00,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:26:00,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:00,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:26:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:26:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 37 proven. 16 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-10 03:26:00,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:26:00,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:26:00,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2019-09-10 03:26:00,736 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [478], [484], [497], [501], [504], [510], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:26:00,738 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:26:00,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:26:00,794 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:26:00,795 INFO L272 AbstractInterpreter]: Visited 125 different actions 175 times. Merged at 4 different actions 4 times. Never widened. Performed 756 root evaluator evaluations with a maximum evaluation depth of 4. Performed 756 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 52 variables. [2019-09-10 03:26:00,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:00,795 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:26:00,938 INFO L227 lantSequenceWeakener]: Weakened 182 states. On average, predicates are now at 74.51% of their original sizes. [2019-09-10 03:26:00,938 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:26:03,042 INFO L420 sIntCurrentIteration]: We unified 242 AI predicates to 242 [2019-09-10 03:26:03,042 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:26:03,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:26:03,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [72] imperfect sequences [4] total 74 [2019-09-10 03:26:03,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:26:03,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-10 03:26:03,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-10 03:26:03,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=507, Invalid=4605, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 03:26:03,045 INFO L87 Difference]: Start difference. First operand 2566 states and 3015 transitions. Second operand 72 states. [2019-09-10 03:26:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:26:30,307 INFO L93 Difference]: Finished difference Result 3447 states and 3974 transitions. [2019-09-10 03:26:30,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-09-10 03:26:30,307 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 243 [2019-09-10 03:26:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:26:30,324 INFO L225 Difference]: With dead ends: 3447 [2019-09-10 03:26:30,324 INFO L226 Difference]: Without dead ends: 3447 [2019-09-10 03:26:30,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7259 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2123, Invalid=21133, Unknown=0, NotChecked=0, Total=23256 [2019-09-10 03:26:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2019-09-10 03:26:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3421. [2019-09-10 03:26:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3421 states. [2019-09-10 03:26:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 3943 transitions. [2019-09-10 03:26:30,420 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 3943 transitions. Word has length 243 [2019-09-10 03:26:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:26:30,420 INFO L475 AbstractCegarLoop]: Abstraction has 3421 states and 3943 transitions. [2019-09-10 03:26:30,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-10 03:26:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 3943 transitions. [2019-09-10 03:26:30,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-10 03:26:30,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:26:30,427 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:26:30,427 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:26:30,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:30,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1946063669, now seen corresponding path program 1 times [2019-09-10 03:26:30,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:26:30,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:30,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:26:30,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:30,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:26:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:26:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-10 03:26:30,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:26:30,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:26:30,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 245 with the following transitions: [2019-09-10 03:26:30,532 INFO L207 CegarAbsIntRunner]: [33], [36], [47], [49], [51], [53], [57], [60], [76], [78], [86], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [481], [484], [488], [491], [497], [501], [504], [510], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:26:30,533 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:26:30,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:26:30,583 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:26:30,583 INFO L272 AbstractInterpreter]: Visited 132 different actions 189 times. Merged at 8 different actions 8 times. Never widened. Performed 885 root evaluator evaluations with a maximum evaluation depth of 4. Performed 885 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-09-10 03:26:30,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:30,584 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:26:30,708 INFO L227 lantSequenceWeakener]: Weakened 188 states. On average, predicates are now at 74.85% of their original sizes. [2019-09-10 03:26:30,709 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:26:33,441 INFO L420 sIntCurrentIteration]: We unified 243 AI predicates to 243 [2019-09-10 03:26:33,442 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:26:33,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:26:33,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [76] imperfect sequences [4] total 78 [2019-09-10 03:26:33,442 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:26:33,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-10 03:26:33,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-10 03:26:33,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=5177, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 03:26:33,444 INFO L87 Difference]: Start difference. First operand 3421 states and 3943 transitions. Second operand 76 states. [2019-09-10 03:27:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:35,572 INFO L93 Difference]: Finished difference Result 4873 states and 5580 transitions. [2019-09-10 03:27:35,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-10 03:27:35,572 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 244 [2019-09-10 03:27:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:35,595 INFO L225 Difference]: With dead ends: 4873 [2019-09-10 03:27:35,595 INFO L226 Difference]: Without dead ends: 4873 [2019-09-10 03:27:35,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8823 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2378, Invalid=25344, Unknown=0, NotChecked=0, Total=27722 [2019-09-10 03:27:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2019-09-10 03:27:35,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4789. [2019-09-10 03:27:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4789 states. [2019-09-10 03:27:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4789 states to 4789 states and 5470 transitions. [2019-09-10 03:27:35,699 INFO L78 Accepts]: Start accepts. Automaton has 4789 states and 5470 transitions. Word has length 244 [2019-09-10 03:27:35,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:35,700 INFO L475 AbstractCegarLoop]: Abstraction has 4789 states and 5470 transitions. [2019-09-10 03:27:35,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-10 03:27:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4789 states and 5470 transitions. [2019-09-10 03:27:35,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:27:35,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:35,708 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:27:35,709 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:35,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:35,709 INFO L82 PathProgramCache]: Analyzing trace with hash 124186462, now seen corresponding path program 1 times [2019-09-10 03:27:35,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:35,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:35,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:35,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:35,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-10 03:27:35,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:35,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:27:35,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2019-09-10 03:27:35,835 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [277], [280], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [471], [475], [481], [484], [488], [494], [497], [501], [504], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:27:35,836 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:27:35,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:27:35,923 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:27:35,924 INFO L272 AbstractInterpreter]: Visited 140 different actions 350 times. Merged at 30 different actions 39 times. Never widened. Performed 1668 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1668 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 54 variables. [2019-09-10 03:27:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:35,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:27:35,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:35,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:27:35,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:35,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:27:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:36,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 03:27:36,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:27:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 03:27:36,212 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:27:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-09-10 03:27:36,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:27:36,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2019-09-10 03:27:36,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:36,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:27:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:27:36,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:36,453 INFO L87 Difference]: Start difference. First operand 4789 states and 5470 transitions. Second operand 3 states. [2019-09-10 03:27:36,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:36,491 INFO L93 Difference]: Finished difference Result 5953 states and 6962 transitions. [2019-09-10 03:27:36,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:27:36,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-10 03:27:36,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:36,511 INFO L225 Difference]: With dead ends: 5953 [2019-09-10 03:27:36,511 INFO L226 Difference]: Without dead ends: 5953 [2019-09-10 03:27:36,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:36,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5953 states. [2019-09-10 03:27:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5953 to 5950. [2019-09-10 03:27:36,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5950 states. [2019-09-10 03:27:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5950 states to 5950 states and 6960 transitions. [2019-09-10 03:27:36,634 INFO L78 Accepts]: Start accepts. Automaton has 5950 states and 6960 transitions. Word has length 245 [2019-09-10 03:27:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:36,635 INFO L475 AbstractCegarLoop]: Abstraction has 5950 states and 6960 transitions. [2019-09-10 03:27:36,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:27:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 5950 states and 6960 transitions. [2019-09-10 03:27:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:27:36,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:36,647 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:27:36,647 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:36,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1883548929, now seen corresponding path program 1 times [2019-09-10 03:27:36,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:36,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:36,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:36,736 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-10 03:27:36,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:36,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:27:36,737 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2019-09-10 03:27:36,737 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [251], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [478], [484], [488], [494], [501], [504], [507], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:27:36,739 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:27:36,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:27:36,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:27:36,892 INFO L272 AbstractInterpreter]: Visited 138 different actions 594 times. Merged at 36 different actions 136 times. Never widened. Performed 3036 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3036 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 15 fixpoints after 6 different actions. Largest state had 54 variables. [2019-09-10 03:27:36,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:36,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:27:36,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:36,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:27:36,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:36,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:27:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:37,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 03:27:37,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:27:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-10 03:27:37,149 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:27:37,425 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-10 03:27:37,437 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:27:37,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [3] total 5 [2019-09-10 03:27:37,439 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:37,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:27:37,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:27:37,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:37,440 INFO L87 Difference]: Start difference. First operand 5950 states and 6960 transitions. Second operand 3 states. [2019-09-10 03:27:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:37,481 INFO L93 Difference]: Finished difference Result 8356 states and 10138 transitions. [2019-09-10 03:27:37,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:27:37,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-10 03:27:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:37,508 INFO L225 Difference]: With dead ends: 8356 [2019-09-10 03:27:37,508 INFO L226 Difference]: Without dead ends: 8356 [2019-09-10 03:27:37,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 491 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:27:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8356 states. [2019-09-10 03:27:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8356 to 8325. [2019-09-10 03:27:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8325 states. [2019-09-10 03:27:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8325 states to 8325 states and 10103 transitions. [2019-09-10 03:27:37,678 INFO L78 Accepts]: Start accepts. Automaton has 8325 states and 10103 transitions. Word has length 246 [2019-09-10 03:27:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:37,678 INFO L475 AbstractCegarLoop]: Abstraction has 8325 states and 10103 transitions. [2019-09-10 03:27:37,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:27:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 8325 states and 10103 transitions. [2019-09-10 03:27:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 03:27:37,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:37,694 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:27:37,694 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:37,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:37,695 INFO L82 PathProgramCache]: Analyzing trace with hash -2063943594, now seen corresponding path program 1 times [2019-09-10 03:27:37,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:37,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:37,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:37,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:37,696 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-10 03:27:37,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:37,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:27:37,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2019-09-10 03:27:37,764 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [251], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [478], [484], [488], [494], [501], [504], [507], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:27:37,765 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:27:37,765 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:27:37,933 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:27:37,933 INFO L272 AbstractInterpreter]: Visited 139 different actions 599 times. Merged at 36 different actions 134 times. Never widened. Performed 3691 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3691 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 16 fixpoints after 8 different actions. Largest state had 54 variables. [2019-09-10 03:27:37,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:37,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:27:37,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:37,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:27:37,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:37,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:27:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:38,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 03:27:38,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:27:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-10 03:27:38,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:27:38,314 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 27 proven. 10 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-10 03:27:38,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:27:38,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 3 [2019-09-10 03:27:38,323 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:38,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:27:38,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:27:38,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:27:38,324 INFO L87 Difference]: Start difference. First operand 8325 states and 10103 transitions. Second operand 3 states. [2019-09-10 03:27:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:38,391 INFO L93 Difference]: Finished difference Result 11009 states and 13578 transitions. [2019-09-10 03:27:38,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:27:38,391 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-09-10 03:27:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:38,427 INFO L225 Difference]: With dead ends: 11009 [2019-09-10 03:27:38,427 INFO L226 Difference]: Without dead ends: 11009 [2019-09-10 03:27:38,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 495 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:27:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states. [2019-09-10 03:27:38,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 11002. [2019-09-10 03:27:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11002 states. [2019-09-10 03:27:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11002 states to 11002 states and 13568 transitions. [2019-09-10 03:27:38,749 INFO L78 Accepts]: Start accepts. Automaton has 11002 states and 13568 transitions. Word has length 247 [2019-09-10 03:27:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:38,750 INFO L475 AbstractCegarLoop]: Abstraction has 11002 states and 13568 transitions. [2019-09-10 03:27:38,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:27:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 11002 states and 13568 transitions. [2019-09-10 03:27:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 03:27:38,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:38,768 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:27:38,768 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash 923881304, now seen corresponding path program 1 times [2019-09-10 03:27:38,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:38,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:38,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:38,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:38,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 32 proven. 23 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-10 03:27:38,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:38,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:27:38,890 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2019-09-10 03:27:38,890 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [478], [484], [488], [494], [501], [504], [507], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:27:38,892 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:27:38,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:27:39,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:27:39,056 INFO L272 AbstractInterpreter]: Visited 138 different actions 532 times. Merged at 35 different actions 105 times. Never widened. Performed 2884 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2884 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 6 different actions. Largest state had 54 variables. [2019-09-10 03:27:39,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:39,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:27:39,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:39,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:27:39,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:39,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:27:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:39,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 03:27:39,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:27:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-10 03:27:39,312 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:27:39,507 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:27:39,517 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:27:39,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [10] total 12 [2019-09-10 03:27:39,518 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:39,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:27:39,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:27:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:27:39,519 INFO L87 Difference]: Start difference. First operand 11002 states and 13568 transitions. Second operand 3 states. [2019-09-10 03:27:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:39,581 INFO L93 Difference]: Finished difference Result 12294 states and 15150 transitions. [2019-09-10 03:27:39,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:27:39,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-09-10 03:27:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:39,629 INFO L225 Difference]: With dead ends: 12294 [2019-09-10 03:27:39,629 INFO L226 Difference]: Without dead ends: 12294 [2019-09-10 03:27:39,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:27:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12294 states. [2019-09-10 03:27:39,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12294 to 12284. [2019-09-10 03:27:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12284 states. [2019-09-10 03:27:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12284 states to 12284 states and 15140 transitions. [2019-09-10 03:27:39,899 INFO L78 Accepts]: Start accepts. Automaton has 12284 states and 15140 transitions. Word has length 247 [2019-09-10 03:27:39,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:39,900 INFO L475 AbstractCegarLoop]: Abstraction has 12284 states and 15140 transitions. [2019-09-10 03:27:39,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:27:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 12284 states and 15140 transitions. [2019-09-10 03:27:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-10 03:27:39,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:39,923 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:27:39,924 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:39,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:39,924 INFO L82 PathProgramCache]: Analyzing trace with hash -796705735, now seen corresponding path program 1 times [2019-09-10 03:27:39,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:39,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:39,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:39,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:39,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 30 proven. 23 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-10 03:27:40,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:27:40,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:27:40,049 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 254 with the following transitions: [2019-09-10 03:27:40,049 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [60], [76], [78], [86], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [433], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [478], [484], [488], [491], [497], [501], [504], [510], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:27:40,051 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:27:40,051 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:27:40,096 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:27:40,096 INFO L272 AbstractInterpreter]: Visited 140 different actions 205 times. Merged at 9 different actions 9 times. Never widened. Performed 1139 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1139 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 54 variables. [2019-09-10 03:27:40,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:40,096 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:27:40,623 INFO L227 lantSequenceWeakener]: Weakened 193 states. On average, predicates are now at 73.7% of their original sizes. [2019-09-10 03:27:40,623 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:27:43,338 INFO L420 sIntCurrentIteration]: We unified 252 AI predicates to 252 [2019-09-10 03:27:43,339 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:27:43,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:27:43,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [79] imperfect sequences [10] total 87 [2019-09-10 03:27:43,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:43,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-10 03:27:43,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-10 03:27:43,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=506, Invalid=5656, Unknown=0, NotChecked=0, Total=6162 [2019-09-10 03:27:43,341 INFO L87 Difference]: Start difference. First operand 12284 states and 15140 transitions. Second operand 79 states. [2019-09-10 03:28:20,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:20,372 INFO L93 Difference]: Finished difference Result 12334 states and 15167 transitions. [2019-09-10 03:28:20,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-10 03:28:20,373 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 253 [2019-09-10 03:28:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:20,405 INFO L225 Difference]: With dead ends: 12334 [2019-09-10 03:28:20,405 INFO L226 Difference]: Without dead ends: 12334 [2019-09-10 03:28:20,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8051 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1930, Invalid=23830, Unknown=0, NotChecked=0, Total=25760 [2019-09-10 03:28:20,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12334 states. [2019-09-10 03:28:20,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12334 to 12277. [2019-09-10 03:28:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12277 states. [2019-09-10 03:28:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12277 states to 12277 states and 15100 transitions. [2019-09-10 03:28:20,635 INFO L78 Accepts]: Start accepts. Automaton has 12277 states and 15100 transitions. Word has length 253 [2019-09-10 03:28:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:20,636 INFO L475 AbstractCegarLoop]: Abstraction has 12277 states and 15100 transitions. [2019-09-10 03:28:20,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-10 03:28:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 12277 states and 15100 transitions. [2019-09-10 03:28:20,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 03:28:20,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:20,657 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:28:20,657 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:20,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:20,657 INFO L82 PathProgramCache]: Analyzing trace with hash 385510554, now seen corresponding path program 1 times [2019-09-10 03:28:20,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:20,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:20,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:20,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:20,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 32 proven. 23 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-10 03:28:20,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:20,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:20,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 249 with the following transitions: [2019-09-10 03:28:20,799 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [433], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [478], [484], [488], [494], [501], [504], [507], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:28:20,800 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:20,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:20,919 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:28:20,920 INFO L272 AbstractInterpreter]: Visited 139 different actions 445 times. Merged at 35 different actions 80 times. Never widened. Performed 2627 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2627 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 6 different actions. Largest state had 54 variables. [2019-09-10 03:28:20,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:20,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:28:20,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:20,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:28:20,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:20,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:28:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:21,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 03:28:21,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:28:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-10 03:28:21,143 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:28:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-10 03:28:21,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:28:21,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 14 [2019-09-10 03:28:21,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:21,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:28:21,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:28:21,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:28:21,535 INFO L87 Difference]: Start difference. First operand 12277 states and 15100 transitions. Second operand 6 states. [2019-09-10 03:28:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:21,610 INFO L93 Difference]: Finished difference Result 12249 states and 15075 transitions. [2019-09-10 03:28:21,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:28:21,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 248 [2019-09-10 03:28:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:21,642 INFO L225 Difference]: With dead ends: 12249 [2019-09-10 03:28:21,642 INFO L226 Difference]: Without dead ends: 12249 [2019-09-10 03:28:21,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 491 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:28:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12249 states. [2019-09-10 03:28:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12249 to 12239. [2019-09-10 03:28:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12239 states. [2019-09-10 03:28:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12239 states to 12239 states and 15065 transitions. [2019-09-10 03:28:21,893 INFO L78 Accepts]: Start accepts. Automaton has 12239 states and 15065 transitions. Word has length 248 [2019-09-10 03:28:21,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:21,893 INFO L475 AbstractCegarLoop]: Abstraction has 12239 states and 15065 transitions. [2019-09-10 03:28:21,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:28:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 12239 states and 15065 transitions. [2019-09-10 03:28:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 03:28:21,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:21,915 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-10 03:28:21,915 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:21,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:21,916 INFO L82 PathProgramCache]: Analyzing trace with hash -322290606, now seen corresponding path program 1 times [2019-09-10 03:28:21,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:21,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:21,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:21,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:21,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 33 proven. 16 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-10 03:28:22,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:22,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:22,025 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2019-09-10 03:28:22,026 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [433], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [478], [484], [488], [494], [501], [504], [507], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:28:22,028 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:22,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:22,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:28:22,143 INFO L272 AbstractInterpreter]: Visited 138 different actions 347 times. Merged at 16 different actions 30 times. Never widened. Performed 2541 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2541 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 5 different actions. Largest state had 54 variables. [2019-09-10 03:28:22,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:22,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:28:22,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:22,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:28:22,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:22,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:28:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:22,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 03:28:22,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:28:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-10 03:28:22,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:28:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 33 proven. 16 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-10 03:28:22,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:28:22,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-09-10 03:28:22,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:22,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:28:22,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:28:22,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:28:22,528 INFO L87 Difference]: Start difference. First operand 12239 states and 15065 transitions. Second operand 3 states. [2019-09-10 03:28:22,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:22,580 INFO L93 Difference]: Finished difference Result 11814 states and 14530 transitions. [2019-09-10 03:28:22,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:28:22,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 249 [2019-09-10 03:28:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:22,613 INFO L225 Difference]: With dead ends: 11814 [2019-09-10 03:28:22,613 INFO L226 Difference]: Without dead ends: 11814 [2019-09-10 03:28:22,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 499 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:28:22,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11814 states. [2019-09-10 03:28:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11814 to 11786. [2019-09-10 03:28:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11786 states. [2019-09-10 03:28:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11786 states to 11786 states and 14492 transitions. [2019-09-10 03:28:22,833 INFO L78 Accepts]: Start accepts. Automaton has 11786 states and 14492 transitions. Word has length 249 [2019-09-10 03:28:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:22,833 INFO L475 AbstractCegarLoop]: Abstraction has 11786 states and 14492 transitions. [2019-09-10 03:28:22,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:28:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 11786 states and 14492 transitions. [2019-09-10 03:28:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-10 03:28:22,851 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:22,851 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:28:22,852 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1832388759, now seen corresponding path program 1 times [2019-09-10 03:28:22,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:22,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:22,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:22,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:22,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-10 03:28:22,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:22,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:22,945 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 256 with the following transitions: [2019-09-10 03:28:22,945 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [60], [76], [78], [86], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [251], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [433], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [478], [481], [488], [491], [497], [501], [504], [507], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:28:22,947 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:22,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:23,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:28:23,121 INFO L272 AbstractInterpreter]: Visited 147 different actions 708 times. Merged at 38 different actions 141 times. Never widened. Performed 3848 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3848 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 22 fixpoints after 8 different actions. Largest state had 54 variables. [2019-09-10 03:28:23,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:23,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:28:23,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:23,122 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:28:23,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:23,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:28:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:23,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 03:28:23,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:28:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 03:28:23,556 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:28:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-09-10 03:28:23,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:28:23,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 4 [2019-09-10 03:28:23,774 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:23,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:28:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:28:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:28:23,775 INFO L87 Difference]: Start difference. First operand 11786 states and 14492 transitions. Second operand 3 states. [2019-09-10 03:28:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:23,842 INFO L93 Difference]: Finished difference Result 14126 states and 17363 transitions. [2019-09-10 03:28:23,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:28:23,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-09-10 03:28:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:23,882 INFO L225 Difference]: With dead ends: 14126 [2019-09-10 03:28:23,882 INFO L226 Difference]: Without dead ends: 14126 [2019-09-10 03:28:23,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 511 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:28:23,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14126 states. [2019-09-10 03:28:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14126 to 14043. [2019-09-10 03:28:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14043 states. [2019-09-10 03:28:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14043 states to 14043 states and 17266 transitions. [2019-09-10 03:28:24,164 INFO L78 Accepts]: Start accepts. Automaton has 14043 states and 17266 transitions. Word has length 255 [2019-09-10 03:28:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:24,164 INFO L475 AbstractCegarLoop]: Abstraction has 14043 states and 17266 transitions. [2019-09-10 03:28:24,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:28:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 14043 states and 17266 transitions. [2019-09-10 03:28:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-10 03:28:24,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:24,180 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:28:24,181 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:24,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:24,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1893831554, now seen corresponding path program 1 times [2019-09-10 03:28:24,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:24,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:24,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:24,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:24,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-09-10 03:28:24,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:24,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:24,280 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 250 with the following transitions: [2019-09-10 03:28:24,281 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [33], [36], [47], [49], [51], [53], [57], [87], [92], [106], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [251], [253], [256], [261], [264], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [433], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [478], [481], [488], [494], [501], [504], [507], [516], [517], [531], [533], [566], [567], [570], [571], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:28:24,285 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:24,285 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:24,405 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:28:24,406 INFO L272 AbstractInterpreter]: Visited 140 different actions 502 times. Merged at 36 different actions 106 times. Never widened. Performed 2577 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2577 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 13 fixpoints after 6 different actions. Largest state had 54 variables. [2019-09-10 03:28:24,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:24,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:28:24,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:24,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:28:24,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:24,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:28:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:24,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 1151 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:28:24,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:28:24,653 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 24 proven. 79 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-10 03:28:24,654 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:28:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 03:28:24,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:28:24,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 03:28:24,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:24,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:28:24,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:28:24,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:28:24,862 INFO L87 Difference]: Start difference. First operand 14043 states and 17266 transitions. Second operand 5 states. [2019-09-10 03:28:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:25,554 INFO L93 Difference]: Finished difference Result 14150 states and 17676 transitions. [2019-09-10 03:28:25,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:28:25,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-09-10 03:28:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:25,590 INFO L225 Difference]: With dead ends: 14150 [2019-09-10 03:28:25,590 INFO L226 Difference]: Without dead ends: 14150 [2019-09-10 03:28:25,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 491 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:28:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14150 states. [2019-09-10 03:28:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14150 to 14097. [2019-09-10 03:28:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14097 states. [2019-09-10 03:28:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14097 states to 14097 states and 17520 transitions. [2019-09-10 03:28:25,850 INFO L78 Accepts]: Start accepts. Automaton has 14097 states and 17520 transitions. Word has length 249 [2019-09-10 03:28:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:25,852 INFO L475 AbstractCegarLoop]: Abstraction has 14097 states and 17520 transitions. [2019-09-10 03:28:25,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 14097 states and 17520 transitions. [2019-09-10 03:28:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-09-10 03:28:25,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:25,871 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:25,872 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:25,872 INFO L82 PathProgramCache]: Analyzing trace with hash 633872043, now seen corresponding path program 1 times [2019-09-10 03:28:25,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:25,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:25,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:25,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-10 03:28:26,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:26,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:26,100 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 309 with the following transitions: [2019-09-10 03:28:26,100 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [112], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [259], [261], [264], [267], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [431], [433], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [481], [488], [491], [501], [504], [516], [517], [531], [533], [566], [567], [570], [571], [572], [573], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:28:26,102 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:26,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:26,266 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:28:26,266 INFO L272 AbstractInterpreter]: Visited 152 different actions 594 times. Merged at 28 different actions 75 times. Never widened. Performed 3859 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3859 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 5 different actions. Largest state had 54 variables. [2019-09-10 03:28:26,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:26,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:28:26,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:26,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:28:26,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:26,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:28:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:26,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 03:28:26,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:28:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 03:28:26,557 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:28:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 32 proven. 24 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2019-09-10 03:28:26,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:28:26,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 5] total 8 [2019-09-10 03:28:26,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:26,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:28:26,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:28:26,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:28:26,861 INFO L87 Difference]: Start difference. First operand 14097 states and 17520 transitions. Second operand 4 states. [2019-09-10 03:28:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:27,187 INFO L93 Difference]: Finished difference Result 13899 states and 18543 transitions. [2019-09-10 03:28:27,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:28:27,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-09-10 03:28:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:27,214 INFO L225 Difference]: With dead ends: 13899 [2019-09-10 03:28:27,214 INFO L226 Difference]: Without dead ends: 13899 [2019-09-10 03:28:27,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 603 SyntacticMatches, 11 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:28:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13899 states. [2019-09-10 03:28:27,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13899 to 13070. [2019-09-10 03:28:27,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13070 states. [2019-09-10 03:28:27,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13070 states to 13070 states and 16284 transitions. [2019-09-10 03:28:27,496 INFO L78 Accepts]: Start accepts. Automaton has 13070 states and 16284 transitions. Word has length 308 [2019-09-10 03:28:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:27,497 INFO L475 AbstractCegarLoop]: Abstraction has 13070 states and 16284 transitions. [2019-09-10 03:28:27,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:28:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 13070 states and 16284 transitions. [2019-09-10 03:28:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-10 03:28:27,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:27,520 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:27,520 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash -927376193, now seen corresponding path program 1 times [2019-09-10 03:28:27,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:27,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:27,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:27,642 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 43 proven. 43 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-09-10 03:28:27,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:27,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:27,643 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 312 with the following transitions: [2019-09-10 03:28:27,643 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [267], [269], [271], [272], [275], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [431], [433], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [481], [488], [491], [501], [504], [516], [517], [531], [533], [566], [567], [570], [571], [572], [573], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:28:27,645 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:27,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:28,359 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:28:28,360 INFO L272 AbstractInterpreter]: Visited 157 different actions 2744 times. Merged at 60 different actions 812 times. Widened at 1 different actions 1 times. Performed 13035 root evaluator evaluations with a maximum evaluation depth of 4. Performed 13035 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 85 fixpoints after 13 different actions. Largest state had 54 variables. [2019-09-10 03:28:28,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:28,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:28:28,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:28,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:28:28,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:28,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:28:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:28,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 1355 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:28:28,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:28:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-09-10 03:28:28,615 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:28:28,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:28:28,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:28:28,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:28:28,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:28:28,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:28:28,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:28:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 43 proven. 43 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-09-10 03:28:29,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:28:29,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2019-09-10 03:28:29,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:29,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:28:29,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:28:29,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:28:29,048 INFO L87 Difference]: Start difference. First operand 13070 states and 16284 transitions. Second operand 4 states. [2019-09-10 03:28:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:29,462 INFO L93 Difference]: Finished difference Result 19268 states and 24712 transitions. [2019-09-10 03:28:29,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:28:29,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-09-10 03:28:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:29,513 INFO L225 Difference]: With dead ends: 19268 [2019-09-10 03:28:29,514 INFO L226 Difference]: Without dead ends: 19268 [2019-09-10 03:28:29,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 634 GetRequests, 627 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:28:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19268 states. [2019-09-10 03:28:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19268 to 19069. [2019-09-10 03:28:29,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19069 states. [2019-09-10 03:28:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19069 states to 19069 states and 24440 transitions. [2019-09-10 03:28:29,904 INFO L78 Accepts]: Start accepts. Automaton has 19069 states and 24440 transitions. Word has length 311 [2019-09-10 03:28:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:29,904 INFO L475 AbstractCegarLoop]: Abstraction has 19069 states and 24440 transitions. [2019-09-10 03:28:29,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:28:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19069 states and 24440 transitions. [2019-09-10 03:28:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-10 03:28:29,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:29,925 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:29,925 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:29,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:29,925 INFO L82 PathProgramCache]: Analyzing trace with hash -683452675, now seen corresponding path program 1 times [2019-09-10 03:28:29,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:29,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:29,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:29,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:29,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-09-10 03:28:30,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:30,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:30,029 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2019-09-10 03:28:30,029 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [261], [264], [267], [269], [271], [272], [275], [277], [280], [294], [295], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [431], [433], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [471], [475], [481], [488], [491], [494], [501], [504], [516], [517], [531], [533], [566], [567], [570], [571], [572], [573], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:28:30,031 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:30,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:30,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:28:30,348 INFO L272 AbstractInterpreter]: Visited 149 different actions 1361 times. Merged at 49 different actions 336 times. Widened at 1 different actions 2 times. Performed 5883 root evaluator evaluations with a maximum evaluation depth of 4. Performed 5883 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 34 fixpoints after 8 different actions. Largest state had 54 variables. [2019-09-10 03:28:30,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:30,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:28:30,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:30,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:28:30,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:30,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:28:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:30,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 1306 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:28:30,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:28:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 153 proven. 79 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-10 03:28:30,756 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:28:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-09-10 03:28:31,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:28:31,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 03:28:31,007 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:31,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:28:31,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:28:31,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:28:31,007 INFO L87 Difference]: Start difference. First operand 19069 states and 24440 transitions. Second operand 5 states. [2019-09-10 03:28:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:31,599 INFO L93 Difference]: Finished difference Result 18793 states and 24286 transitions. [2019-09-10 03:28:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:28:31,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 303 [2019-09-10 03:28:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:31,632 INFO L225 Difference]: With dead ends: 18793 [2019-09-10 03:28:31,632 INFO L226 Difference]: Without dead ends: 18793 [2019-09-10 03:28:31,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 599 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:28:31,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18793 states. [2019-09-10 03:28:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18793 to 18475. [2019-09-10 03:28:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18475 states. [2019-09-10 03:28:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18475 states to 18475 states and 23731 transitions. [2019-09-10 03:28:32,090 INFO L78 Accepts]: Start accepts. Automaton has 18475 states and 23731 transitions. Word has length 303 [2019-09-10 03:28:32,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:32,091 INFO L475 AbstractCegarLoop]: Abstraction has 18475 states and 23731 transitions. [2019-09-10 03:28:32,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:32,091 INFO L276 IsEmpty]: Start isEmpty. Operand 18475 states and 23731 transitions. [2019-09-10 03:28:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2019-09-10 03:28:32,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:32,123 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-10 03:28:32,123 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:32,123 INFO L82 PathProgramCache]: Analyzing trace with hash 910886205, now seen corresponding path program 1 times [2019-09-10 03:28:32,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:32,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:32,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:32,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:32,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 66 proven. 120 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2019-09-10 03:28:32,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:32,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:32,391 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 561 with the following transitions: [2019-09-10 03:28:32,392 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [251], [253], [256], [259], [261], [264], [267], [269], [271], [272], [275], [294], [295], [296], [299], [302], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [431], [433], [435], [437], [439], [440], [441], [450], [453], [456], [458], [462], [465], [468], [475], [478], [481], [488], [491], [497], [501], [504], [510], [515], [516], [517], [531], [533], [535], [537], [542], [550], [553], [558], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [632], [633], [634], [635], [636] [2019-09-10 03:28:32,394 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:32,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:33,176 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:28:33,176 INFO L272 AbstractInterpreter]: Visited 167 different actions 3110 times. Merged at 63 different actions 951 times. Widened at 1 different actions 1 times. Performed 15231 root evaluator evaluations with a maximum evaluation depth of 4. Performed 15231 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 111 fixpoints after 15 different actions. Largest state had 54 variables. [2019-09-10 03:28:33,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:33,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:28:33,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:33,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:28:33,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:33,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:28:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:33,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 2098 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 03:28:33,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:28:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 586 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2019-09-10 03:28:33,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:28:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 75 proven. 38 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2019-09-10 03:28:34,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:28:34,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 3] total 6 [2019-09-10 03:28:34,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:34,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:28:34,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:28:34,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:28:34,251 INFO L87 Difference]: Start difference. First operand 18475 states and 23731 transitions. Second operand 3 states. [2019-09-10 03:28:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:34,307 INFO L93 Difference]: Finished difference Result 18578 states and 23631 transitions. [2019-09-10 03:28:34,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:28:34,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 560 [2019-09-10 03:28:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:34,338 INFO L225 Difference]: With dead ends: 18578 [2019-09-10 03:28:34,338 INFO L226 Difference]: Without dead ends: 18578 [2019-09-10 03:28:34,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1126 GetRequests, 1122 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:28:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18578 states. [2019-09-10 03:28:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18578 to 18555. [2019-09-10 03:28:34,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18555 states. [2019-09-10 03:28:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18555 states to 18555 states and 23607 transitions. [2019-09-10 03:28:34,584 INFO L78 Accepts]: Start accepts. Automaton has 18555 states and 23607 transitions. Word has length 560 [2019-09-10 03:28:34,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:34,584 INFO L475 AbstractCegarLoop]: Abstraction has 18555 states and 23607 transitions. [2019-09-10 03:28:34,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:28:34,584 INFO L276 IsEmpty]: Start isEmpty. Operand 18555 states and 23607 transitions. [2019-09-10 03:28:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2019-09-10 03:28:34,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:34,609 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-09-10 03:28:34,609 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:34,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:34,609 INFO L82 PathProgramCache]: Analyzing trace with hash -621760517, now seen corresponding path program 2 times [2019-09-10 03:28:34,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:34,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:34,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:34,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:34,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:34,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 66 proven. 120 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2019-09-10 03:28:34,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:34,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:34,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:28:34,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:28:34,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:34,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:28:35,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:28:35,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:28:35,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 03:28:35,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:28:35,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 03:28:35,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:28:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 647 trivial. 0 not checked. [2019-09-10 03:28:35,298 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:28:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 78 proven. 63 refuted. 0 times theorem prover too weak. 1023 trivial. 0 not checked. [2019-09-10 03:28:35,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:28:35,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 6] total 9 [2019-09-10 03:28:35,832 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:35,832 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:28:35,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:28:35,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:28:35,833 INFO L87 Difference]: Start difference. First operand 18555 states and 23607 transitions. Second operand 6 states. [2019-09-10 03:28:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:35,901 INFO L93 Difference]: Finished difference Result 18555 states and 23591 transitions. [2019-09-10 03:28:35,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:28:35,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 560 [2019-09-10 03:28:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:35,932 INFO L225 Difference]: With dead ends: 18555 [2019-09-10 03:28:35,932 INFO L226 Difference]: Without dead ends: 18555 [2019-09-10 03:28:35,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1127 GetRequests, 1115 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:28:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18555 states. [2019-09-10 03:28:36,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18555 to 18539. [2019-09-10 03:28:36,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18539 states. [2019-09-10 03:28:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18539 states to 18539 states and 23575 transitions. [2019-09-10 03:28:36,353 INFO L78 Accepts]: Start accepts. Automaton has 18539 states and 23575 transitions. Word has length 560 [2019-09-10 03:28:36,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:36,353 INFO L475 AbstractCegarLoop]: Abstraction has 18539 states and 23575 transitions. [2019-09-10 03:28:36,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:28:36,353 INFO L276 IsEmpty]: Start isEmpty. Operand 18539 states and 23575 transitions. [2019-09-10 03:28:36,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-10 03:28:36,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:36,377 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:36,377 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1753284060, now seen corresponding path program 1 times [2019-09-10 03:28:36,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:36,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:36,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:28:36,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:36,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:36,507 INFO L134 CoverageAnalysis]: Checked inductivity of 459 backedges. 19 proven. 56 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2019-09-10 03:28:36,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:36,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:36,508 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 367 with the following transitions: [2019-09-10 03:28:36,509 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [259], [261], [264], [267], [269], [271], [272], [275], [277], [280], [294], [295], [296], [299], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [431], [433], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [471], [475], [478], [481], [488], [491], [501], [504], [516], [517], [531], [533], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:28:36,510 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:36,510 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:36,558 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:28:36,558 INFO L272 AbstractInterpreter]: Visited 145 different actions 228 times. Merged at 17 different actions 17 times. Never widened. Performed 1154 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1154 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 54 variables. [2019-09-10 03:28:36,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:36,558 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:28:36,683 INFO L227 lantSequenceWeakener]: Weakened 209 states. On average, predicates are now at 72.92% of their original sizes. [2019-09-10 03:28:36,684 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:28:40,271 INFO L420 sIntCurrentIteration]: We unified 365 AI predicates to 365 [2019-09-10 03:28:40,271 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:28:40,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:28:40,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [89] imperfect sequences [5] total 92 [2019-09-10 03:28:40,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:40,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-10 03:28:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-10 03:28:40,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=7358, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 03:28:40,275 INFO L87 Difference]: Start difference. First operand 18539 states and 23575 transitions. Second operand 89 states. [2019-09-10 03:29:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:29:25,218 INFO L93 Difference]: Finished difference Result 18615 states and 23737 transitions. [2019-09-10 03:29:25,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-10 03:29:25,218 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 366 [2019-09-10 03:29:25,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:29:25,249 INFO L225 Difference]: With dead ends: 18615 [2019-09-10 03:29:25,249 INFO L226 Difference]: Without dead ends: 18615 [2019-09-10 03:29:25,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11160 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2253, Invalid=32157, Unknown=0, NotChecked=0, Total=34410 [2019-09-10 03:29:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18615 states. [2019-09-10 03:29:25,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18615 to 18454. [2019-09-10 03:29:25,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18454 states. [2019-09-10 03:29:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18454 states to 18454 states and 23492 transitions. [2019-09-10 03:29:25,586 INFO L78 Accepts]: Start accepts. Automaton has 18454 states and 23492 transitions. Word has length 366 [2019-09-10 03:29:25,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:29:25,587 INFO L475 AbstractCegarLoop]: Abstraction has 18454 states and 23492 transitions. [2019-09-10 03:29:25,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-10 03:29:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18454 states and 23492 transitions. [2019-09-10 03:29:25,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2019-09-10 03:29:25,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:29:25,607 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2019-09-10 03:29:25,607 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:29:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:25,610 INFO L82 PathProgramCache]: Analyzing trace with hash 764260160, now seen corresponding path program 1 times [2019-09-10 03:29:25,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:29:25,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:25,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:29:25,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:25,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:29:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:29:25,763 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-09-10 03:29:25,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:29:25,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:29:25,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 369 with the following transitions: [2019-09-10 03:29:25,765 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [259], [261], [264], [267], [269], [271], [272], [275], [294], [295], [296], [299], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [431], [433], [435], [437], [439], [440], [441], [450], [453], [456], [462], [465], [468], [475], [478], [481], [488], [491], [501], [504], [516], [517], [531], [533], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [634], [635], [636] [2019-09-10 03:29:25,766 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:29:25,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:29:25,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:29:25,953 INFO L272 AbstractInterpreter]: Visited 151 different actions 439 times. Merged at 37 different actions 75 times. Never widened. Performed 3110 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 3 different actions. Largest state had 54 variables. [2019-09-10 03:29:25,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:25,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:29:25,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:29:25,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:29:25,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:29:25,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:29:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:29:26,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 1526 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:29:26,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:29:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 290 proven. 81 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-10 03:29:26,313 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:29:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2019-09-10 03:29:26,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:29:26,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-10 03:29:26,604 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:29:26,605 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:29:26,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:29:26,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:29:26,605 INFO L87 Difference]: Start difference. First operand 18454 states and 23492 transitions. Second operand 5 states. [2019-09-10 03:29:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:29:27,166 INFO L93 Difference]: Finished difference Result 20643 states and 26875 transitions. [2019-09-10 03:29:27,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:29:27,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 368 [2019-09-10 03:29:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:29:27,204 INFO L225 Difference]: With dead ends: 20643 [2019-09-10 03:29:27,204 INFO L226 Difference]: Without dead ends: 20643 [2019-09-10 03:29:27,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 729 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:29:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20643 states. [2019-09-10 03:29:27,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20643 to 19579. [2019-09-10 03:29:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19579 states. [2019-09-10 03:29:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19579 states to 19579 states and 25155 transitions. [2019-09-10 03:29:27,481 INFO L78 Accepts]: Start accepts. Automaton has 19579 states and 25155 transitions. Word has length 368 [2019-09-10 03:29:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:29:27,482 INFO L475 AbstractCegarLoop]: Abstraction has 19579 states and 25155 transitions. [2019-09-10 03:29:27,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:29:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 19579 states and 25155 transitions. [2019-09-10 03:29:27,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-09-10 03:29:27,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:29:27,499 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 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, 1] [2019-09-10 03:29:27,500 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:29:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:27,500 INFO L82 PathProgramCache]: Analyzing trace with hash -151849792, now seen corresponding path program 1 times [2019-09-10 03:29:27,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:29:27,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:27,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:29:27,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:27,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:29:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:29:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2019-09-10 03:29:27,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:29:27,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:29:27,683 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 491 with the following transitions: [2019-09-10 03:29:27,683 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [60], [62], [65], [76], [78], [80], [82], [86], [87], [92], [95], [97], [100], [104], [105], [106], [109], [112], [114], [116], [118], [120], [121], [126], [132], [138], [144], [150], [156], [162], [168], [170], [171], [174], [177], [179], [181], [183], [185], [186], [237], [238], [240], [243], [245], [248], [253], [256], [259], [261], [264], [267], [269], [271], [272], [275], [277], [280], [282], [287], [292], [294], [295], [296], [299], [304], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [360], [363], [369], [375], [381], [385], [388], [390], [393], [404], [406], [408], [412], [420], [423], [424], [425], [428], [431], [433], [435], [437], [439], [440], [441], [450], [453], [456], [458], [462], [465], [471], [475], [478], [488], [491], [501], [504], [515], [516], [517], [531], [533], [535], [537], [542], [550], [553], [558], [566], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [612], [613], [614], [615], [616], [617], [618], [619], [620], [621], [622], [623], [624], [625], [632], [633], [634], [635], [636] [2019-09-10 03:29:27,685 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:29:27,685 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:29:35,502 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:29:35,503 INFO L272 AbstractInterpreter]: Visited 206 different actions 37562 times. Merged at 98 different actions 12236 times. Widened at 3 different actions 18 times. Performed 174940 root evaluator evaluations with a maximum evaluation depth of 4. Performed 174940 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1549 fixpoints after 35 different actions. Largest state had 54 variables. [2019-09-10 03:29:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:35,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:29:35,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:29:35,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:29:35,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:29:35,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:29:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:29:35,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 1892 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:29:35,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:29:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-10 03:29:35,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:29:36,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:29:36,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:29:36,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:29:36,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:29:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 80 proven. 60 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2019-09-10 03:29:36,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:29:36,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 11 [2019-09-10 03:29:36,331 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:29:36,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:29:36,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:29:36,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:29:36,332 INFO L87 Difference]: Start difference. First operand 19579 states and 25155 transitions. Second operand 4 states. [2019-09-10 03:29:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:29:36,690 INFO L93 Difference]: Finished difference Result 6602 states and 7291 transitions. [2019-09-10 03:29:36,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:29:36,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 490 [2019-09-10 03:29:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:29:36,700 INFO L225 Difference]: With dead ends: 6602 [2019-09-10 03:29:36,700 INFO L226 Difference]: Without dead ends: 3373 [2019-09-10 03:29:36,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 987 GetRequests, 976 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:29:36,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2019-09-10 03:29:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3321. [2019-09-10 03:29:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2019-09-10 03:29:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 3662 transitions. [2019-09-10 03:29:36,731 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 3662 transitions. Word has length 490 [2019-09-10 03:29:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:29:36,731 INFO L475 AbstractCegarLoop]: Abstraction has 3321 states and 3662 transitions. [2019-09-10 03:29:36,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:29:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 3662 transitions. [2019-09-10 03:29:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-09-10 03:29:36,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:29:36,737 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:36,737 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:29:36,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:36,738 INFO L82 PathProgramCache]: Analyzing trace with hash 883178109, now seen corresponding path program 1 times [2019-09-10 03:29:36,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:29:36,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:36,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:29:36,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:36,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:29:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:29:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-09-10 03:29:36,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:29:36,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 03:29:36,987 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:29:36,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:29:36,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:29:36,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:29:36,988 INFO L87 Difference]: Start difference. First operand 3321 states and 3662 transitions. Second operand 8 states. [2019-09-10 03:29:39,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:29:39,419 INFO L93 Difference]: Finished difference Result 3373 states and 3730 transitions. [2019-09-10 03:29:39,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:29:39,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 374 [2019-09-10 03:29:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:29:39,420 INFO L225 Difference]: With dead ends: 3373 [2019-09-10 03:29:39,420 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 03:29:39,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:29:39,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 03:29:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 03:29:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 03:29:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 03:29:39,421 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 374 [2019-09-10 03:29:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:29:39,422 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 03:29:39,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:29:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 03:29:39,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 03:29:39,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:29:39 BoogieIcfgContainer [2019-09-10 03:29:39,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:29:39,428 INFO L168 Benchmark]: Toolchain (without parser) took 423465.18 ms. Allocated memory was 131.1 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 87.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 398.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:29:39,428 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 131.1 MB. Free memory was 105.7 MB in the beginning and 105.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:29:39,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.55 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 86.8 MB in the beginning and 171.7 MB in the end (delta: -84.9 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2019-09-10 03:29:39,429 INFO L168 Benchmark]: Boogie Preprocessor took 52.27 ms. Allocated memory is still 198.2 MB. Free memory was 171.7 MB in the beginning and 169.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:29:39,430 INFO L168 Benchmark]: RCFGBuilder took 752.90 ms. Allocated memory is still 198.2 MB. Free memory was 169.1 MB in the beginning and 126.1 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2019-09-10 03:29:39,431 INFO L168 Benchmark]: TraceAbstraction took 422123.81 ms. Allocated memory was 198.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 126.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 370.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:29:39,433 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.25 ms. Allocated memory is still 131.1 MB. Free memory was 105.7 MB in the beginning and 105.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 531.55 ms. Allocated memory was 131.1 MB in the beginning and 198.2 MB in the end (delta: 67.1 MB). Free memory was 86.8 MB in the beginning and 171.7 MB in the end (delta: -84.9 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.27 ms. Allocated memory is still 198.2 MB. Free memory was 171.7 MB in the beginning and 169.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 752.90 ms. Allocated memory is still 198.2 MB. Free memory was 169.1 MB in the beginning and 126.1 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 422123.81 ms. Allocated memory was 198.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 126.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 370.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 25 procedures, 204 locations, 1 error locations. SAFE Result, 422.0s OverallTime, 46 OverallIterations, 8 TraceHistogramMax, 363.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15891 SDtfs, 27172 SDslu, 104818 SDs, 0 SdLazy, 74475 SolverSat, 9362 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 48.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13263 GetRequests, 11540 SyntacticMatches, 45 SemanticMatches, 1678 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70356 ImplicationChecksByTransitivity, 53.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19579occurred in iteration=44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 12.0s AbstIntTime, 24 AbstIntIterations, 10 AbstIntStrong, 0.9915546920460515 AbsIntWeakeningRatio, 0.6024844720496895 AbsIntAvgWeakeningVarsNumRemoved, 22.789233954451344 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 46 MinimizatonAttempts, 3931 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 14742 NumberOfCodeBlocks, 14417 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 19552 ConstructedInterpolants, 0 QuantifiedInterpolants, 8380341 SizeOfPredicates, 22 NumberOfNonLiveVariables, 19660 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 76 InterpolantComputations, 38 PerfectInterpolantSequences, 18041/19287 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...