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/transmitter.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:31:58,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:31:58,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:31:58,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:31:58,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:31:58,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:31:58,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:31:58,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:31:58,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:31:58,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:31:58,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:31:58,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:31:58,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:31:58,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:31:58,799 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:31:58,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:31:58,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:31:58,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:31:58,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:31:58,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:31:58,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:31:58,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:31:58,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:31:58,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:31:58,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:31:58,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:31:58,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:31:58,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:31:58,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:31:58,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:31:58,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:31:58,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:31:58,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:31:58,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:31:58,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:31:58,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:31:58,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:31:58,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:31:58,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:31:58,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:31:58,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:31:58,826 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-20 13:31:58,841 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:31:58,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:31:58,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:31:58,842 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:31:58,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:31:58,843 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:31:58,843 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:31:58,843 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:31:58,843 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:31:58,844 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:31:58,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:31:58,845 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:31:58,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:31:58,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:31:58,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:31:58,846 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:31:58,846 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:31:58,846 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:31:58,846 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:31:58,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:31:58,847 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:31:58,847 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:31:58,847 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:31:58,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:31:58,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:31:58,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:31:58,848 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:31:58,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:31:58,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:31:58,849 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:31:58,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:31:58,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:31:58,897 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:31:58,901 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:31:58,901 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:31:58,902 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-09-20 13:31:58,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3df4013/61e0d02594ca4a6b9d512fbc8456ea67/FLAG4f449e689 [2019-09-20 13:31:59,486 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:31:59,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.03.cil.c [2019-09-20 13:31:59,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3df4013/61e0d02594ca4a6b9d512fbc8456ea67/FLAG4f449e689 [2019-09-20 13:31:59,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c3df4013/61e0d02594ca4a6b9d512fbc8456ea67 [2019-09-20 13:31:59,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:31:59,874 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:31:59,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:31:59,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:31:59,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:31:59,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48001f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:31:59, skipping insertion in model container [2019-09-20 13:31:59,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:31:59" (1/1) ... [2019-09-20 13:31:59,892 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:31:59,941 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:32:00,180 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:32:00,276 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:32:00,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:32:00,355 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:32:00,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:00 WrapperNode [2019-09-20 13:32:00,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:32:00,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:32:00,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:32:00,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:32:00,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:00" (1/1) ... [2019-09-20 13:32:00,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:00" (1/1) ... [2019-09-20 13:32:00,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:00" (1/1) ... [2019-09-20 13:32:00,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:00" (1/1) ... [2019-09-20 13:32:00,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:00" (1/1) ... [2019-09-20 13:32:00,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:00" (1/1) ... [2019-09-20 13:32:00,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:00" (1/1) ... [2019-09-20 13:32:00,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:32:00,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:32:00,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:32:00,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:32:00,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:00" (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-20 13:32:00,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:32:00,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:32:00,471 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-20 13:32:00,471 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-20 13:32:00,471 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-20 13:32:00,471 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-20 13:32:00,471 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-20 13:32:00,471 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-20 13:32:00,471 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-20 13:32:00,472 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-20 13:32:00,472 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-20 13:32:00,472 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-20 13:32:00,473 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-20 13:32:00,473 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-20 13:32:00,473 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-20 13:32:00,473 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-20 13:32:00,474 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-20 13:32:00,474 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-20 13:32:00,474 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-20 13:32:00,474 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-20 13:32:00,474 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-20 13:32:00,474 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-20 13:32:00,475 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-20 13:32:00,475 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-20 13:32:00,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:32:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:32:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:32:00,475 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-20 13:32:00,476 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-20 13:32:00,476 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-20 13:32:00,476 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-20 13:32:00,476 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-20 13:32:00,476 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-20 13:32:00,476 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-20 13:32:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-20 13:32:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-20 13:32:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-20 13:32:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-20 13:32:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-20 13:32:00,477 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-20 13:32:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-20 13:32:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-20 13:32:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-20 13:32:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-20 13:32:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-20 13:32:00,478 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-20 13:32:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-20 13:32:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-20 13:32:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-20 13:32:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:32:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:32:00,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:32:01,124 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:32:01,125 INFO L283 CfgBuilder]: Removed 7 assume(true) statements. [2019-09-20 13:32:01,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:32:01 BoogieIcfgContainer [2019-09-20 13:32:01,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:32:01,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:32:01,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:32:01,132 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:32:01,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:31:59" (1/3) ... [2019-09-20 13:32:01,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4516f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:32:01, skipping insertion in model container [2019-09-20 13:32:01,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:00" (2/3) ... [2019-09-20 13:32:01,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4516f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:32:01, skipping insertion in model container [2019-09-20 13:32:01,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:32:01" (3/3) ... [2019-09-20 13:32:01,137 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2019-09-20 13:32:01,148 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:32:01,157 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:32:01,175 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:32:01,205 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:32:01,205 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:32:01,205 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:32:01,205 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:32:01,206 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:32:01,206 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:32:01,206 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:32:01,206 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:32:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2019-09-20 13:32:01,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:01,248 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:01,249 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:01,252 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1961190691, now seen corresponding path program 1 times [2019-09-20 13:32:01,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:01,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:01,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:01,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:01,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:01,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:01,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:01,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:01,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:01,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:01,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:01,662 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 5 states. [2019-09-20 13:32:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:02,429 INFO L93 Difference]: Finished difference Result 234 states and 326 transitions. [2019-09-20 13:32:02,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:02,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:02,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:02,460 INFO L225 Difference]: With dead ends: 234 [2019-09-20 13:32:02,460 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:32:02,464 INFO L636 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-20 13:32:02,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:32:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2019-09-20 13:32:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:32:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 258 transitions. [2019-09-20 13:32:02,549 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 258 transitions. Word has length 105 [2019-09-20 13:32:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:02,550 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 258 transitions. [2019-09-20 13:32:02,550 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 258 transitions. [2019-09-20 13:32:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:02,554 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:02,554 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:02,555 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:02,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:02,555 INFO L82 PathProgramCache]: Analyzing trace with hash -767018655, now seen corresponding path program 1 times [2019-09-20 13:32:02,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:02,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:02,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:02,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:02,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:02,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:02,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:02,754 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:02,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:02,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:02,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:02,760 INFO L87 Difference]: Start difference. First operand 190 states and 258 transitions. Second operand 5 states. [2019-09-20 13:32:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:03,310 INFO L93 Difference]: Finished difference Result 222 states and 313 transitions. [2019-09-20 13:32:03,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:03,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:03,314 INFO L225 Difference]: With dead ends: 222 [2019-09-20 13:32:03,314 INFO L226 Difference]: Without dead ends: 222 [2019-09-20 13:32:03,315 INFO L636 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-20 13:32:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-20 13:32:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2019-09-20 13:32:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:32:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 257 transitions. [2019-09-20 13:32:03,332 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 257 transitions. Word has length 105 [2019-09-20 13:32:03,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:03,332 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 257 transitions. [2019-09-20 13:32:03,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 257 transitions. [2019-09-20 13:32:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:03,335 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:03,335 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:03,335 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1824856733, now seen corresponding path program 1 times [2019-09-20 13:32:03,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:03,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:03,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:03,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:03,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:03,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:03,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:03,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:03,465 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:03,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:03,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:03,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:03,466 INFO L87 Difference]: Start difference. First operand 190 states and 257 transitions. Second operand 5 states. [2019-09-20 13:32:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:03,889 INFO L93 Difference]: Finished difference Result 220 states and 308 transitions. [2019-09-20 13:32:03,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:03,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:03,893 INFO L225 Difference]: With dead ends: 220 [2019-09-20 13:32:03,893 INFO L226 Difference]: Without dead ends: 220 [2019-09-20 13:32:03,894 INFO L636 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-20 13:32:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-09-20 13:32:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 190. [2019-09-20 13:32:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:32:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 256 transitions. [2019-09-20 13:32:03,911 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 256 transitions. Word has length 105 [2019-09-20 13:32:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:03,911 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 256 transitions. [2019-09-20 13:32:03,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 256 transitions. [2019-09-20 13:32:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:03,914 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:03,914 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:03,914 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1327608097, now seen corresponding path program 1 times [2019-09-20 13:32:03,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:03,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:03,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:03,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:04,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:04,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:04,016 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:04,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:04,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:04,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:04,017 INFO L87 Difference]: Start difference. First operand 190 states and 256 transitions. Second operand 5 states. [2019-09-20 13:32:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:04,464 INFO L93 Difference]: Finished difference Result 218 states and 303 transitions. [2019-09-20 13:32:04,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:04,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:04,469 INFO L225 Difference]: With dead ends: 218 [2019-09-20 13:32:04,469 INFO L226 Difference]: Without dead ends: 218 [2019-09-20 13:32:04,470 INFO L636 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-20 13:32:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-20 13:32:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 190. [2019-09-20 13:32:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:32:04,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 255 transitions. [2019-09-20 13:32:04,483 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 255 transitions. Word has length 105 [2019-09-20 13:32:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:04,483 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 255 transitions. [2019-09-20 13:32:04,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:04,484 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 255 transitions. [2019-09-20 13:32:04,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:04,486 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:04,486 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:04,486 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:04,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:04,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1567847843, now seen corresponding path program 1 times [2019-09-20 13:32:04,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:04,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:04,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:04,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:04,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:04,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:04,579 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:04,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:04,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:04,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:04,580 INFO L87 Difference]: Start difference. First operand 190 states and 255 transitions. Second operand 5 states. [2019-09-20 13:32:05,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:05,002 INFO L93 Difference]: Finished difference Result 238 states and 336 transitions. [2019-09-20 13:32:05,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:05,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:05,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:05,008 INFO L225 Difference]: With dead ends: 238 [2019-09-20 13:32:05,009 INFO L226 Difference]: Without dead ends: 238 [2019-09-20 13:32:05,011 INFO L636 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-20 13:32:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-09-20 13:32:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 190. [2019-09-20 13:32:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:32:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 254 transitions. [2019-09-20 13:32:05,028 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 254 transitions. Word has length 105 [2019-09-20 13:32:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:05,029 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 254 transitions. [2019-09-20 13:32:05,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 254 transitions. [2019-09-20 13:32:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:05,031 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:05,031 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:05,031 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:05,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:05,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1888085791, now seen corresponding path program 1 times [2019-09-20 13:32:05,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:05,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:05,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:05,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:05,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:05,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:05,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:05,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:05,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:05,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:05,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:05,129 INFO L87 Difference]: Start difference. First operand 190 states and 254 transitions. Second operand 5 states. [2019-09-20 13:32:05,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:05,532 INFO L93 Difference]: Finished difference Result 236 states and 331 transitions. [2019-09-20 13:32:05,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:05,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:05,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:05,535 INFO L225 Difference]: With dead ends: 236 [2019-09-20 13:32:05,535 INFO L226 Difference]: Without dead ends: 236 [2019-09-20 13:32:05,535 INFO L636 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-20 13:32:05,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-09-20 13:32:05,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 190. [2019-09-20 13:32:05,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-09-20 13:32:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 253 transitions. [2019-09-20 13:32:05,546 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 253 transitions. Word has length 105 [2019-09-20 13:32:05,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:05,547 INFO L475 AbstractCegarLoop]: Abstraction has 190 states and 253 transitions. [2019-09-20 13:32:05,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 253 transitions. [2019-09-20 13:32:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:05,549 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:05,549 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:05,549 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:05,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:05,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1861020189, now seen corresponding path program 1 times [2019-09-20 13:32:05,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:05,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:05,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:05,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:05,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:05,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:05,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:32:05,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:05,647 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:32:05,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:32:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:32:05,648 INFO L87 Difference]: Start difference. First operand 190 states and 253 transitions. Second operand 4 states. [2019-09-20 13:32:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:05,867 INFO L93 Difference]: Finished difference Result 350 states and 463 transitions. [2019-09-20 13:32:05,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:32:05,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:32:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:05,870 INFO L225 Difference]: With dead ends: 350 [2019-09-20 13:32:05,870 INFO L226 Difference]: Without dead ends: 350 [2019-09-20 13:32:05,871 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-20 13:32:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-20 13:32:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 345. [2019-09-20 13:32:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-09-20 13:32:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 459 transitions. [2019-09-20 13:32:05,888 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 459 transitions. Word has length 105 [2019-09-20 13:32:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:05,888 INFO L475 AbstractCegarLoop]: Abstraction has 345 states and 459 transitions. [2019-09-20 13:32:05,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:32:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 459 transitions. [2019-09-20 13:32:05,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:05,890 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:05,890 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:05,891 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:05,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:05,891 INFO L82 PathProgramCache]: Analyzing trace with hash -723391324, now seen corresponding path program 1 times [2019-09-20 13:32:05,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:05,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:05,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:05,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:05,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:05,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:05,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:05,957 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:05,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:05,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:05,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:05,958 INFO L87 Difference]: Start difference. First operand 345 states and 459 transitions. Second operand 6 states. [2019-09-20 13:32:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:06,000 INFO L93 Difference]: Finished difference Result 361 states and 482 transitions. [2019-09-20 13:32:06,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:06,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-20 13:32:06,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:06,004 INFO L225 Difference]: With dead ends: 361 [2019-09-20 13:32:06,004 INFO L226 Difference]: Without dead ends: 361 [2019-09-20 13:32:06,004 INFO L636 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-20 13:32:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-09-20 13:32:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 350. [2019-09-20 13:32:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-09-20 13:32:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 463 transitions. [2019-09-20 13:32:06,021 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 463 transitions. Word has length 105 [2019-09-20 13:32:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:06,022 INFO L475 AbstractCegarLoop]: Abstraction has 350 states and 463 transitions. [2019-09-20 13:32:06,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 463 transitions. [2019-09-20 13:32:06,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:06,024 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:06,024 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:06,025 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:06,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:06,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1140787930, now seen corresponding path program 1 times [2019-09-20 13:32:06,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:06,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:06,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:06,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:06,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:06,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:06,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:06,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:06,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:06,106 INFO L87 Difference]: Start difference. First operand 350 states and 463 transitions. Second operand 6 states. [2019-09-20 13:32:06,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:06,143 INFO L93 Difference]: Finished difference Result 376 states and 502 transitions. [2019-09-20 13:32:06,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:06,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-20 13:32:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:06,149 INFO L225 Difference]: With dead ends: 376 [2019-09-20 13:32:06,149 INFO L226 Difference]: Without dead ends: 376 [2019-09-20 13:32:06,149 INFO L636 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-20 13:32:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-20 13:32:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 360. [2019-09-20 13:32:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:32:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 473 transitions. [2019-09-20 13:32:06,166 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 473 transitions. Word has length 105 [2019-09-20 13:32:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:06,166 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 473 transitions. [2019-09-20 13:32:06,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 473 transitions. [2019-09-20 13:32:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:06,168 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:06,168 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:06,169 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:06,169 INFO L82 PathProgramCache]: Analyzing trace with hash -264768924, now seen corresponding path program 1 times [2019-09-20 13:32:06,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:06,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:06,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:06,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:06,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:06,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:06,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:06,235 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:06,235 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:06,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:06,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:06,236 INFO L87 Difference]: Start difference. First operand 360 states and 473 transitions. Second operand 6 states. [2019-09-20 13:32:06,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:06,270 INFO L93 Difference]: Finished difference Result 380 states and 502 transitions. [2019-09-20 13:32:06,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:06,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-20 13:32:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:06,274 INFO L225 Difference]: With dead ends: 380 [2019-09-20 13:32:06,274 INFO L226 Difference]: Without dead ends: 380 [2019-09-20 13:32:06,275 INFO L636 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-20 13:32:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-20 13:32:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 370. [2019-09-20 13:32:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-20 13:32:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 483 transitions. [2019-09-20 13:32:06,290 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 483 transitions. Word has length 105 [2019-09-20 13:32:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:06,291 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 483 transitions. [2019-09-20 13:32:06,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 483 transitions. [2019-09-20 13:32:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:06,293 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:06,293 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:06,294 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:06,294 INFO L82 PathProgramCache]: Analyzing trace with hash 628717414, now seen corresponding path program 1 times [2019-09-20 13:32:06,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:06,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:06,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:06,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:06,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:06,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:06,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:06,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:06,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:06,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:06,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:06,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:06,360 INFO L87 Difference]: Start difference. First operand 370 states and 483 transitions. Second operand 6 states. [2019-09-20 13:32:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:06,392 INFO L93 Difference]: Finished difference Result 384 states and 502 transitions. [2019-09-20 13:32:06,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:06,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2019-09-20 13:32:06,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:06,396 INFO L225 Difference]: With dead ends: 384 [2019-09-20 13:32:06,396 INFO L226 Difference]: Without dead ends: 384 [2019-09-20 13:32:06,397 INFO L636 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-20 13:32:06,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-20 13:32:06,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2019-09-20 13:32:06,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-20 13:32:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 493 transitions. [2019-09-20 13:32:06,411 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 493 transitions. Word has length 105 [2019-09-20 13:32:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:06,412 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 493 transitions. [2019-09-20 13:32:06,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 493 transitions. [2019-09-20 13:32:06,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:06,414 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:06,414 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:06,415 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:06,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:06,415 INFO L82 PathProgramCache]: Analyzing trace with hash 234350628, now seen corresponding path program 1 times [2019-09-20 13:32:06,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:06,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:06,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:06,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:06,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:06,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:06,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:06,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:06,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:06,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:06,503 INFO L87 Difference]: Start difference. First operand 380 states and 493 transitions. Second operand 5 states. [2019-09-20 13:32:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:07,031 INFO L93 Difference]: Finished difference Result 539 states and 700 transitions. [2019-09-20 13:32:07,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:32:07,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:07,036 INFO L225 Difference]: With dead ends: 539 [2019-09-20 13:32:07,036 INFO L226 Difference]: Without dead ends: 539 [2019-09-20 13:32:07,036 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:32:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-20 13:32:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 499. [2019-09-20 13:32:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-20 13:32:07,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 635 transitions. [2019-09-20 13:32:07,055 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 635 transitions. Word has length 105 [2019-09-20 13:32:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:07,056 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 635 transitions. [2019-09-20 13:32:07,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 635 transitions. [2019-09-20 13:32:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:07,057 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:07,058 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:07,058 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:07,058 INFO L82 PathProgramCache]: Analyzing trace with hash 509110242, now seen corresponding path program 1 times [2019-09-20 13:32:07,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:07,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:07,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:07,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:07,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:07,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:07,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:07,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:07,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:07,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:07,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:07,144 INFO L87 Difference]: Start difference. First operand 499 states and 635 transitions. Second operand 5 states. [2019-09-20 13:32:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:07,652 INFO L93 Difference]: Finished difference Result 499 states and 630 transitions. [2019-09-20 13:32:07,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:07,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:07,656 INFO L225 Difference]: With dead ends: 499 [2019-09-20 13:32:07,656 INFO L226 Difference]: Without dead ends: 499 [2019-09-20 13:32:07,657 INFO L636 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-20 13:32:07,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-20 13:32:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-09-20 13:32:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-20 13:32:07,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 630 transitions. [2019-09-20 13:32:07,673 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 630 transitions. Word has length 105 [2019-09-20 13:32:07,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:07,674 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 630 transitions. [2019-09-20 13:32:07,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:07,674 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 630 transitions. [2019-09-20 13:32:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:07,675 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:07,676 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:07,676 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:07,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:07,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1210710116, now seen corresponding path program 1 times [2019-09-20 13:32:07,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:07,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:07,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:07,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:07,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:07,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:07,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:07,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:07,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:07,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:07,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:07,763 INFO L87 Difference]: Start difference. First operand 499 states and 630 transitions. Second operand 5 states. [2019-09-20 13:32:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:08,196 INFO L93 Difference]: Finished difference Result 499 states and 625 transitions. [2019-09-20 13:32:08,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:08,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:08,200 INFO L225 Difference]: With dead ends: 499 [2019-09-20 13:32:08,200 INFO L226 Difference]: Without dead ends: 499 [2019-09-20 13:32:08,202 INFO L636 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-20 13:32:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-09-20 13:32:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-09-20 13:32:08,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-09-20 13:32:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 625 transitions. [2019-09-20 13:32:08,218 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 625 transitions. Word has length 105 [2019-09-20 13:32:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:08,219 INFO L475 AbstractCegarLoop]: Abstraction has 499 states and 625 transitions. [2019-09-20 13:32:08,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 625 transitions. [2019-09-20 13:32:08,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:08,220 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:08,220 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:08,221 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:08,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:08,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1233342370, now seen corresponding path program 1 times [2019-09-20 13:32:08,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:08,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:08,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:08,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:08,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:08,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:08,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:08,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:08,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:08,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:08,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:08,304 INFO L87 Difference]: Start difference. First operand 499 states and 625 transitions. Second operand 5 states. [2019-09-20 13:32:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:08,911 INFO L93 Difference]: Finished difference Result 596 states and 738 transitions. [2019-09-20 13:32:08,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:08,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:08,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:08,916 INFO L225 Difference]: With dead ends: 596 [2019-09-20 13:32:08,917 INFO L226 Difference]: Without dead ends: 596 [2019-09-20 13:32:08,917 INFO L636 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-20 13:32:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-20 13:32:08,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 561. [2019-09-20 13:32:08,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-09-20 13:32:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 697 transitions. [2019-09-20 13:32:08,938 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 697 transitions. Word has length 105 [2019-09-20 13:32:08,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:08,939 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 697 transitions. [2019-09-20 13:32:08,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 697 transitions. [2019-09-20 13:32:08,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:08,942 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:08,942 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:08,942 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:08,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:08,943 INFO L82 PathProgramCache]: Analyzing trace with hash 723869280, now seen corresponding path program 1 times [2019-09-20 13:32:08,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:08,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:08,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:08,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:09,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:09,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:09,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:09,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:09,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:09,015 INFO L87 Difference]: Start difference. First operand 561 states and 697 transitions. Second operand 5 states. [2019-09-20 13:32:09,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:09,551 INFO L93 Difference]: Finished difference Result 786 states and 1006 transitions. [2019-09-20 13:32:09,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:09,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:09,557 INFO L225 Difference]: With dead ends: 786 [2019-09-20 13:32:09,558 INFO L226 Difference]: Without dead ends: 786 [2019-09-20 13:32:09,558 INFO L636 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-20 13:32:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2019-09-20 13:32:09,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 647. [2019-09-20 13:32:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-09-20 13:32:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 786 transitions. [2019-09-20 13:32:09,581 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 786 transitions. Word has length 105 [2019-09-20 13:32:09,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:09,581 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 786 transitions. [2019-09-20 13:32:09,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 786 transitions. [2019-09-20 13:32:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:09,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:09,583 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:09,583 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:09,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:09,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1647869982, now seen corresponding path program 1 times [2019-09-20 13:32:09,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:09,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:09,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:09,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:09,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:09,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:09,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:09,704 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:09,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:09,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:09,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:09,705 INFO L87 Difference]: Start difference. First operand 647 states and 786 transitions. Second operand 5 states. [2019-09-20 13:32:10,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:10,230 INFO L93 Difference]: Finished difference Result 849 states and 1077 transitions. [2019-09-20 13:32:10,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:32:10,231 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-09-20 13:32:10,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:10,236 INFO L225 Difference]: With dead ends: 849 [2019-09-20 13:32:10,237 INFO L226 Difference]: Without dead ends: 849 [2019-09-20 13:32:10,237 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:32:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2019-09-20 13:32:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 739. [2019-09-20 13:32:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-09-20 13:32:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 886 transitions. [2019-09-20 13:32:10,264 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 886 transitions. Word has length 105 [2019-09-20 13:32:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:10,264 INFO L475 AbstractCegarLoop]: Abstraction has 739 states and 886 transitions. [2019-09-20 13:32:10,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 886 transitions. [2019-09-20 13:32:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:32:10,266 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:10,266 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:10,266 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1585830368, now seen corresponding path program 1 times [2019-09-20 13:32:10,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:10,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:10,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:10,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:10,311 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:10,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:10,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:10,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:10,312 INFO L87 Difference]: Start difference. First operand 739 states and 886 transitions. Second operand 3 states. [2019-09-20 13:32:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:10,338 INFO L93 Difference]: Finished difference Result 1385 states and 1668 transitions. [2019-09-20 13:32:10,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:10,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-20 13:32:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:10,346 INFO L225 Difference]: With dead ends: 1385 [2019-09-20 13:32:10,346 INFO L226 Difference]: Without dead ends: 1385 [2019-09-20 13:32:10,347 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-09-20 13:32:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1382. [2019-09-20 13:32:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1382 states. [2019-09-20 13:32:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1666 transitions. [2019-09-20 13:32:10,391 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1666 transitions. Word has length 105 [2019-09-20 13:32:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:10,392 INFO L475 AbstractCegarLoop]: Abstraction has 1382 states and 1666 transitions. [2019-09-20 13:32:10,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1666 transitions. [2019-09-20 13:32:10,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:32:10,394 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:10,394 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:10,394 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:10,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1038281626, now seen corresponding path program 1 times [2019-09-20 13:32:10,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:10,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:32:10,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:10,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:10,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:10,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:10,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:10,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:10,454 INFO L87 Difference]: Start difference. First operand 1382 states and 1666 transitions. Second operand 3 states. [2019-09-20 13:32:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:10,485 INFO L93 Difference]: Finished difference Result 2649 states and 3246 transitions. [2019-09-20 13:32:10,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:10,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-20 13:32:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:10,498 INFO L225 Difference]: With dead ends: 2649 [2019-09-20 13:32:10,499 INFO L226 Difference]: Without dead ends: 2649 [2019-09-20 13:32:10,500 INFO L636 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-20 13:32:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2019-09-20 13:32:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2643. [2019-09-20 13:32:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-09-20 13:32:10,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 3237 transitions. [2019-09-20 13:32:10,609 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 3237 transitions. Word has length 106 [2019-09-20 13:32:10,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:10,613 INFO L475 AbstractCegarLoop]: Abstraction has 2643 states and 3237 transitions. [2019-09-20 13:32:10,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 3237 transitions. [2019-09-20 13:32:10,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-20 13:32:10,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:10,619 INFO L407 BasicCegarLoop]: trace histogram [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-20 13:32:10,619 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:10,620 INFO L82 PathProgramCache]: Analyzing trace with hash -941553424, now seen corresponding path program 1 times [2019-09-20 13:32:10,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:10,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:10,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-20 13:32:10,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:10,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:10,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:10,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:10,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:10,695 INFO L87 Difference]: Start difference. First operand 2643 states and 3237 transitions. Second operand 3 states. [2019-09-20 13:32:10,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:10,774 INFO L93 Difference]: Finished difference Result 5206 states and 6412 transitions. [2019-09-20 13:32:10,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:10,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-20 13:32:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:10,802 INFO L225 Difference]: With dead ends: 5206 [2019-09-20 13:32:10,803 INFO L226 Difference]: Without dead ends: 3927 [2019-09-20 13:32:10,803 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2019-09-20 13:32:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3927. [2019-09-20 13:32:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3927 states. [2019-09-20 13:32:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 4801 transitions. [2019-09-20 13:32:10,958 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 4801 transitions. Word has length 127 [2019-09-20 13:32:10,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:10,958 INFO L475 AbstractCegarLoop]: Abstraction has 3927 states and 4801 transitions. [2019-09-20 13:32:10,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:10,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 4801 transitions. [2019-09-20 13:32:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-20 13:32:10,967 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:10,967 INFO L407 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, 1, 1, 1, 1] [2019-09-20 13:32:10,968 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:10,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:10,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1911837015, now seen corresponding path program 1 times [2019-09-20 13:32:10,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:10,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:10,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-20 13:32:11,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:11,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:11,042 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:11,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:11,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:11,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:11,044 INFO L87 Difference]: Start difference. First operand 3927 states and 4801 transitions. Second operand 3 states. [2019-09-20 13:32:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:11,112 INFO L93 Difference]: Finished difference Result 7649 states and 9540 transitions. [2019-09-20 13:32:11,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:11,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-20 13:32:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:11,161 INFO L225 Difference]: With dead ends: 7649 [2019-09-20 13:32:11,161 INFO L226 Difference]: Without dead ends: 7649 [2019-09-20 13:32:11,162 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:11,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7649 states. [2019-09-20 13:32:11,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7649 to 7646. [2019-09-20 13:32:11,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7646 states. [2019-09-20 13:32:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7646 states to 7646 states and 9538 transitions. [2019-09-20 13:32:11,536 INFO L78 Accepts]: Start accepts. Automaton has 7646 states and 9538 transitions. Word has length 180 [2019-09-20 13:32:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:11,537 INFO L475 AbstractCegarLoop]: Abstraction has 7646 states and 9538 transitions. [2019-09-20 13:32:11,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 7646 states and 9538 transitions. [2019-09-20 13:32:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-20 13:32:11,551 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:11,551 INFO L407 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, 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] [2019-09-20 13:32:11,551 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:11,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:11,552 INFO L82 PathProgramCache]: Analyzing trace with hash -875605821, now seen corresponding path program 1 times [2019-09-20 13:32:11,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:11,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:11,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:11,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:11,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-20 13:32:11,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:11,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:11,654 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2019-09-20 13:32:11,657 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [55], [60], [63], [74], [76], [78], [80], [84], [85], [90], [104], [114], [116], [118], [119], [124], [130], [136], [142], [148], [154], [160], [162], [163], [173], [175], [177], [178], [223], [224], [226], [231], [234], [239], [242], [247], [250], [253], [255], [257], [258], [261], [280], [281], [282], [292], [294], [296], [297], [302], [308], [314], [320], [326], [332], [338], [340], [343], [349], [355], [361], [365], [410], [411], [412], [415], [418], [422], [424], [426], [427], [428], [437], [440], [443], [449], [455], [471], [475], [478], [481], [488], [491], [503], [504], [518], [520], [553], [554], [557], [559], [560], [561], [562], [563], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [579], [580], [585], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [599], [619], [620], [621] [2019-09-20 13:32:11,702 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:11,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:11,928 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:32:11,930 INFO L272 AbstractInterpreter]: Visited 100 different actions 100 times. Never merged. Never widened. Performed 371 root evaluator evaluations with a maximum evaluation depth of 4. Performed 371 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 46 variables. [2019-09-20 13:32:11,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:11,936 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:32:12,165 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 66.19% of their original sizes. [2019-09-20 13:32:12,166 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:32:13,227 INFO L420 sIntCurrentIteration]: We unified 180 AI predicates to 180 [2019-09-20 13:32:13,227 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:32:13,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:32:13,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [6] total 47 [2019-09-20 13:32:13,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:13,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-20 13:32:13,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-20 13:32:13,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2019-09-20 13:32:13,231 INFO L87 Difference]: Start difference. First operand 7646 states and 9538 transitions. Second operand 43 states. [2019-09-20 13:32:20,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:20,706 INFO L93 Difference]: Finished difference Result 6224 states and 7633 transitions. [2019-09-20 13:32:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-20 13:32:20,706 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 181 [2019-09-20 13:32:20,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:20,753 INFO L225 Difference]: With dead ends: 6224 [2019-09-20 13:32:20,754 INFO L226 Difference]: Without dead ends: 6224 [2019-09-20 13:32:20,757 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=974, Invalid=4138, Unknown=0, NotChecked=0, Total=5112 [2019-09-20 13:32:20,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6224 states. [2019-09-20 13:32:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6224 to 6032. [2019-09-20 13:32:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6032 states. [2019-09-20 13:32:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6032 states to 6032 states and 7426 transitions. [2019-09-20 13:32:20,937 INFO L78 Accepts]: Start accepts. Automaton has 6032 states and 7426 transitions. Word has length 181 [2019-09-20 13:32:20,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:20,937 INFO L475 AbstractCegarLoop]: Abstraction has 6032 states and 7426 transitions. [2019-09-20 13:32:20,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-20 13:32:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 6032 states and 7426 transitions. [2019-09-20 13:32:20,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-20 13:32:20,947 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:20,947 INFO L407 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, 1, 1, 1, 1, 1, 1] [2019-09-20 13:32:20,947 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:20,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:20,948 INFO L82 PathProgramCache]: Analyzing trace with hash -844623606, now seen corresponding path program 1 times [2019-09-20 13:32:20,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:20,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:20,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:20,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:20,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-20 13:32:21,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:21,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:21,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:21,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:21,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:21,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:21,027 INFO L87 Difference]: Start difference. First operand 6032 states and 7426 transitions. Second operand 3 states. [2019-09-20 13:32:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:21,097 INFO L93 Difference]: Finished difference Result 10759 states and 13765 transitions. [2019-09-20 13:32:21,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:21,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 182 [2019-09-20 13:32:21,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:21,157 INFO L225 Difference]: With dead ends: 10759 [2019-09-20 13:32:21,157 INFO L226 Difference]: Without dead ends: 10759 [2019-09-20 13:32:21,158 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10759 states. [2019-09-20 13:32:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10759 to 10750. [2019-09-20 13:32:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10750 states. [2019-09-20 13:32:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10750 states to 10750 states and 13757 transitions. [2019-09-20 13:32:21,511 INFO L78 Accepts]: Start accepts. Automaton has 10750 states and 13757 transitions. Word has length 182 [2019-09-20 13:32:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:21,512 INFO L475 AbstractCegarLoop]: Abstraction has 10750 states and 13757 transitions. [2019-09-20 13:32:21,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 10750 states and 13757 transitions. [2019-09-20 13:32:21,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-20 13:32:21,525 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:21,525 INFO L407 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, 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] [2019-09-20 13:32:21,526 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1873142595, now seen corresponding path program 1 times [2019-09-20 13:32:21,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:21,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:21,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:21,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-20 13:32:21,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:21,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:21,635 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2019-09-20 13:32:21,637 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [55], [60], [63], [74], [76], [78], [80], [84], [85], [90], [104], [114], [116], [118], [119], [124], [130], [136], [142], [148], [154], [160], [162], [163], [173], [175], [177], [178], [223], [224], [226], [231], [234], [239], [242], [247], [250], [253], [255], [257], [258], [261], [280], [281], [282], [292], [294], [296], [297], [302], [308], [314], [320], [326], [332], [338], [340], [343], [349], [355], [361], [365], [410], [411], [412], [415], [418], [422], [424], [426], [427], [428], [437], [440], [443], [449], [455], [462], [468], [475], [478], [481], [488], [491], [503], [504], [518], [520], [553], [554], [557], [559], [560], [561], [562], [563], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [579], [580], [585], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [599], [619], [620], [621] [2019-09-20 13:32:21,652 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:21,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:21,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:32:21,777 INFO L272 AbstractInterpreter]: Visited 118 different actions 145 times. Merged at 14 different actions 14 times. Never widened. Performed 663 root evaluator evaluations with a maximum evaluation depth of 4. Performed 663 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2019-09-20 13:32:21,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:21,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:32:21,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:21,779 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-20 13:32:21,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:21,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:32:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:21,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-20 13:32:21,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:32:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-20 13:32:22,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:32:22,394 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-20 13:32:22,408 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:32:22,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-09-20 13:32:22,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:22,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:22,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:22,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:32:22,409 INFO L87 Difference]: Start difference. First operand 10750 states and 13757 transitions. Second operand 3 states. [2019-09-20 13:32:22,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:22,554 INFO L93 Difference]: Finished difference Result 20834 states and 27618 transitions. [2019-09-20 13:32:22,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:22,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-09-20 13:32:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:22,652 INFO L225 Difference]: With dead ends: 20834 [2019-09-20 13:32:22,652 INFO L226 Difference]: Without dead ends: 20834 [2019-09-20 13:32:22,653 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:32:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20834 states. [2019-09-20 13:32:23,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20834 to 20795. [2019-09-20 13:32:23,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20795 states. [2019-09-20 13:32:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20795 states to 20795 states and 27580 transitions. [2019-09-20 13:32:23,659 INFO L78 Accepts]: Start accepts. Automaton has 20795 states and 27580 transitions. Word has length 183 [2019-09-20 13:32:23,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:23,660 INFO L475 AbstractCegarLoop]: Abstraction has 20795 states and 27580 transitions. [2019-09-20 13:32:23,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand 20795 states and 27580 transitions. [2019-09-20 13:32:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-20 13:32:23,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:23,677 INFO L407 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, 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-20 13:32:23,678 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:23,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:23,678 INFO L82 PathProgramCache]: Analyzing trace with hash 403198, now seen corresponding path program 1 times [2019-09-20 13:32:23,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:23,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:23,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:23,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:23,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-20 13:32:24,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:24,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:24,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 185 with the following transitions: [2019-09-20 13:32:24,406 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [55], [60], [63], [74], [76], [78], [80], [84], [85], [90], [104], [107], [112], [114], [116], [118], [119], [124], [130], [136], [142], [148], [154], [160], [162], [163], [173], [175], [177], [178], [223], [224], [226], [231], [234], [239], [242], [247], [250], [253], [255], [257], [258], [261], [280], [281], [282], [292], [294], [296], [297], [302], [308], [314], [320], [326], [332], [338], [340], [343], [349], [355], [361], [365], [410], [411], [412], [415], [418], [422], [424], [426], [427], [428], [437], [440], [443], [449], [455], [462], [468], [475], [478], [481], [488], [491], [503], [504], [518], [520], [553], [554], [557], [559], [560], [561], [562], [563], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [579], [580], [585], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [599], [619], [620], [621] [2019-09-20 13:32:24,409 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:24,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:24,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:32:24,454 INFO L272 AbstractInterpreter]: Visited 119 different actions 146 times. Merged at 14 different actions 14 times. Never widened. Performed 664 root evaluator evaluations with a maximum evaluation depth of 4. Performed 664 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2019-09-20 13:32:24,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:24,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:32:24,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:24,454 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-20 13:32:24,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:24,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:32:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:24,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 13:32:24,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:32:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 38 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-20 13:32:24,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:32:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-20 13:32:24,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:32:24,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-20 13:32:24,969 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:24,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:24,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:24,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:32:24,970 INFO L87 Difference]: Start difference. First operand 20795 states and 27580 transitions. Second operand 5 states. [2019-09-20 13:32:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:25,702 INFO L93 Difference]: Finished difference Result 22342 states and 29063 transitions. [2019-09-20 13:32:25,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:25,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 184 [2019-09-20 13:32:25,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:25,811 INFO L225 Difference]: With dead ends: 22342 [2019-09-20 13:32:25,811 INFO L226 Difference]: Without dead ends: 22342 [2019-09-20 13:32:25,811 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 361 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-20 13:32:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22342 states. [2019-09-20 13:32:26,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22342 to 22213. [2019-09-20 13:32:26,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22213 states. [2019-09-20 13:32:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22213 states to 22213 states and 28710 transitions. [2019-09-20 13:32:26,693 INFO L78 Accepts]: Start accepts. Automaton has 22213 states and 28710 transitions. Word has length 184 [2019-09-20 13:32:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:26,693 INFO L475 AbstractCegarLoop]: Abstraction has 22213 states and 28710 transitions. [2019-09-20 13:32:26,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 22213 states and 28710 transitions. [2019-09-20 13:32:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-09-20 13:32:26,717 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:26,718 INFO L407 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, 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] [2019-09-20 13:32:26,718 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:26,719 INFO L82 PathProgramCache]: Analyzing trace with hash 2051333290, now seen corresponding path program 1 times [2019-09-20 13:32:26,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:26,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:26,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:26,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:26,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 7 proven. 28 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-09-20 13:32:26,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:26,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:26,842 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 244 with the following transitions: [2019-09-20 13:32:26,842 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [55], [58], [60], [63], [74], [76], [78], [80], [84], [85], [90], [104], [107], [110], [112], [114], [116], [118], [119], [124], [130], [136], [142], [148], [154], [160], [162], [163], [173], [175], [177], [178], [223], [224], [226], [231], [234], [239], [242], [245], [247], [250], [253], [255], [257], [258], [261], [280], [281], [282], [292], [294], [296], [297], [302], [308], [314], [320], [326], [332], [338], [340], [343], [349], [355], [361], [365], [410], [411], [412], [415], [418], [420], [422], [424], [426], [427], [428], [437], [440], [443], [449], [455], [462], [465], [468], [475], [478], [488], [491], [503], [504], [518], [520], [553], [554], [555], [556], [557], [559], [560], [561], [562], [563], [567], [568], [569], [570], [571], [572], [573], [574], [575], [576], [579], [580], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [599], [619], [620], [621] [2019-09-20 13:32:26,847 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:26,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:26,900 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:32:26,901 INFO L272 AbstractInterpreter]: Visited 124 different actions 141 times. Merged at 10 different actions 10 times. Never widened. Performed 716 root evaluator evaluations with a maximum evaluation depth of 4. Performed 716 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2019-09-20 13:32:26,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:26,902 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:32:27,063 INFO L227 lantSequenceWeakener]: Weakened 140 states. On average, predicates are now at 70.39% of their original sizes. [2019-09-20 13:32:27,063 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:32:28,925 INFO L420 sIntCurrentIteration]: We unified 242 AI predicates to 242 [2019-09-20 13:32:28,925 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:32:28,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:32:28,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [60] imperfect sequences [6] total 64 [2019-09-20 13:32:28,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:28,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-20 13:32:28,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-20 13:32:28,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=2935, Unknown=0, NotChecked=0, Total=3540 [2019-09-20 13:32:28,929 INFO L87 Difference]: Start difference. First operand 22213 states and 28710 transitions. Second operand 60 states.