java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:10:07,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:10:07,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:10:07,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:10:07,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:10:07,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:10:07,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:10:07,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:10:07,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:10:07,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:10:07,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:10:07,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:10:07,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:10:07,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:10:07,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:10:07,157 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:10:07,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:10:07,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:10:07,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:10:07,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:10:07,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:10:07,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:10:07,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:10:07,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:10:07,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:10:07,171 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:10:07,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:10:07,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:10:07,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:10:07,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:10:07,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:10:07,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:10:07,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:10:07,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:10:07,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:10:07,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:10:07,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:10:07,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:10:07,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:10:07,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:10:07,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:10:07,182 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-16 17:10:07,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:10:07,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:10:07,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:10:07,198 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:10:07,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:10:07,199 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:10:07,199 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:10:07,199 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:10:07,200 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:10:07,200 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:10:07,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:10:07,201 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:10:07,201 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:10:07,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:10:07,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:10:07,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:10:07,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:10:07,202 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:10:07,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:10:07,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:10:07,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:10:07,203 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:10:07,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:10:07,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:10:07,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:10:07,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:10:07,204 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:10:07,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:10:07,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:10:07,204 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:10:07,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:10:07,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:10:07,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:10:07,256 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:10:07,257 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:10:07,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-09-16 17:10:07,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cf6d591/0e7039aef737473794b6f0f3ddbf4ccc/FLAGa47bd91f6 [2019-09-16 17:10:07,837 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:10:07,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.02.cil-1.c [2019-09-16 17:10:07,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cf6d591/0e7039aef737473794b6f0f3ddbf4ccc/FLAGa47bd91f6 [2019-09-16 17:10:08,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cf6d591/0e7039aef737473794b6f0f3ddbf4ccc [2019-09-16 17:10:08,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:10:08,227 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:10:08,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:10:08,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:10:08,232 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:10:08,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:10:08" (1/1) ... [2019-09-16 17:10:08,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309730f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08, skipping insertion in model container [2019-09-16 17:10:08,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:10:08" (1/1) ... [2019-09-16 17:10:08,249 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:10:08,300 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:10:08,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:10:08,665 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:10:08,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:10:08,734 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:10:08,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08 WrapperNode [2019-09-16 17:10:08,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:10:08,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:10:08,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:10:08,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:10:08,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08" (1/1) ... [2019-09-16 17:10:08,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08" (1/1) ... [2019-09-16 17:10:08,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08" (1/1) ... [2019-09-16 17:10:08,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08" (1/1) ... [2019-09-16 17:10:08,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08" (1/1) ... [2019-09-16 17:10:08,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08" (1/1) ... [2019-09-16 17:10:08,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08" (1/1) ... [2019-09-16 17:10:08,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:10:08,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:10:08,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:10:08,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:10:08,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08" (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-16 17:10:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:10:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:10:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-16 17:10:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-16 17:10:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-16 17:10:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-16 17:10:08,844 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-16 17:10:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-16 17:10:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-16 17:10:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-16 17:10:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-16 17:10:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-16 17:10:08,845 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-16 17:10:08,846 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-16 17:10:08,846 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-16 17:10:08,846 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-16 17:10:08,846 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-16 17:10:08,846 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-16 17:10:08,846 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-16 17:10:08,847 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-16 17:10:08,847 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-16 17:10:08,847 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-16 17:10:08,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:10:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:10:08,847 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-16 17:10:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-16 17:10:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-16 17:10:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-16 17:10:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-16 17:10:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:10:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-16 17:10:08,853 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-16 17:10:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-16 17:10:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-16 17:10:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-16 17:10:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-16 17:10:08,855 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-16 17:10:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-16 17:10:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-16 17:10:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-16 17:10:08,856 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-16 17:10:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-16 17:10:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-16 17:10:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-16 17:10:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-16 17:10:08,857 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:10:08,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:10:08,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:10:09,480 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:10:09,480 INFO L283 CfgBuilder]: Removed 5 assume(true) statements. [2019-09-16 17:10:09,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:10:09 BoogieIcfgContainer [2019-09-16 17:10:09,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:10:09,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:10:09,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:10:09,487 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:10:09,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:10:08" (1/3) ... [2019-09-16 17:10:09,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17098e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:10:09, skipping insertion in model container [2019-09-16 17:10:09,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:08" (2/3) ... [2019-09-16 17:10:09,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17098e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:10:09, skipping insertion in model container [2019-09-16 17:10:09,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:10:09" (3/3) ... [2019-09-16 17:10:09,491 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-1.c [2019-09-16 17:10:09,502 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:10:09,511 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:10:09,531 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:10:09,562 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:10:09,562 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:10:09,562 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:10:09,562 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:10:09,563 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:10:09,563 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:10:09,563 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:10:09,564 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:10:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-09-16 17:10:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 17:10:09,603 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:09,604 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] [2019-09-16 17:10:09,607 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:09,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:09,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1715943758, now seen corresponding path program 1 times [2019-09-16 17:10:09,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:09,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:09,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:09,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:09,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:10,057 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-16 17:10:10,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:10,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:10,061 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:10,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:10,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:10,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:10,095 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2019-09-16 17:10:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:10,806 INFO L93 Difference]: Finished difference Result 207 states and 287 transitions. [2019-09-16 17:10:10,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:10,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 17:10:10,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:10,825 INFO L225 Difference]: With dead ends: 207 [2019-09-16 17:10:10,825 INFO L226 Difference]: Without dead ends: 195 [2019-09-16 17:10:10,827 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-16 17:10:10,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-16 17:10:10,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 165. [2019-09-16 17:10:10,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 17:10:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 222 transitions. [2019-09-16 17:10:10,896 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 222 transitions. Word has length 91 [2019-09-16 17:10:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:10,897 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 222 transitions. [2019-09-16 17:10:10,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 222 transitions. [2019-09-16 17:10:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 17:10:10,902 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:10,903 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] [2019-09-16 17:10:10,903 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:10,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1625083380, now seen corresponding path program 1 times [2019-09-16 17:10:10,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:10,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:10,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:11,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:11,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:11,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:11,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:11,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:11,031 INFO L87 Difference]: Start difference. First operand 165 states and 222 transitions. Second operand 5 states. [2019-09-16 17:10:11,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:11,551 INFO L93 Difference]: Finished difference Result 193 states and 269 transitions. [2019-09-16 17:10:11,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:11,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 17:10:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:11,555 INFO L225 Difference]: With dead ends: 193 [2019-09-16 17:10:11,555 INFO L226 Difference]: Without dead ends: 193 [2019-09-16 17:10:11,556 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-16 17:10:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-09-16 17:10:11,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2019-09-16 17:10:11,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 17:10:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2019-09-16 17:10:11,573 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 91 [2019-09-16 17:10:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:11,573 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2019-09-16 17:10:11,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:11,574 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2019-09-16 17:10:11,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 17:10:11,577 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:11,577 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] [2019-09-16 17:10:11,577 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:11,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1453730190, now seen corresponding path program 1 times [2019-09-16 17:10:11,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:11,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:11,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:11,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:11,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:11,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-16 17:10:11,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:11,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:11,703 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:11,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:11,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:11,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:11,707 INFO L87 Difference]: Start difference. First operand 165 states and 221 transitions. Second operand 5 states. [2019-09-16 17:10:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:12,093 INFO L93 Difference]: Finished difference Result 210 states and 296 transitions. [2019-09-16 17:10:12,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:12,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 17:10:12,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:12,097 INFO L225 Difference]: With dead ends: 210 [2019-09-16 17:10:12,097 INFO L226 Difference]: Without dead ends: 210 [2019-09-16 17:10:12,097 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-16 17:10:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-16 17:10:12,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 165. [2019-09-16 17:10:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 17:10:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 220 transitions. [2019-09-16 17:10:12,119 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 220 transitions. Word has length 91 [2019-09-16 17:10:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:12,120 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 220 transitions. [2019-09-16 17:10:12,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 220 transitions. [2019-09-16 17:10:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 17:10:12,126 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:12,126 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] [2019-09-16 17:10:12,126 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:12,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash 721762764, now seen corresponding path program 1 times [2019-09-16 17:10:12,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:12,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:12,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:12,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:12,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:12,243 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-16 17:10:12,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:12,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:12,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:12,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:12,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:12,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:12,245 INFO L87 Difference]: Start difference. First operand 165 states and 220 transitions. Second operand 5 states. [2019-09-16 17:10:12,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:12,673 INFO L93 Difference]: Finished difference Result 204 states and 286 transitions. [2019-09-16 17:10:12,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:12,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 17:10:12,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:12,677 INFO L225 Difference]: With dead ends: 204 [2019-09-16 17:10:12,677 INFO L226 Difference]: Without dead ends: 204 [2019-09-16 17:10:12,678 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-16 17:10:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-09-16 17:10:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 165. [2019-09-16 17:10:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 17:10:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 219 transitions. [2019-09-16 17:10:12,712 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 219 transitions. Word has length 91 [2019-09-16 17:10:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:12,713 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 219 transitions. [2019-09-16 17:10:12,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:12,713 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 219 transitions. [2019-09-16 17:10:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 17:10:12,718 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:12,718 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] [2019-09-16 17:10:12,718 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:12,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash -964417074, now seen corresponding path program 1 times [2019-09-16 17:10:12,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:12,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:12,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:12,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:12,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:12,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:12,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:10:12,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:12,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:10:12,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:10:12,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:10:12,828 INFO L87 Difference]: Start difference. First operand 165 states and 219 transitions. Second operand 5 states. [2019-09-16 17:10:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:13,243 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2019-09-16 17:10:13,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:10:13,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-09-16 17:10:13,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:13,253 INFO L225 Difference]: With dead ends: 206 [2019-09-16 17:10:13,254 INFO L226 Difference]: Without dead ends: 206 [2019-09-16 17:10:13,254 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-16 17:10:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-09-16 17:10:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 165. [2019-09-16 17:10:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-16 17:10:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2019-09-16 17:10:13,266 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 91 [2019-09-16 17:10:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:13,267 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2019-09-16 17:10:13,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:10:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2019-09-16 17:10:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-16 17:10:13,269 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:13,269 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] [2019-09-16 17:10:13,270 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:13,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1018809972, now seen corresponding path program 1 times [2019-09-16 17:10:13,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:13,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:13,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:13,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:13,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:13,336 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-16 17:10:13,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:13,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:10:13,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:13,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:10:13,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:10:13,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:13,338 INFO L87 Difference]: Start difference. First operand 165 states and 218 transitions. Second operand 4 states. [2019-09-16 17:10:13,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:13,583 INFO L93 Difference]: Finished difference Result 301 states and 396 transitions. [2019-09-16 17:10:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:10:13,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-16 17:10:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:13,591 INFO L225 Difference]: With dead ends: 301 [2019-09-16 17:10:13,591 INFO L226 Difference]: Without dead ends: 301 [2019-09-16 17:10:13,591 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-16 17:10:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-09-16 17:10:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 300. [2019-09-16 17:10:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-09-16 17:10:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 395 transitions. [2019-09-16 17:10:13,619 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 395 transitions. Word has length 91 [2019-09-16 17:10:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:13,620 INFO L475 AbstractCegarLoop]: Abstraction has 300 states and 395 transitions. [2019-09-16 17:10:13,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:10:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2019-09-16 17:10:13,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:10:13,622 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:13,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:10:13,623 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:13,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash -207780250, now seen corresponding path program 1 times [2019-09-16 17:10:13,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:13,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:13,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-16 17:10:13,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:13,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:10:13,704 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-16 17:10:13,707 INFO L207 CegarAbsIntRunner]: [58], [63], [77], [80], [83], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [140], [142], [144], [145], [184], [185], [187], [192], [195], [198], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [248], [256], [260], [266], [272], [278], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [384], [397], [403], [404], [418], [420], [453], [454], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:10:13,741 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:10:13,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:10:13,871 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:10:13,873 INFO L272 AbstractInterpreter]: Visited 50 different actions 50 times. Never merged. Never widened. Performed 215 root evaluator evaluations with a maximum evaluation depth of 4. Performed 215 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 40 variables. [2019-09-16 17:10:13,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:13,877 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:10:14,035 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 65.93% of their original sizes. [2019-09-16 17:10:14,036 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:10:14,224 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-09-16 17:10:14,224 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:10:14,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:10:14,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [6] total 19 [2019-09-16 17:10:14,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:14,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-16 17:10:14,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-16 17:10:14,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-16 17:10:14,227 INFO L87 Difference]: Start difference. First operand 300 states and 395 transitions. Second operand 15 states. [2019-09-16 17:10:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:17,217 INFO L93 Difference]: Finished difference Result 402 states and 510 transitions. [2019-09-16 17:10:17,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-16 17:10:17,217 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 145 [2019-09-16 17:10:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:17,221 INFO L225 Difference]: With dead ends: 402 [2019-09-16 17:10:17,221 INFO L226 Difference]: Without dead ends: 402 [2019-09-16 17:10:17,222 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-09-16 17:10:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-09-16 17:10:17,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 394. [2019-09-16 17:10:17,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-16 17:10:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 501 transitions. [2019-09-16 17:10:17,239 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 501 transitions. Word has length 145 [2019-09-16 17:10:17,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:17,240 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 501 transitions. [2019-09-16 17:10:17,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-16 17:10:17,240 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 501 transitions. [2019-09-16 17:10:17,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:10:17,243 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:17,243 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:10:17,244 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:17,244 INFO L82 PathProgramCache]: Analyzing trace with hash 56462567, now seen corresponding path program 1 times [2019-09-16 17:10:17,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:17,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:17,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-16 17:10:17,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:17,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:10:17,343 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:17,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:10:17,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:10:17,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:17,345 INFO L87 Difference]: Start difference. First operand 394 states and 501 transitions. Second operand 6 states. [2019-09-16 17:10:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:17,384 INFO L93 Difference]: Finished difference Result 414 states and 529 transitions. [2019-09-16 17:10:17,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:10:17,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-16 17:10:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:17,390 INFO L225 Difference]: With dead ends: 414 [2019-09-16 17:10:17,391 INFO L226 Difference]: Without dead ends: 414 [2019-09-16 17:10:17,391 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-16 17:10:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-09-16 17:10:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 404. [2019-09-16 17:10:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-09-16 17:10:17,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 511 transitions. [2019-09-16 17:10:17,413 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 511 transitions. Word has length 145 [2019-09-16 17:10:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:17,416 INFO L475 AbstractCegarLoop]: Abstraction has 404 states and 511 transitions. [2019-09-16 17:10:17,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:10:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 511 transitions. [2019-09-16 17:10:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 17:10:17,421 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:17,422 INFO L407 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:10:17,422 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:17,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:17,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1847007389, now seen corresponding path program 1 times [2019-09-16 17:10:17,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:17,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:17,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-16 17:10:17,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:17,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:10:17,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:17,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:10:17,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:10:17,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:17,524 INFO L87 Difference]: Start difference. First operand 404 states and 511 transitions. Second operand 4 states. [2019-09-16 17:10:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:17,668 INFO L93 Difference]: Finished difference Result 485 states and 597 transitions. [2019-09-16 17:10:17,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:10:17,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-16 17:10:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:17,671 INFO L225 Difference]: With dead ends: 485 [2019-09-16 17:10:17,672 INFO L226 Difference]: Without dead ends: 485 [2019-09-16 17:10:17,672 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-16 17:10:17,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-09-16 17:10:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2019-09-16 17:10:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-09-16 17:10:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 597 transitions. [2019-09-16 17:10:17,689 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 597 transitions. Word has length 165 [2019-09-16 17:10:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:17,690 INFO L475 AbstractCegarLoop]: Abstraction has 485 states and 597 transitions. [2019-09-16 17:10:17,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:10:17,690 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 597 transitions. [2019-09-16 17:10:17,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-16 17:10:17,692 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:17,693 INFO L407 BasicCegarLoop]: trace histogram [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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:17,693 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:17,694 INFO L82 PathProgramCache]: Analyzing trace with hash 270449630, now seen corresponding path program 1 times [2019-09-16 17:10:17,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:17,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:17,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:17,757 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-16 17:10:17,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:17,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:10:17,758 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:17,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:10:17,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:10:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:17,759 INFO L87 Difference]: Start difference. First operand 485 states and 597 transitions. Second operand 4 states. [2019-09-16 17:10:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:17,940 INFO L93 Difference]: Finished difference Result 838 states and 1034 transitions. [2019-09-16 17:10:17,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:10:17,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-16 17:10:17,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:17,946 INFO L225 Difference]: With dead ends: 838 [2019-09-16 17:10:17,946 INFO L226 Difference]: Without dead ends: 838 [2019-09-16 17:10:17,946 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:17,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-09-16 17:10:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 831. [2019-09-16 17:10:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2019-09-16 17:10:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1028 transitions. [2019-09-16 17:10:17,976 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1028 transitions. Word has length 165 [2019-09-16 17:10:17,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:17,976 INFO L475 AbstractCegarLoop]: Abstraction has 831 states and 1028 transitions. [2019-09-16 17:10:17,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:10:17,977 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1028 transitions. [2019-09-16 17:10:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-16 17:10:17,980 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:17,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:10:17,980 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:17,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:17,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1914461978, now seen corresponding path program 1 times [2019-09-16 17:10:17,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:17,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:17,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:17,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-16 17:10:18,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:18,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:10:18,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:18,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:10:18,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:10:18,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:18,041 INFO L87 Difference]: Start difference. First operand 831 states and 1028 transitions. Second operand 4 states. [2019-09-16 17:10:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:10:18,244 INFO L93 Difference]: Finished difference Result 1328 states and 1651 transitions. [2019-09-16 17:10:18,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:10:18,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-16 17:10:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:10:18,255 INFO L225 Difference]: With dead ends: 1328 [2019-09-16 17:10:18,255 INFO L226 Difference]: Without dead ends: 1328 [2019-09-16 17:10:18,255 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:10:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2019-09-16 17:10:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1322. [2019-09-16 17:10:18,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-09-16 17:10:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1645 transitions. [2019-09-16 17:10:18,307 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1645 transitions. Word has length 145 [2019-09-16 17:10:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:10:18,307 INFO L475 AbstractCegarLoop]: Abstraction has 1322 states and 1645 transitions. [2019-09-16 17:10:18,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:10:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1645 transitions. [2019-09-16 17:10:18,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-16 17:10:18,315 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:18,316 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:18,316 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash 685463986, now seen corresponding path program 1 times [2019-09-16 17:10:18,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:18,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:18,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:18,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:18,456 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 35 proven. 15 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-16 17:10:18,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:10:18,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:10:18,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 210 with the following transitions: [2019-09-16 17:10:18,457 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [58], [63], [77], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [378], [397], [403], [404], [418], [420], [453], [454], [455], [456], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:10:18,462 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:10:18,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:10:18,525 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:10:18,526 INFO L272 AbstractInterpreter]: Visited 111 different actions 152 times. Merged at 4 different actions 4 times. Never widened. Performed 562 root evaluator evaluations with a maximum evaluation depth of 4. Performed 562 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 40 variables. [2019-09-16 17:10:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:18,527 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:10:18,658 INFO L227 lantSequenceWeakener]: Weakened 166 states. On average, predicates are now at 74.31% of their original sizes. [2019-09-16 17:10:18,659 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:10:20,395 INFO L420 sIntCurrentIteration]: We unified 208 AI predicates to 208 [2019-09-16 17:10:20,395 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:10:20,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:10:20,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [4] total 64 [2019-09-16 17:10:20,396 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:20,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-16 17:10:20,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-16 17:10:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=3421, Unknown=0, NotChecked=0, Total=3782 [2019-09-16 17:10:20,400 INFO L87 Difference]: Start difference. First operand 1322 states and 1645 transitions. Second operand 62 states. [2019-09-16 17:11:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:02,267 INFO L93 Difference]: Finished difference Result 2692 states and 3330 transitions. [2019-09-16 17:11:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-16 17:11:02,268 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 209 [2019-09-16 17:11:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:02,281 INFO L225 Difference]: With dead ends: 2692 [2019-09-16 17:11:02,281 INFO L226 Difference]: Without dead ends: 2692 [2019-09-16 17:11:02,287 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6164 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1949, Invalid=16957, Unknown=0, NotChecked=0, Total=18906 [2019-09-16 17:11:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2019-09-16 17:11:02,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 2590. [2019-09-16 17:11:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2590 states. [2019-09-16 17:11:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3220 transitions. [2019-09-16 17:11:02,370 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3220 transitions. Word has length 209 [2019-09-16 17:11:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:02,371 INFO L475 AbstractCegarLoop]: Abstraction has 2590 states and 3220 transitions. [2019-09-16 17:11:02,371 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-16 17:11:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3220 transitions. [2019-09-16 17:11:02,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-16 17:11:02,377 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:02,377 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:02,378 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:02,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:02,378 INFO L82 PathProgramCache]: Analyzing trace with hash 41643804, now seen corresponding path program 1 times [2019-09-16 17:11:02,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:02,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:02,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:02,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:02,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-09-16 17:11:02,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:02,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 17:11:02,474 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:02,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:11:02,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:11:02,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 17:11:02,476 INFO L87 Difference]: Start difference. First operand 2590 states and 3220 transitions. Second operand 4 states. [2019-09-16 17:11:02,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:02,958 INFO L93 Difference]: Finished difference Result 4100 states and 5466 transitions. [2019-09-16 17:11:02,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:11:02,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2019-09-16 17:11:02,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:02,988 INFO L225 Difference]: With dead ends: 4100 [2019-09-16 17:11:02,989 INFO L226 Difference]: Without dead ends: 4100 [2019-09-16 17:11:02,989 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:11:02,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2019-09-16 17:11:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 3770. [2019-09-16 17:11:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3770 states. [2019-09-16 17:11:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 4859 transitions. [2019-09-16 17:11:03,170 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 4859 transitions. Word has length 225 [2019-09-16 17:11:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:03,171 INFO L475 AbstractCegarLoop]: Abstraction has 3770 states and 4859 transitions. [2019-09-16 17:11:03,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:11:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 4859 transitions. [2019-09-16 17:11:03,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-16 17:11:03,179 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:03,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:11:03,180 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:03,181 INFO L82 PathProgramCache]: Analyzing trace with hash -28823128, now seen corresponding path program 1 times [2019-09-16 17:11:03,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:03,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:03,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:03,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:03,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-16 17:11:03,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:03,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:11:03,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 211 with the following transitions: [2019-09-16 17:11:03,301 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [47], [49], [57], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [216], [219], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [371], [375], [378], [381], [388], [391], [397], [403], [404], [418], [420], [453], [454], [455], [456], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:11:03,310 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:11:03,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:11:03,381 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:11:03,382 INFO L272 AbstractInterpreter]: Visited 123 different actions 234 times. Merged at 16 different actions 19 times. Never widened. Performed 900 root evaluator evaluations with a maximum evaluation depth of 4. Performed 900 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 4 fixpoints after 4 different actions. Largest state had 42 variables. [2019-09-16 17:11:03,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:03,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:11:03,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:03,384 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-16 17:11:03,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:03,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:11:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:03,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:11:03,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:11:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-16 17:11:03,629 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:11:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-16 17:11:03,872 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:11:03,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [6] total 7 [2019-09-16 17:11:03,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:03,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:11:03,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:11:03,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:11:03,874 INFO L87 Difference]: Start difference. First operand 3770 states and 4859 transitions. Second operand 3 states. [2019-09-16 17:11:03,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:03,921 INFO L93 Difference]: Finished difference Result 4570 states and 5886 transitions. [2019-09-16 17:11:03,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:11:03,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-16 17:11:03,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:03,950 INFO L225 Difference]: With dead ends: 4570 [2019-09-16 17:11:03,950 INFO L226 Difference]: Without dead ends: 4570 [2019-09-16 17:11:03,951 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 421 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-16 17:11:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2019-09-16 17:11:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 4529. [2019-09-16 17:11:04,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4529 states. [2019-09-16 17:11:04,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4529 states to 4529 states and 5837 transitions. [2019-09-16 17:11:04,120 INFO L78 Accepts]: Start accepts. Automaton has 4529 states and 5837 transitions. Word has length 210 [2019-09-16 17:11:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:04,120 INFO L475 AbstractCegarLoop]: Abstraction has 4529 states and 5837 transitions. [2019-09-16 17:11:04,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:11:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4529 states and 5837 transitions. [2019-09-16 17:11:04,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-16 17:11:04,133 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:04,133 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, 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] [2019-09-16 17:11:04,134 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:04,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:04,134 INFO L82 PathProgramCache]: Analyzing trace with hash 86617428, now seen corresponding path program 1 times [2019-09-16 17:11:04,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:04,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:04,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:04,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:04,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-09-16 17:11:04,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:04,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:11:04,228 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2019-09-16 17:11:04,228 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [47], [49], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [198], [200], [203], [208], [210], [211], [214], [228], [229], [230], [233], [236], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [378], [381], [388], [391], [397], [403], [404], [418], [420], [453], [454], [455], [456], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:11:04,230 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:11:04,231 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:11:04,368 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:11:04,368 INFO L272 AbstractInterpreter]: Visited 124 different actions 438 times. Merged at 28 different actions 84 times. Never widened. Performed 2437 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2437 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 6 different actions. Largest state had 42 variables. [2019-09-16 17:11:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:04,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:11:04,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:04,369 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-16 17:11:04,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:04,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:11:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:04,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-16 17:11:04,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:11:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-16 17:11:04,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:11:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 17:11:04,890 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:11:04,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [4] total 6 [2019-09-16 17:11:04,891 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:04,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:11:04,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:11:04,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:11:04,893 INFO L87 Difference]: Start difference. First operand 4529 states and 5837 transitions. Second operand 3 states. [2019-09-16 17:11:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:04,928 INFO L93 Difference]: Finished difference Result 4491 states and 5612 transitions. [2019-09-16 17:11:04,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:11:04,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-16 17:11:04,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:04,952 INFO L225 Difference]: With dead ends: 4491 [2019-09-16 17:11:04,952 INFO L226 Difference]: Without dead ends: 4491 [2019-09-16 17:11:04,953 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 416 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:11:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4491 states. [2019-09-16 17:11:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4491 to 4112. [2019-09-16 17:11:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4112 states. [2019-09-16 17:11:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 5172 transitions. [2019-09-16 17:11:05,080 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 5172 transitions. Word has length 211 [2019-09-16 17:11:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:05,081 INFO L475 AbstractCegarLoop]: Abstraction has 4112 states and 5172 transitions. [2019-09-16 17:11:05,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:11:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 5172 transitions. [2019-09-16 17:11:05,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-16 17:11:05,091 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:05,091 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:05,092 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:05,092 INFO L82 PathProgramCache]: Analyzing trace with hash -2086559453, now seen corresponding path program 1 times [2019-09-16 17:11:05,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:05,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:05,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:05,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:05,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-16 17:11:05,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:05,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:11:05,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:05,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:11:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:11:05,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:11:05,199 INFO L87 Difference]: Start difference. First operand 4112 states and 5172 transitions. Second operand 3 states. [2019-09-16 17:11:05,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:05,239 INFO L93 Difference]: Finished difference Result 3961 states and 5105 transitions. [2019-09-16 17:11:05,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:11:05,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-09-16 17:11:05,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:05,267 INFO L225 Difference]: With dead ends: 3961 [2019-09-16 17:11:05,268 INFO L226 Difference]: Without dead ends: 3961 [2019-09-16 17:11:05,268 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-16 17:11:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3961 states. [2019-09-16 17:11:05,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3961 to 3958. [2019-09-16 17:11:05,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3958 states. [2019-09-16 17:11:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3958 states to 3958 states and 5103 transitions. [2019-09-16 17:11:05,398 INFO L78 Accepts]: Start accepts. Automaton has 3958 states and 5103 transitions. Word has length 227 [2019-09-16 17:11:05,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:05,399 INFO L475 AbstractCegarLoop]: Abstraction has 3958 states and 5103 transitions. [2019-09-16 17:11:05,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:11:05,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3958 states and 5103 transitions. [2019-09-16 17:11:05,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-16 17:11:05,409 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:05,409 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, 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] [2019-09-16 17:11:05,409 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:05,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:05,410 INFO L82 PathProgramCache]: Analyzing trace with hash 555678451, now seen corresponding path program 1 times [2019-09-16 17:11:05,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:05,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:05,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:05,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:05,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-16 17:11:05,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:05,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:11:05,498 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2019-09-16 17:11:05,498 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [47], [49], [57], [58], [63], [77], [80], [83], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [216], [219], [228], [229], [230], [233], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [371], [375], [378], [381], [388], [391], [397], [403], [404], [418], [420], [453], [454], [455], [456], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:11:05,500 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:11:05,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:11:05,537 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:11:05,538 INFO L272 AbstractInterpreter]: Visited 119 different actions 193 times. Merged at 15 different actions 19 times. Never widened. Performed 871 root evaluator evaluations with a maximum evaluation depth of 4. Performed 871 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 3 different actions. Largest state had 42 variables. [2019-09-16 17:11:05,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:05,538 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:11:05,641 INFO L227 lantSequenceWeakener]: Weakened 163 states. On average, predicates are now at 72.88% of their original sizes. [2019-09-16 17:11:05,642 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:11:07,988 INFO L420 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2019-09-16 17:11:07,988 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:11:07,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:11:07,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [68] imperfect sequences [5] total 71 [2019-09-16 17:11:07,989 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:07,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-16 17:11:07,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-16 17:11:07,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=4201, Unknown=0, NotChecked=0, Total=4556 [2019-09-16 17:11:07,992 INFO L87 Difference]: Start difference. First operand 3958 states and 5103 transitions. Second operand 68 states. [2019-09-16 17:11:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:39,910 INFO L93 Difference]: Finished difference Result 4777 states and 6226 transitions. [2019-09-16 17:11:39,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-16 17:11:39,910 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 211 [2019-09-16 17:11:39,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:39,933 INFO L225 Difference]: With dead ends: 4777 [2019-09-16 17:11:39,933 INFO L226 Difference]: Without dead ends: 4777 [2019-09-16 17:11:39,939 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5879 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1510, Invalid=16850, Unknown=0, NotChecked=0, Total=18360 [2019-09-16 17:11:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4777 states. [2019-09-16 17:11:40,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4777 to 4287. [2019-09-16 17:11:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-09-16 17:11:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 5535 transitions. [2019-09-16 17:11:40,055 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 5535 transitions. Word has length 211 [2019-09-16 17:11:40,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:40,055 INFO L475 AbstractCegarLoop]: Abstraction has 4287 states and 5535 transitions. [2019-09-16 17:11:40,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-16 17:11:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 5535 transitions. [2019-09-16 17:11:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-16 17:11:40,066 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:40,066 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:40,066 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:40,067 INFO L82 PathProgramCache]: Analyzing trace with hash 303858689, now seen corresponding path program 1 times [2019-09-16 17:11:40,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:40,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:40,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:40,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:40,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 22 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-16 17:11:40,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:40,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:11:40,160 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2019-09-16 17:11:40,160 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [47], [49], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [208], [210], [211], [214], [228], [229], [230], [233], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [378], [381], [388], [391], [397], [403], [404], [418], [420], [453], [454], [455], [456], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:11:40,162 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:11:40,162 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:11:40,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:11:40,250 INFO L272 AbstractInterpreter]: Visited 123 different actions 328 times. Merged at 28 different actions 52 times. Never widened. Performed 1999 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1999 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 8 fixpoints after 5 different actions. Largest state had 42 variables. [2019-09-16 17:11:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:40,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:11:40,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:40,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:11:40,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:40,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:11:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:40,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-16 17:11:40,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:11:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-16 17:11:40,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:11:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-16 17:11:40,917 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:11:40,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 5] imperfect sequences [5] total 9 [2019-09-16 17:11:40,918 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:40,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:11:40,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:11:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:11:40,920 INFO L87 Difference]: Start difference. First operand 4287 states and 5535 transitions. Second operand 4 states. [2019-09-16 17:11:41,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:41,184 INFO L93 Difference]: Finished difference Result 5078 states and 7159 transitions. [2019-09-16 17:11:41,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:11:41,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2019-09-16 17:11:41,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:41,206 INFO L225 Difference]: With dead ends: 5078 [2019-09-16 17:11:41,207 INFO L226 Difference]: Without dead ends: 5078 [2019-09-16 17:11:41,207 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 410 SyntacticMatches, 12 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-16 17:11:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2019-09-16 17:11:41,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 4696. [2019-09-16 17:11:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4696 states. [2019-09-16 17:11:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 6070 transitions. [2019-09-16 17:11:41,331 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 6070 transitions. Word has length 212 [2019-09-16 17:11:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:41,331 INFO L475 AbstractCegarLoop]: Abstraction has 4696 states and 6070 transitions. [2019-09-16 17:11:41,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:11:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 6070 transitions. [2019-09-16 17:11:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-16 17:11:41,341 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:41,341 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, 3, 3, 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] [2019-09-16 17:11:41,341 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:41,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:41,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2125740042, now seen corresponding path program 1 times [2019-09-16 17:11:41,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:41,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:41,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:41,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:41,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:41,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-16 17:11:41,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:41,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:11:41,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:41,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:11:41,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:11:41,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:11:41,439 INFO L87 Difference]: Start difference. First operand 4696 states and 6070 transitions. Second operand 6 states. [2019-09-16 17:11:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:41,477 INFO L93 Difference]: Finished difference Result 4259 states and 5370 transitions. [2019-09-16 17:11:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:11:41,477 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-09-16 17:11:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:41,499 INFO L225 Difference]: With dead ends: 4259 [2019-09-16 17:11:41,499 INFO L226 Difference]: Without dead ends: 4259 [2019-09-16 17:11:41,500 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-16 17:11:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4259 states. [2019-09-16 17:11:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4259 to 4259. [2019-09-16 17:11:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4259 states. [2019-09-16 17:11:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 5370 transitions. [2019-09-16 17:11:41,594 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 5370 transitions. Word has length 213 [2019-09-16 17:11:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:41,595 INFO L475 AbstractCegarLoop]: Abstraction has 4259 states and 5370 transitions. [2019-09-16 17:11:41,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:11:41,595 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 5370 transitions. [2019-09-16 17:11:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-16 17:11:41,604 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:41,604 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:41,604 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:41,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:41,605 INFO L82 PathProgramCache]: Analyzing trace with hash 547975687, now seen corresponding path program 1 times [2019-09-16 17:11:41,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:41,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:41,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:41,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-16 17:11:41,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:41,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:11:41,711 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 214 with the following transitions: [2019-09-16 17:11:41,712 INFO L207 CegarAbsIntRunner]: [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [381], [388], [391], [403], [404], [418], [420], [453], [454], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:11:41,713 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:11:41,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:11:41,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:11:41,841 INFO L272 AbstractInterpreter]: Visited 125 different actions 511 times. Merged at 41 different actions 111 times. Never widened. Performed 2743 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2743 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 4 different actions. Largest state had 42 variables. [2019-09-16 17:11:41,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:41,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:11:41,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:41,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:11:41,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:41,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:11:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:42,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-16 17:11:42,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:11:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-16 17:11:42,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:11:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 17:11:42,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:11:42,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 6 [2019-09-16 17:11:42,289 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:42,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:11:42,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:11:42,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:11:42,293 INFO L87 Difference]: Start difference. First operand 4259 states and 5370 transitions. Second operand 6 states. [2019-09-16 17:11:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:42,335 INFO L93 Difference]: Finished difference Result 3522 states and 4278 transitions. [2019-09-16 17:11:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:11:42,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-09-16 17:11:42,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:42,348 INFO L225 Difference]: With dead ends: 3522 [2019-09-16 17:11:42,348 INFO L226 Difference]: Without dead ends: 3522 [2019-09-16 17:11:42,350 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 427 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-16 17:11:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3522 states. [2019-09-16 17:11:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3522 to 3522. [2019-09-16 17:11:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3522 states. [2019-09-16 17:11:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3522 states to 3522 states and 4278 transitions. [2019-09-16 17:11:42,420 INFO L78 Accepts]: Start accepts. Automaton has 3522 states and 4278 transitions. Word has length 213 [2019-09-16 17:11:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:42,421 INFO L475 AbstractCegarLoop]: Abstraction has 3522 states and 4278 transitions. [2019-09-16 17:11:42,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:11:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 3522 states and 4278 transitions. [2019-09-16 17:11:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-16 17:11:42,432 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:42,433 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:42,433 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:42,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1980617327, now seen corresponding path program 1 times [2019-09-16 17:11:42,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:42,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:42,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:42,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:42,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-16 17:11:42,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:42,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:11:42,663 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 260 with the following transitions: [2019-09-16 17:11:42,663 INFO L207 CegarAbsIntRunner]: [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [233], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [378], [381], [388], [391], [403], [404], [418], [420], [453], [454], [455], [456], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:11:42,665 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:11:42,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:11:42,822 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:11:42,822 INFO L272 AbstractInterpreter]: Visited 131 different actions 636 times. Merged at 42 different actions 138 times. Never widened. Performed 2911 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2911 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 14 fixpoints after 6 different actions. Largest state had 42 variables. [2019-09-16 17:11:42,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:42,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:11:42,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:42,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:11:42,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:42,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:11:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:43,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-16 17:11:43,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:11:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 128 proven. 62 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-16 17:11:43,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:11:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-09-16 17:11:43,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:11:43,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-09-16 17:11:43,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:43,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:11:43,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:11:43,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:11:43,352 INFO L87 Difference]: Start difference. First operand 3522 states and 4278 transitions. Second operand 5 states. [2019-09-16 17:11:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:43,869 INFO L93 Difference]: Finished difference Result 3839 states and 4762 transitions. [2019-09-16 17:11:43,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:11:43,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-09-16 17:11:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:43,881 INFO L225 Difference]: With dead ends: 3839 [2019-09-16 17:11:43,881 INFO L226 Difference]: Without dead ends: 3839 [2019-09-16 17:11:43,882 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 511 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-16 17:11:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2019-09-16 17:11:43,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3759. [2019-09-16 17:11:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3759 states. [2019-09-16 17:11:43,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 4624 transitions. [2019-09-16 17:11:43,964 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 4624 transitions. Word has length 259 [2019-09-16 17:11:43,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:43,965 INFO L475 AbstractCegarLoop]: Abstraction has 3759 states and 4624 transitions. [2019-09-16 17:11:43,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:11:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 4624 transitions. [2019-09-16 17:11:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-09-16 17:11:43,977 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:43,977 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:11:43,977 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1496402789, now seen corresponding path program 1 times [2019-09-16 17:11:43,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:43,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:43,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:43,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-09-16 17:11:44,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:11:44,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:11:44,084 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 265 with the following transitions: [2019-09-16 17:11:44,084 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [138], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [216], [219], [228], [229], [230], [233], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [371], [375], [378], [388], [391], [403], [404], [418], [420], [453], [454], [455], [456], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:11:44,089 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:11:44,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:11:44,117 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:11:44,117 INFO L272 AbstractInterpreter]: Visited 124 different actions 166 times. Merged at 2 different actions 2 times. Never widened. Performed 648 root evaluator evaluations with a maximum evaluation depth of 4. Performed 648 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 42 variables. [2019-09-16 17:11:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:44,118 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:11:44,217 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 73.76% of their original sizes. [2019-09-16 17:11:44,217 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:11:46,651 INFO L420 sIntCurrentIteration]: We unified 263 AI predicates to 263 [2019-09-16 17:11:46,651 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:11:46,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:11:46,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [76] imperfect sequences [5] total 79 [2019-09-16 17:11:46,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:46,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-16 17:11:46,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-16 17:11:46,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=5298, Unknown=0, NotChecked=0, Total=5700 [2019-09-16 17:11:46,655 INFO L87 Difference]: Start difference. First operand 3759 states and 4624 transitions. Second operand 76 states. [2019-09-16 17:12:15,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:15,012 INFO L93 Difference]: Finished difference Result 3891 states and 4777 transitions. [2019-09-16 17:12:15,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-16 17:12:15,012 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 264 [2019-09-16 17:12:15,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:15,022 INFO L225 Difference]: With dead ends: 3891 [2019-09-16 17:12:15,022 INFO L226 Difference]: Without dead ends: 3750 [2019-09-16 17:12:15,026 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4885 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1328, Invalid=14928, Unknown=0, NotChecked=0, Total=16256 [2019-09-16 17:12:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3750 states. [2019-09-16 17:12:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3750 to 3731. [2019-09-16 17:12:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3731 states. [2019-09-16 17:12:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4593 transitions. [2019-09-16 17:12:15,100 INFO L78 Accepts]: Start accepts. Automaton has 3731 states and 4593 transitions. Word has length 264 [2019-09-16 17:12:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:15,100 INFO L475 AbstractCegarLoop]: Abstraction has 3731 states and 4593 transitions. [2019-09-16 17:12:15,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-16 17:12:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 3731 states and 4593 transitions. [2019-09-16 17:12:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-16 17:12:15,110 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:15,110 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:12:15,110 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:15,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2108904620, now seen corresponding path program 1 times [2019-09-16 17:12:15,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:15,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:15,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:15,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:15,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-09-16 17:12:15,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:12:15,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-16 17:12:15,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:15,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-16 17:12:15,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-16 17:12:15,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:12:15,302 INFO L87 Difference]: Start difference. First operand 3731 states and 4593 transitions. Second operand 7 states. [2019-09-16 17:12:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:17,399 INFO L93 Difference]: Finished difference Result 8580 states and 12049 transitions. [2019-09-16 17:12:17,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-16 17:12:17,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2019-09-16 17:12:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:17,424 INFO L225 Difference]: With dead ends: 8580 [2019-09-16 17:12:17,425 INFO L226 Difference]: Without dead ends: 8580 [2019-09-16 17:12:17,425 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-09-16 17:12:17,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8580 states. [2019-09-16 17:12:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8580 to 8380. [2019-09-16 17:12:17,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8380 states. [2019-09-16 17:12:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8380 states to 8380 states and 11673 transitions. [2019-09-16 17:12:17,687 INFO L78 Accepts]: Start accepts. Automaton has 8380 states and 11673 transitions. Word has length 265 [2019-09-16 17:12:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:17,688 INFO L475 AbstractCegarLoop]: Abstraction has 8380 states and 11673 transitions. [2019-09-16 17:12:17,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-16 17:12:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 8380 states and 11673 transitions. [2019-09-16 17:12:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-16 17:12:17,701 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:17,702 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 17:12:17,702 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:17,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:17,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1270216864, now seen corresponding path program 1 times [2019-09-16 17:12:17,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:17,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:17,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:17,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:17,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-09-16 17:12:17,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:17,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:17,800 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 278 with the following transitions: [2019-09-16 17:12:17,801 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [233], [236], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [378], [384], [388], [391], [397], [403], [404], [418], [420], [453], [454], [455], [456], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:12:17,802 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:17,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:19,398 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:19,399 INFO L272 AbstractInterpreter]: Visited 143 different actions 4286 times. Merged at 55 different actions 1454 times. Widened at 2 different actions 4 times. Performed 16431 root evaluator evaluations with a maximum evaluation depth of 4. Performed 16431 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 175 fixpoints after 16 different actions. Largest state had 42 variables. [2019-09-16 17:12:19,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:19,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:19,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:19,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:19,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:19,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:19,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:12:19,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-16 17:12:19,727 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-09-16 17:12:19,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:19,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 5 [2019-09-16 17:12:19,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:19,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:12:19,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:12:19,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:12:19,931 INFO L87 Difference]: Start difference. First operand 8380 states and 11673 transitions. Second operand 3 states. [2019-09-16 17:12:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:19,982 INFO L93 Difference]: Finished difference Result 8383 states and 11599 transitions. [2019-09-16 17:12:19,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:12:19,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-09-16 17:12:19,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:20,012 INFO L225 Difference]: With dead ends: 8383 [2019-09-16 17:12:20,013 INFO L226 Difference]: Without dead ends: 8383 [2019-09-16 17:12:20,013 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:12:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8383 states. [2019-09-16 17:12:20,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8383 to 8380. [2019-09-16 17:12:20,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8380 states. [2019-09-16 17:12:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8380 states to 8380 states and 11597 transitions. [2019-09-16 17:12:20,271 INFO L78 Accepts]: Start accepts. Automaton has 8380 states and 11597 transitions. Word has length 277 [2019-09-16 17:12:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:20,272 INFO L475 AbstractCegarLoop]: Abstraction has 8380 states and 11597 transitions. [2019-09-16 17:12:20,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:12:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 8380 states and 11597 transitions. [2019-09-16 17:12:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-16 17:12:20,286 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:12:20,288 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-16 17:12:20,288 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:12:20,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1135487543, now seen corresponding path program 1 times [2019-09-16 17:12:20,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:12:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:20,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:12:20,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:12:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2019-09-16 17:12:20,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:20,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:12:20,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 279 with the following transitions: [2019-09-16 17:12:20,424 INFO L207 CegarAbsIntRunner]: [2], [4], [7], [18], [20], [22], [24], [28], [31], [33], [36], [47], [49], [51], [53], [57], [58], [63], [77], [80], [83], [85], [87], [89], [91], [92], [97], [103], [109], [115], [121], [127], [129], [130], [133], [136], [140], [142], [144], [145], [184], [185], [187], [190], [192], [195], [200], [203], [206], [208], [210], [211], [214], [228], [229], [230], [233], [236], [238], [240], [242], [244], [245], [250], [256], [262], [268], [274], [280], [282], [285], [291], [297], [301], [304], [306], [309], [320], [322], [324], [328], [336], [339], [340], [341], [350], [353], [356], [362], [365], [368], [375], [378], [384], [388], [391], [394], [403], [404], [418], [420], [453], [454], [455], [456], [457], [458], [459], [460], [461], [465], [466], [467], [468], [469], [470], [471], [472], [473], [474], [475], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [515], [516], [517] [2019-09-16 17:12:20,426 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:12:20,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:12:20,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:12:20,869 INFO L272 AbstractInterpreter]: Visited 143 different actions 1675 times. Merged at 55 different actions 514 times. Widened at 1 different actions 1 times. Performed 6556 root evaluator evaluations with a maximum evaluation depth of 4. Performed 6556 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 64 fixpoints after 15 different actions. Largest state had 42 variables. [2019-09-16 17:12:20,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:12:20,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:12:20,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:12:20,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:12:20,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:12:20,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:12:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:12:21,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 17:12:21,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:12:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-16 17:12:21,276 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:12:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream closed [2019-09-16 17:12:21,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-16 17:12:21,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2019-09-16 17:12:21,500 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:12:21,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:12:21,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:12:21,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:12:21,501 INFO L87 Difference]: Start difference. First operand 8380 states and 11597 transitions. Second operand 4 states. [2019-09-16 17:12:21,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:12:21,834 INFO L93 Difference]: Finished difference Result 2094 states and 2391 transitions. [2019-09-16 17:12:21,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:12:21,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2019-09-16 17:12:21,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:12:21,835 INFO L225 Difference]: With dead ends: 2094 [2019-09-16 17:12:21,835 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:12:21,836 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:12:21,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:12:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:12:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:12:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:12:21,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 278 [2019-09-16 17:12:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:12:21,837 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:12:21,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:12:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:12:21,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:12:21,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:12:21 BoogieIcfgContainer [2019-09-16 17:12:21,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:12:21,845 INFO L168 Benchmark]: Toolchain (without parser) took 133617.08 ms. Allocated memory was 132.6 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 88.0 MB in the beginning and 828.9 MB in the end (delta: -741.0 MB). Peak memory consumption was 342.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:12:21,845 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:12:21,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.33 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 87.7 MB in the beginning and 172.7 MB in the end (delta: -85.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:12:21,847 INFO L168 Benchmark]: Boogie Preprocessor took 49.29 ms. Allocated memory is still 199.2 MB. Free memory was 172.7 MB in the beginning and 170.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:12:21,847 INFO L168 Benchmark]: RCFGBuilder took 697.96 ms. Allocated memory is still 199.2 MB. Free memory was 170.1 MB in the beginning and 133.5 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. [2019-09-16 17:12:21,848 INFO L168 Benchmark]: TraceAbstraction took 132358.95 ms. Allocated memory was 199.2 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 133.5 MB in the beginning and 828.9 MB in the end (delta: -695.4 MB). Peak memory consumption was 321.2 MB. Max. memory is 7.1 GB. [2019-09-16 17:12:21,852 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 506.33 ms. Allocated memory was 132.6 MB in the beginning and 199.2 MB in the end (delta: 66.6 MB). Free memory was 87.7 MB in the beginning and 172.7 MB in the end (delta: -85.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 49.29 ms. Allocated memory is still 199.2 MB. Free memory was 172.7 MB in the beginning and 170.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 697.96 ms. Allocated memory is still 199.2 MB. Free memory was 170.1 MB in the beginning and 133.5 MB in the end (delta: 36.6 MB). Peak memory consumption was 36.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 132358.95 ms. Allocated memory was 199.2 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 133.5 MB in the beginning and 828.9 MB in the end (delta: -695.4 MB). Peak memory consumption was 321.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 174 locations, 1 error locations. SAFE Result, 132.2s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 112.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7257 SDtfs, 10509 SDslu, 31153 SDs, 0 SdLazy, 22978 SolverSat, 3189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4496 GetRequests, 3962 SyntacticMatches, 24 SemanticMatches, 510 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17027 ImplicationChecksByTransitivity, 14.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8380occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.9s AbstIntTime, 11 AbstIntIterations, 4 AbstIntStrong, 0.9904008761284313 AbsIntWeakeningRatio, 0.5757575757575758 AbsIntAvgWeakeningVarsNumRemoved, 14.623030303030303 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 25 MinimizatonAttempts, 2244 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 6245 NumberOfCodeBlocks, 6245 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 7866 ConstructedInterpolants, 0 QuantifiedInterpolants, 2374975 SizeOfPredicates, 9 NumberOfNonLiveVariables, 7036 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 39 InterpolantComputations, 24 PerfectInterpolantSequences, 5086/5362 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...