/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:29:58,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:29:58,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:29:58,021 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:29:58,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:29:58,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:29:58,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:29:58,025 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:29:58,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:29:58,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:29:58,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:29:58,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:29:58,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:29:58,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:29:58,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:29:58,034 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:29:58,035 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:29:58,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:29:58,037 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:29:58,039 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:29:58,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:29:58,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:29:58,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:29:58,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:29:58,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:29:58,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:29:58,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:29:58,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:29:58,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:29:58,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:29:58,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:29:58,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:29:58,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:29:58,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:29:58,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:29:58,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:29:58,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:29:58,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:29:58,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:29:58,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:29:58,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:29:58,056 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:29:58,071 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:29:58,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:29:58,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:29:58,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:29:58,073 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:29:58,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:29:58,073 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:29:58,074 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:29:58,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:29:58,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:29:58,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:29:58,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:29:58,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:29:58,075 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:29:58,075 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:29:58,075 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:29:58,075 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:29:58,076 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:29:58,076 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:29:58,076 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:29:58,076 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:29:58,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:29:58,077 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:29:58,077 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:29:58,077 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:29:58,077 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:29:58,077 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:29:58,078 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:29:58,078 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:29:58,078 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:29:58,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:29:58,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:29:58,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:29:58,366 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:29:58,366 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:29:58,367 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2019-12-18 15:29:58,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b763400/a2e04638e88f483fbf3e568b43c7c4fa/FLAG68640ebd8 [2019-12-18 15:29:59,017 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:29:59,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_1w1r-2.i [2019-12-18 15:29:59,041 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b763400/a2e04638e88f483fbf3e568b43c7c4fa/FLAG68640ebd8 [2019-12-18 15:29:59,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b763400/a2e04638e88f483fbf3e568b43c7c4fa [2019-12-18 15:29:59,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:29:59,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:29:59,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:29:59,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:29:59,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:29:59,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:29:59" (1/1) ... [2019-12-18 15:29:59,283 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:29:59, skipping insertion in model container [2019-12-18 15:29:59,283 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:29:59" (1/1) ... [2019-12-18 15:29:59,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:29:59,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:29:59,532 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 15:29:59,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:29:59,912 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:29:59,924 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-18 15:29:59,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:30:00,065 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:30:00,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00 WrapperNode [2019-12-18 15:30:00,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:30:00,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:30:00,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:30:00,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:30:00,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (1/1) ... [2019-12-18 15:30:00,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (1/1) ... [2019-12-18 15:30:00,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:30:00,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:30:00,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:30:00,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:30:00,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (1/1) ... [2019-12-18 15:30:00,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (1/1) ... [2019-12-18 15:30:00,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (1/1) ... [2019-12-18 15:30:00,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (1/1) ... [2019-12-18 15:30:00,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (1/1) ... [2019-12-18 15:30:00,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (1/1) ... [2019-12-18 15:30:00,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (1/1) ... [2019-12-18 15:30:00,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:30:00,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:30:00,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:30:00,160 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:30:00,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:30:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2019-12-18 15:30:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2019-12-18 15:30:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:30:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:30:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-18 15:30:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:30:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:30:00,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:30:00,219 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:30:00,772 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:30:00,773 INFO L287 CfgBuilder]: Removed 19 assume(true) statements. [2019-12-18 15:30:00,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:30:00 BoogieIcfgContainer [2019-12-18 15:30:00,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:30:00,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:30:00,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:30:00,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:30:00,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:29:59" (1/3) ... [2019-12-18 15:30:00,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777ce5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:30:00, skipping insertion in model container [2019-12-18 15:30:00,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:30:00" (2/3) ... [2019-12-18 15:30:00,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@777ce5c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:30:00, skipping insertion in model container [2019-12-18 15:30:00,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:30:00" (3/3) ... [2019-12-18 15:30:00,782 INFO L109 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2019-12-18 15:30:00,792 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:30:00,792 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:30:00,800 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-12-18 15:30:00,801 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:30:00,830 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,831 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,831 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,831 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,831 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,832 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,832 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,832 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,832 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,833 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,833 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,833 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,833 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,834 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,834 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,834 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,834 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,835 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,835 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,835 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,836 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,836 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,836 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,836 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,837 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,837 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,837 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,837 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,838 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,838 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,838 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,838 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,838 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,839 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,839 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,839 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,839 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,840 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,840 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,840 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,840 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,841 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,841 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,841 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,841 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,842 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,842 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,842 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,842 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,842 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,843 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,843 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,843 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,843 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,844 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,844 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,844 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,844 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,845 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,845 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,845 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,845 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,846 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,846 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,846 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,846 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,846 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,847 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,847 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,847 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,847 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,848 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,848 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,848 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,849 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,849 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,849 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,849 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,850 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,850 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,850 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,850 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,851 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,851 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,851 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,851 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,851 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,852 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,852 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,852 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,852 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,853 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,853 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,853 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,853 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,854 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,854 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,854 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,854 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,854 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,855 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,855 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,855 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,855 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,856 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,856 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,856 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,856 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,857 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,857 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,857 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,857 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,858 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,858 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,858 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,858 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,859 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,859 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,859 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,859 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,860 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,860 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,860 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,860 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,861 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,861 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,861 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,862 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,866 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~val~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,866 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~pre14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,866 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,867 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,867 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,867 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,867 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,868 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,868 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,868 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#t~ret15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,868 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,868 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~r~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,869 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,869 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,869 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,869 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,870 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,870 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,870 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,870 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,871 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~last~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,871 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,871 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,871 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,872 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_dequeue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,872 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,872 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,872 WARN L315 ript$VariableManager]: TermVariabe |reader_fnThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,873 WARN L315 ript$VariableManager]: TermVariabe reader_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:30:00,894 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 15:30:00,915 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:30:00,916 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:30:00,916 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:30:00,916 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:30:00,916 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:30:00,916 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:30:00,916 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:30:00,917 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:30:00,933 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 128 transitions [2019-12-18 15:30:00,935 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-18 15:30:01,000 INFO L126 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-18 15:30:01,000 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:30:01,012 INFO L76 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 10/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs. 6/120 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2019-12-18 15:30:01,042 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 122 places, 128 transitions [2019-12-18 15:30:01,070 INFO L126 PetriNetUnfolder]: 10/127 cut-off events. [2019-12-18 15:30:01,071 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:30:01,079 INFO L76 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 127 events. 10/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 245 event pairs. 6/120 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2019-12-18 15:30:01,093 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 4968 [2019-12-18 15:30:01,094 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:30:01,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:01,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:01,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:01,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:03,651 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-12-18 15:30:04,525 INFO L206 etLargeBlockEncoding]: Checked pairs total: 5902 [2019-12-18 15:30:04,526 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 15:30:04,530 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 34 transitions [2019-12-18 15:30:04,544 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 139 states. [2019-12-18 15:30:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-12-18 15:30:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 15:30:04,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:04,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 15:30:04,554 INFO L410 AbstractCegarLoop]: === Iteration 1 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:04,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:04,560 INFO L82 PathProgramCache]: Analyzing trace with hash 486263513, now seen corresponding path program 1 times [2019-12-18 15:30:04,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:04,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985424718] [2019-12-18 15:30:04,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:04,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985424718] [2019-12-18 15:30:04,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:04,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:30:04,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118007659] [2019-12-18 15:30:04,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-18 15:30:04,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:04,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-18 15:30:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 15:30:04,747 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 2 states. [2019-12-18 15:30:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:04,766 INFO L93 Difference]: Finished difference Result 139 states and 298 transitions. [2019-12-18 15:30:04,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-18 15:30:04,768 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2019-12-18 15:30:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:04,782 INFO L225 Difference]: With dead ends: 139 [2019-12-18 15:30:04,782 INFO L226 Difference]: Without dead ends: 128 [2019-12-18 15:30:04,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-18 15:30:04,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-18 15:30:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-12-18 15:30:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-18 15:30:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 277 transitions. [2019-12-18 15:30:04,835 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 277 transitions. Word has length 5 [2019-12-18 15:30:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:04,835 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 277 transitions. [2019-12-18 15:30:04,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-18 15:30:04,836 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 277 transitions. [2019-12-18 15:30:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-18 15:30:04,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:04,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-18 15:30:04,856 INFO L410 AbstractCegarLoop]: === Iteration 2 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:04,857 INFO L82 PathProgramCache]: Analyzing trace with hash -2105704442, now seen corresponding path program 1 times [2019-12-18 15:30:04,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:04,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518924644] [2019-12-18 15:30:04,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:04,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518924644] [2019-12-18 15:30:04,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:04,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:30:04,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891552370] [2019-12-18 15:30:04,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:30:04,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:30:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:30:04,968 INFO L87 Difference]: Start difference. First operand 128 states and 277 transitions. Second operand 3 states. [2019-12-18 15:30:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:05,018 INFO L93 Difference]: Finished difference Result 200 states and 438 transitions. [2019-12-18 15:30:05,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:30:05,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-18 15:30:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:05,026 INFO L225 Difference]: With dead ends: 200 [2019-12-18 15:30:05,026 INFO L226 Difference]: Without dead ends: 200 [2019-12-18 15:30:05,027 INFO L631 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-12-18 15:30:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-18 15:30:05,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 155. [2019-12-18 15:30:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-12-18 15:30:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 343 transitions. [2019-12-18 15:30:05,066 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 343 transitions. Word has length 6 [2019-12-18 15:30:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:05,066 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 343 transitions. [2019-12-18 15:30:05,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:30:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 343 transitions. [2019-12-18 15:30:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 15:30:05,068 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:05,069 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:05,069 INFO L410 AbstractCegarLoop]: === Iteration 3 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:05,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:05,071 INFO L82 PathProgramCache]: Analyzing trace with hash 282683680, now seen corresponding path program 1 times [2019-12-18 15:30:05,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:05,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473895686] [2019-12-18 15:30:05,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:05,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473895686] [2019-12-18 15:30:05,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:05,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:30:05,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573072817] [2019-12-18 15:30:05,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:30:05,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:05,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:30:05,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:30:05,258 INFO L87 Difference]: Start difference. First operand 155 states and 343 transitions. Second operand 7 states. [2019-12-18 15:30:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:05,616 INFO L93 Difference]: Finished difference Result 181 states and 391 transitions. [2019-12-18 15:30:05,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:30:05,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-18 15:30:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:05,618 INFO L225 Difference]: With dead ends: 181 [2019-12-18 15:30:05,619 INFO L226 Difference]: Without dead ends: 162 [2019-12-18 15:30:05,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:30:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-18 15:30:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-18 15:30:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-18 15:30:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 359 transitions. [2019-12-18 15:30:05,633 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 359 transitions. Word has length 10 [2019-12-18 15:30:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:05,633 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 359 transitions. [2019-12-18 15:30:05,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:30:05,633 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 359 transitions. [2019-12-18 15:30:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 15:30:05,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:05,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:05,635 INFO L410 AbstractCegarLoop]: === Iteration 4 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:05,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1366120806, now seen corresponding path program 1 times [2019-12-18 15:30:05,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:05,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55428339] [2019-12-18 15:30:05,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:06,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:06,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55428339] [2019-12-18 15:30:06,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:06,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 15:30:06,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326605279] [2019-12-18 15:30:06,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:30:06,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:06,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:30:06,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:30:06,163 INFO L87 Difference]: Start difference. First operand 162 states and 359 transitions. Second operand 12 states. [2019-12-18 15:30:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:07,757 INFO L93 Difference]: Finished difference Result 205 states and 441 transitions. [2019-12-18 15:30:07,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 15:30:07,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-12-18 15:30:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:07,760 INFO L225 Difference]: With dead ends: 205 [2019-12-18 15:30:07,760 INFO L226 Difference]: Without dead ends: 195 [2019-12-18 15:30:07,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:30:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-18 15:30:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 183. [2019-12-18 15:30:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-18 15:30:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 401 transitions. [2019-12-18 15:30:07,773 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 401 transitions. Word has length 16 [2019-12-18 15:30:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:07,774 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 401 transitions. [2019-12-18 15:30:07,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:30:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 401 transitions. [2019-12-18 15:30:07,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 15:30:07,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:07,776 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:07,776 INFO L410 AbstractCegarLoop]: === Iteration 5 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:07,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:07,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1230311642, now seen corresponding path program 2 times [2019-12-18 15:30:07,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:07,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452478163] [2019-12-18 15:30:07,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:08,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452478163] [2019-12-18 15:30:08,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:08,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 15:30:08,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121819857] [2019-12-18 15:30:08,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:30:08,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:08,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:30:08,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:30:08,336 INFO L87 Difference]: Start difference. First operand 183 states and 401 transitions. Second operand 13 states. [2019-12-18 15:30:09,888 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-12-18 15:30:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:10,544 INFO L93 Difference]: Finished difference Result 208 states and 440 transitions. [2019-12-18 15:30:10,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:30:10,545 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-18 15:30:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:10,547 INFO L225 Difference]: With dead ends: 208 [2019-12-18 15:30:10,547 INFO L226 Difference]: Without dead ends: 197 [2019-12-18 15:30:10,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=282, Invalid=710, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:30:10,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-18 15:30:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 170. [2019-12-18 15:30:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-18 15:30:10,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 371 transitions. [2019-12-18 15:30:10,557 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 371 transitions. Word has length 16 [2019-12-18 15:30:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:10,558 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 371 transitions. [2019-12-18 15:30:10,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:30:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 371 transitions. [2019-12-18 15:30:10,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:30:10,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:10,559 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:10,560 INFO L410 AbstractCegarLoop]: === Iteration 6 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:10,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:10,560 INFO L82 PathProgramCache]: Analyzing trace with hash 145495381, now seen corresponding path program 1 times [2019-12-18 15:30:10,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:10,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108095382] [2019-12-18 15:30:10,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:11,051 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2019-12-18 15:30:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:11,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108095382] [2019-12-18 15:30:11,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:11,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:11,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725350930] [2019-12-18 15:30:11,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:30:11,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:30:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:30:11,359 INFO L87 Difference]: Start difference. First operand 170 states and 371 transitions. Second operand 15 states. [2019-12-18 15:30:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:12,946 INFO L93 Difference]: Finished difference Result 261 states and 568 transitions. [2019-12-18 15:30:12,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:30:12,946 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 15:30:12,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:12,950 INFO L225 Difference]: With dead ends: 261 [2019-12-18 15:30:12,950 INFO L226 Difference]: Without dead ends: 261 [2019-12-18 15:30:12,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:30:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-18 15:30:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 237. [2019-12-18 15:30:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 15:30:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-18 15:30:12,961 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-18 15:30:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:12,963 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-18 15:30:12,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:30:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-18 15:30:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:30:12,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:12,965 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:12,965 INFO L410 AbstractCegarLoop]: === Iteration 7 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:12,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash 349911829, now seen corresponding path program 2 times [2019-12-18 15:30:12,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:12,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186192584] [2019-12-18 15:30:12,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:13,529 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 37 [2019-12-18 15:30:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:13,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186192584] [2019-12-18 15:30:13,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:13,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:30:13,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871110235] [2019-12-18 15:30:13,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:30:13,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:13,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:30:13,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:30:13,914 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 16 states. [2019-12-18 15:30:14,820 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-12-18 15:30:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:15,491 INFO L93 Difference]: Finished difference Result 307 states and 673 transitions. [2019-12-18 15:30:15,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:30:15,491 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 15:30:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:15,494 INFO L225 Difference]: With dead ends: 307 [2019-12-18 15:30:15,494 INFO L226 Difference]: Without dead ends: 307 [2019-12-18 15:30:15,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:30:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-18 15:30:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 237. [2019-12-18 15:30:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 15:30:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-18 15:30:15,512 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-18 15:30:15,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:15,512 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-18 15:30:15,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:30:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-18 15:30:15,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:30:15,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:15,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:15,520 INFO L410 AbstractCegarLoop]: === Iteration 8 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:15,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:15,520 INFO L82 PathProgramCache]: Analyzing trace with hash 599415313, now seen corresponding path program 3 times [2019-12-18 15:30:15,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:15,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120515661] [2019-12-18 15:30:15,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:16,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120515661] [2019-12-18 15:30:16,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:16,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:30:16,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36164605] [2019-12-18 15:30:16,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:30:16,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:16,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:30:16,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:30:16,312 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 16 states. [2019-12-18 15:30:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:18,048 INFO L93 Difference]: Finished difference Result 304 states and 667 transitions. [2019-12-18 15:30:18,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:30:18,048 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 15:30:18,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:18,050 INFO L225 Difference]: With dead ends: 304 [2019-12-18 15:30:18,051 INFO L226 Difference]: Without dead ends: 304 [2019-12-18 15:30:18,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:30:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-18 15:30:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 237. [2019-12-18 15:30:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-18 15:30:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 518 transitions. [2019-12-18 15:30:18,059 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 518 transitions. Word has length 18 [2019-12-18 15:30:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:18,059 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 518 transitions. [2019-12-18 15:30:18,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:30:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 518 transitions. [2019-12-18 15:30:18,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:30:18,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:18,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:18,062 INFO L410 AbstractCegarLoop]: === Iteration 9 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash -898885167, now seen corresponding path program 4 times [2019-12-18 15:30:18,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:18,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244142217] [2019-12-18 15:30:18,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:18,667 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 38 [2019-12-18 15:30:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:19,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244142217] [2019-12-18 15:30:19,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:19,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:19,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097114728] [2019-12-18 15:30:19,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:30:19,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:19,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:30:19,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:30:19,020 INFO L87 Difference]: Start difference. First operand 237 states and 518 transitions. Second operand 15 states. [2019-12-18 15:30:20,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:20,744 INFO L93 Difference]: Finished difference Result 419 states and 934 transitions. [2019-12-18 15:30:20,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:30:20,745 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 15:30:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:20,748 INFO L225 Difference]: With dead ends: 419 [2019-12-18 15:30:20,749 INFO L226 Difference]: Without dead ends: 419 [2019-12-18 15:30:20,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:30:20,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-12-18 15:30:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 243. [2019-12-18 15:30:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-18 15:30:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 531 transitions. [2019-12-18 15:30:20,758 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 531 transitions. Word has length 18 [2019-12-18 15:30:20,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:20,759 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 531 transitions. [2019-12-18 15:30:20,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:30:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 531 transitions. [2019-12-18 15:30:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:30:20,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:20,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:20,760 INFO L410 AbstractCegarLoop]: === Iteration 10 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:20,761 INFO L82 PathProgramCache]: Analyzing trace with hash 976531695, now seen corresponding path program 5 times [2019-12-18 15:30:20,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:20,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140872540] [2019-12-18 15:30:20,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:21,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140872540] [2019-12-18 15:30:21,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:21,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 15:30:21,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092839538] [2019-12-18 15:30:21,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:30:21,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:21,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:30:21,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:30:21,529 INFO L87 Difference]: Start difference. First operand 243 states and 531 transitions. Second operand 16 states. [2019-12-18 15:30:22,585 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2019-12-18 15:30:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:23,385 INFO L93 Difference]: Finished difference Result 322 states and 704 transitions. [2019-12-18 15:30:23,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:30:23,385 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-18 15:30:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:23,388 INFO L225 Difference]: With dead ends: 322 [2019-12-18 15:30:23,390 INFO L226 Difference]: Without dead ends: 322 [2019-12-18 15:30:23,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:30:23,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-18 15:30:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 243. [2019-12-18 15:30:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-12-18 15:30:23,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 531 transitions. [2019-12-18 15:30:23,403 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 531 transitions. Word has length 18 [2019-12-18 15:30:23,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:23,404 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 531 transitions. [2019-12-18 15:30:23,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:30:23,404 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 531 transitions. [2019-12-18 15:30:23,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:30:23,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:23,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:23,405 INFO L410 AbstractCegarLoop]: === Iteration 11 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:23,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1354999957, now seen corresponding path program 6 times [2019-12-18 15:30:23,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:23,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134720278] [2019-12-18 15:30:23,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:23,875 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 38 [2019-12-18 15:30:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:24,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134720278] [2019-12-18 15:30:24,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:30:24,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 15:30:24,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109947526] [2019-12-18 15:30:24,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:30:24,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:24,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:30:24,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:30:24,149 INFO L87 Difference]: Start difference. First operand 243 states and 531 transitions. Second operand 15 states. [2019-12-18 15:30:25,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:25,611 INFO L93 Difference]: Finished difference Result 301 states and 662 transitions. [2019-12-18 15:30:25,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:30:25,612 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 15:30:25,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:25,615 INFO L225 Difference]: With dead ends: 301 [2019-12-18 15:30:25,615 INFO L226 Difference]: Without dead ends: 301 [2019-12-18 15:30:25,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:30:25,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-18 15:30:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 222. [2019-12-18 15:30:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-18 15:30:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 489 transitions. [2019-12-18 15:30:25,623 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 489 transitions. Word has length 18 [2019-12-18 15:30:25,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:25,623 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 489 transitions. [2019-12-18 15:30:25,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:30:25,623 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 489 transitions. [2019-12-18 15:30:25,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:30:25,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:25,624 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:25,624 INFO L410 AbstractCegarLoop]: === Iteration 12 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:25,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:25,625 INFO L82 PathProgramCache]: Analyzing trace with hash 831318896, now seen corresponding path program 1 times [2019-12-18 15:30:25,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:25,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953785234] [2019-12-18 15:30:25,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:25,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953785234] [2019-12-18 15:30:25,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353020306] [2019-12-18 15:30:25,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:30:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:25,747 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-18 15:30:25,752 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:30:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:25,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:30:25,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-18 15:30:25,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959764875] [2019-12-18 15:30:25,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:30:25,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:25,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:30:25,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:30:25,772 INFO L87 Difference]: Start difference. First operand 222 states and 489 transitions. Second operand 5 states. [2019-12-18 15:30:25,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:25,792 INFO L93 Difference]: Finished difference Result 326 states and 718 transitions. [2019-12-18 15:30:25,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:30:25,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 15:30:25,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:25,795 INFO L225 Difference]: With dead ends: 326 [2019-12-18 15:30:25,795 INFO L226 Difference]: Without dead ends: 326 [2019-12-18 15:30:25,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:30:25,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-18 15:30:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 278. [2019-12-18 15:30:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-18 15:30:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 624 transitions. [2019-12-18 15:30:25,804 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 624 transitions. Word has length 21 [2019-12-18 15:30:25,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:25,805 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 624 transitions. [2019-12-18 15:30:25,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:30:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 624 transitions. [2019-12-18 15:30:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:30:25,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:25,806 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:26,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:30:26,011 INFO L410 AbstractCegarLoop]: === Iteration 13 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:26,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:26,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1273193156, now seen corresponding path program 7 times [2019-12-18 15:30:26,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:26,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433159704] [2019-12-18 15:30:26,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:26,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:26,580 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-12-18 15:30:27,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:27,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433159704] [2019-12-18 15:30:27,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313328447] [2019-12-18 15:30:27,288 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:30:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:27,391 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 93 conjunts are in the unsatisfiable core [2019-12-18 15:30:27,395 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:30:27,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 15:30:27,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:27,488 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 15:30:27,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:27,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:30:27,503 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:27,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:27,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:27,514 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 15:30:28,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,085 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:30:28,113 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:28,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:30:28,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:28,180 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 15:30:28,180 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:28,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-18 15:30:28,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:28,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:28,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,427 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:30:28,428 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:28,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:30:28,480 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:28,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:28,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:30:28,492 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:28,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:28,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:28,515 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-18 15:30:28,792 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:28,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 15:30:28,793 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:28,848 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 15:30:28,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:28,850 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:28,851 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:32 [2019-12-18 15:30:28,994 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:28,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 15:30:28,996 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:29,005 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:29,006 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:30:29,006 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2019-12-18 15:30:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:29,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:30:29,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 34 [2019-12-18 15:30:29,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576687151] [2019-12-18 15:30:29,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-18 15:30:29,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:29,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-18 15:30:29,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:30:29,101 INFO L87 Difference]: Start difference. First operand 278 states and 624 transitions. Second operand 36 states. [2019-12-18 15:30:29,712 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-12-18 15:30:30,057 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 53 [2019-12-18 15:30:30,322 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 57 [2019-12-18 15:30:30,551 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2019-12-18 15:30:32,018 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 15:30:32,657 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-12-18 15:30:33,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:33,702 INFO L93 Difference]: Finished difference Result 396 states and 871 transitions. [2019-12-18 15:30:33,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:30:33,703 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 23 [2019-12-18 15:30:33,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:33,705 INFO L225 Difference]: With dead ends: 396 [2019-12-18 15:30:33,706 INFO L226 Difference]: Without dead ends: 396 [2019-12-18 15:30:33,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=479, Invalid=3303, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 15:30:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-12-18 15:30:33,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 340. [2019-12-18 15:30:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 15:30:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 755 transitions. [2019-12-18 15:30:33,724 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 755 transitions. Word has length 23 [2019-12-18 15:30:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:33,726 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 755 transitions. [2019-12-18 15:30:33,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-18 15:30:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 755 transitions. [2019-12-18 15:30:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:30:33,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:33,730 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:33,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:30:33,934 INFO L410 AbstractCegarLoop]: === Iteration 14 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:33,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:33,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1480527740, now seen corresponding path program 8 times [2019-12-18 15:30:33,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:33,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682891018] [2019-12-18 15:30:33,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:34,510 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 40 [2019-12-18 15:30:35,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:35,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682891018] [2019-12-18 15:30:35,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667931540] [2019-12-18 15:30:35,142 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:30:35,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:30:35,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:30:35,238 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-18 15:30:35,242 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:30:35,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 15:30:35,257 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:35,276 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 15:30:35,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:35,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:30:35,283 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:35,292 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:35,293 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:35,293 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:30:35,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:35,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:35,804 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:30:35,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:35,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:30:35,832 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:35,887 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 15:30:35,888 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:35,888 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 15:30:36,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:36,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:36,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,070 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:30:36,071 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:36,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:30:36,097 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:36,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:36,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:30:36,107 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:36,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:36,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:36,127 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 15:30:36,434 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:36,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 15:30:36,435 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:36,492 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 15:30:36,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:36,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:36,494 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-18 15:30:36,624 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:36,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 15:30:36,625 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:36,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:36,629 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:30:36,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-18 15:30:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:36,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:30:36,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-18 15:30:36,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471250625] [2019-12-18 15:30:36,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-18 15:30:36,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:36,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-18 15:30:36,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 15:30:36,656 INFO L87 Difference]: Start difference. First operand 340 states and 755 transitions. Second operand 33 states. [2019-12-18 15:30:37,756 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-12-18 15:30:37,985 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-12-18 15:30:39,283 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-18 15:30:39,655 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-12-18 15:30:40,338 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-12-18 15:30:41,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:41,376 INFO L93 Difference]: Finished difference Result 437 states and 960 transitions. [2019-12-18 15:30:41,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:30:41,377 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 23 [2019-12-18 15:30:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:41,379 INFO L225 Difference]: With dead ends: 437 [2019-12-18 15:30:41,379 INFO L226 Difference]: Without dead ends: 437 [2019-12-18 15:30:41,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=432, Invalid=2990, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 15:30:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-18 15:30:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 340. [2019-12-18 15:30:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-18 15:30:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 755 transitions. [2019-12-18 15:30:41,390 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 755 transitions. Word has length 23 [2019-12-18 15:30:41,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:41,390 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 755 transitions. [2019-12-18 15:30:41,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-18 15:30:41,391 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 755 transitions. [2019-12-18 15:30:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:30:41,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:41,392 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:41,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:30:41,600 INFO L410 AbstractCegarLoop]: === Iteration 15 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:41,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:41,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1675104768, now seen corresponding path program 9 times [2019-12-18 15:30:41,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:41,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115762792] [2019-12-18 15:30:41,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:42,083 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 37 [2019-12-18 15:30:42,789 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2019-12-18 15:30:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:43,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115762792] [2019-12-18 15:30:43,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880911994] [2019-12-18 15:30:43,058 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:30:43,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 15:30:43,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:30:43,141 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 95 conjunts are in the unsatisfiable core [2019-12-18 15:30:43,142 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:30:43,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:30:43,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:30:43,186 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:30:43,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:30:43,192 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:43,203 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:43,204 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:43,204 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:30:43,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,586 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:30:43,611 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:43,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:30:43,613 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:43,667 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 15:30:43,668 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:43,668 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-18 15:30:43,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:43,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:43,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,951 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:30:43,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:30:43,955 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:43,962 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,964 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,986 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:30:43,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:30:43,991 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:43,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:43,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:44,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:44,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:30:44,002 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:44,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:44,023 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:44,024 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 15:30:44,289 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:44,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 15:30:44,291 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:44,354 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 15:30:44,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:44,356 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:44,356 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-18 15:30:44,478 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:44,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 15:30:44,480 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:44,488 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:44,488 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:30:44,489 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-18 15:30:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:44,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:30:44,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-12-18 15:30:44,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452571230] [2019-12-18 15:30:44,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-18 15:30:44,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:44,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-18 15:30:44,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 15:30:44,518 INFO L87 Difference]: Start difference. First operand 340 states and 755 transitions. Second operand 35 states. [2019-12-18 15:30:45,251 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-12-18 15:30:45,554 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-12-18 15:30:45,814 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 58 [2019-12-18 15:30:45,996 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 50 [2019-12-18 15:30:46,184 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-12-18 15:30:46,348 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-12-18 15:30:46,611 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 64 [2019-12-18 15:30:46,973 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-12-18 15:30:47,220 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 68 [2019-12-18 15:30:47,446 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 50 [2019-12-18 15:30:47,802 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-12-18 15:30:47,981 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 61 [2019-12-18 15:30:48,241 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 54 [2019-12-18 15:30:48,478 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 58 [2019-12-18 15:30:48,803 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2019-12-18 15:30:49,063 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 67 [2019-12-18 15:30:49,274 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-12-18 15:30:49,472 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 63 [2019-12-18 15:30:49,681 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 54 [2019-12-18 15:30:49,887 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2019-12-18 15:30:50,059 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-12-18 15:30:50,329 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 66 [2019-12-18 15:30:50,631 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 60 [2019-12-18 15:30:50,968 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 76 [2019-12-18 15:30:51,223 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 63 [2019-12-18 15:30:51,470 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 65 [2019-12-18 15:30:51,724 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 56 [2019-12-18 15:30:51,944 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-12-18 15:30:54,467 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 56 [2019-12-18 15:30:55,165 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-12-18 15:30:55,312 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-12-18 15:30:55,585 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-12-18 15:30:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:30:56,186 INFO L93 Difference]: Finished difference Result 518 states and 1137 transitions. [2019-12-18 15:30:56,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-18 15:30:56,187 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 23 [2019-12-18 15:30:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:30:56,192 INFO L225 Difference]: With dead ends: 518 [2019-12-18 15:30:56,192 INFO L226 Difference]: Without dead ends: 518 [2019-12-18 15:30:56,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2578 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1382, Invalid=7930, Unknown=0, NotChecked=0, Total=9312 [2019-12-18 15:30:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-12-18 15:30:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 353. [2019-12-18 15:30:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-18 15:30:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 789 transitions. [2019-12-18 15:30:56,205 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 789 transitions. Word has length 23 [2019-12-18 15:30:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:30:56,205 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 789 transitions. [2019-12-18 15:30:56,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-18 15:30:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 789 transitions. [2019-12-18 15:30:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:30:56,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:30:56,206 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:30:56,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:30:56,410 INFO L410 AbstractCegarLoop]: === Iteration 16 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:30:56,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:30:56,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1319631296, now seen corresponding path program 10 times [2019-12-18 15:30:56,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:30:56,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706716791] [2019-12-18 15:30:56,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:30:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:30:56,868 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2019-12-18 15:30:57,122 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2019-12-18 15:30:57,546 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2019-12-18 15:30:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:57,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706716791] [2019-12-18 15:30:57,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606999357] [2019-12-18 15:30:57,909 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:30:57,980 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:30:57,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:30:57,982 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 101 conjunts are in the unsatisfiable core [2019-12-18 15:30:57,989 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:30:57,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 15:30:57,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:58,017 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 15:30:58,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:30:58,024 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:58,035 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:58,036 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:58,036 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 15:30:58,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,456 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:30:58,479 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:58,480 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:30:58,481 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:58,545 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 15:30:58,546 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:58,546 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:52 [2019-12-18 15:30:58,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:58,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:58,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,692 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:30:58,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:30:58,715 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:58,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:30:58,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:30:58,747 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:58,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:30:58,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:30:58,762 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:58,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:58,780 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:58,781 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:260, output treesize:46 [2019-12-18 15:30:59,084 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:59,084 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 15:30:59,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:59,144 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 15:30:59,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:30:59,146 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:30:59,146 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:32 [2019-12-18 15:30:59,274 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:59,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 15:30:59,275 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:30:59,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:30:59,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:30:59,296 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2019-12-18 15:30:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:30:59,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:30:59,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2019-12-18 15:30:59,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426641433] [2019-12-18 15:30:59,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-18 15:30:59,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:30:59,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-18 15:30:59,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1084, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 15:30:59,322 INFO L87 Difference]: Start difference. First operand 353 states and 789 transitions. Second operand 35 states. [2019-12-18 15:30:59,940 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-18 15:31:00,466 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2019-12-18 15:31:00,739 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-12-18 15:31:01,149 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2019-12-18 15:31:01,357 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 60 [2019-12-18 15:31:01,534 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 49 [2019-12-18 15:31:01,917 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-12-18 15:31:02,104 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 53 [2019-12-18 15:31:02,319 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 57 [2019-12-18 15:31:02,685 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-12-18 15:31:02,913 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-12-18 15:31:03,138 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 66 [2019-12-18 15:31:03,354 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2019-12-18 15:31:03,670 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 74 [2019-12-18 15:31:03,971 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 65 [2019-12-18 15:31:04,253 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 59 [2019-12-18 15:31:04,720 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-12-18 15:31:05,003 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 57 [2019-12-18 15:31:05,950 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 49 [2019-12-18 15:31:06,166 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 56 [2019-12-18 15:31:06,312 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-12-18 15:31:06,480 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 53 [2019-12-18 15:31:06,754 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 58 [2019-12-18 15:31:07,073 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 55 [2019-12-18 15:31:07,271 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 49 [2019-12-18 15:31:07,505 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 60 [2019-12-18 15:31:07,666 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 47 [2019-12-18 15:31:08,241 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 62 [2019-12-18 15:31:08,646 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2019-12-18 15:31:08,838 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 51 [2019-12-18 15:31:09,249 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 62 [2019-12-18 15:31:09,802 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 51 [2019-12-18 15:31:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:10,407 INFO L93 Difference]: Finished difference Result 542 states and 1191 transitions. [2019-12-18 15:31:10,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-18 15:31:10,408 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 23 [2019-12-18 15:31:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:10,411 INFO L225 Difference]: With dead ends: 542 [2019-12-18 15:31:10,411 INFO L226 Difference]: Without dead ends: 542 [2019-12-18 15:31:10,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2299 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1206, Invalid=7350, Unknown=0, NotChecked=0, Total=8556 [2019-12-18 15:31:10,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-12-18 15:31:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 336. [2019-12-18 15:31:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-12-18 15:31:10,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 746 transitions. [2019-12-18 15:31:10,422 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 746 transitions. Word has length 23 [2019-12-18 15:31:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:10,422 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 746 transitions. [2019-12-18 15:31:10,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-18 15:31:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 746 transitions. [2019-12-18 15:31:10,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:31:10,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:10,423 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:31:10,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:10,627 INFO L410 AbstractCegarLoop]: === Iteration 17 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:31:10,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash 378903552, now seen corresponding path program 11 times [2019-12-18 15:31:10,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:10,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500302288] [2019-12-18 15:31:10,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:11,025 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 43 [2019-12-18 15:31:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:11,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500302288] [2019-12-18 15:31:11,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111743194] [2019-12-18 15:31:11,726 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:11,795 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:31:11,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:31:11,797 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-18 15:31:11,800 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:31:11,814 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-12-18 15:31:11,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:11,835 INFO L614 ElimStorePlain]: treesize reduction 12, result has 78.9 percent of original size [2019-12-18 15:31:11,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:11,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:31:11,842 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:11,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:11,851 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:11,851 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:31:12,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,228 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:12,258 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:12,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:31:12,259 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:12,312 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 15:31:12,313 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:12,313 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:52 [2019-12-18 15:31:12,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:12,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:12,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:12,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,477 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:31:12,478 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:12,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,505 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:12,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:31:12,514 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:12,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:12,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:31:12,523 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:12,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:12,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:12,540 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:260, output treesize:46 [2019-12-18 15:31:12,863 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:12,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 103 [2019-12-18 15:31:12,865 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:12,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:12,881 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:12,882 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:39 [2019-12-18 15:31:13,020 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:13,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-18 15:31:13,021 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:13,028 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:13,028 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:31:13,029 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-18 15:31:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:13,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:31:13,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 34 [2019-12-18 15:31:13,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615430972] [2019-12-18 15:31:13,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-18 15:31:13,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:13,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-18 15:31:13,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:31:13,111 INFO L87 Difference]: Start difference. First operand 336 states and 746 transitions. Second operand 36 states. [2019-12-18 15:31:14,074 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-12-18 15:31:14,246 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-12-18 15:31:14,475 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 58 [2019-12-18 15:31:14,861 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-12-18 15:31:16,352 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-12-18 15:31:16,670 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-12-18 15:31:17,200 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-12-18 15:31:17,467 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-18 15:31:17,778 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-12-18 15:31:18,170 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 67 [2019-12-18 15:31:18,692 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 65 [2019-12-18 15:31:19,048 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2019-12-18 15:31:19,387 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 63 [2019-12-18 15:31:19,579 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-18 15:31:19,822 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2019-12-18 15:31:20,035 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-18 15:31:20,224 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-12-18 15:31:20,468 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-12-18 15:31:20,766 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2019-12-18 15:31:21,030 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2019-12-18 15:31:21,270 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-12-18 15:31:21,500 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2019-12-18 15:31:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:22,688 INFO L93 Difference]: Finished difference Result 611 states and 1335 transitions. [2019-12-18 15:31:22,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-18 15:31:22,689 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 23 [2019-12-18 15:31:22,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:22,693 INFO L225 Difference]: With dead ends: 611 [2019-12-18 15:31:22,693 INFO L226 Difference]: Without dead ends: 611 [2019-12-18 15:31:22,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=821, Invalid=5341, Unknown=0, NotChecked=0, Total=6162 [2019-12-18 15:31:22,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-12-18 15:31:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 400. [2019-12-18 15:31:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-12-18 15:31:22,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 884 transitions. [2019-12-18 15:31:22,704 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 884 transitions. Word has length 23 [2019-12-18 15:31:22,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:22,705 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 884 transitions. [2019-12-18 15:31:22,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-18 15:31:22,705 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 884 transitions. [2019-12-18 15:31:22,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:31:22,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:22,706 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:31:22,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:22,909 INFO L410 AbstractCegarLoop]: === Iteration 18 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:31:22,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:22,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1115213342, now seen corresponding path program 12 times [2019-12-18 15:31:22,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:22,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815077741] [2019-12-18 15:31:22,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:24,151 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:24,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815077741] [2019-12-18 15:31:24,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598805895] [2019-12-18 15:31:24,152 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:24,238 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 15:31:24,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:31:24,241 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 95 conjunts are in the unsatisfiable core [2019-12-18 15:31:24,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:31:24,253 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 15:31:24,254 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:24,273 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 15:31:24,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:24,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:31:24,280 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:24,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:24,290 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:24,291 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:31:24,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:24,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:24,742 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:24,765 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:24,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:31:24,767 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:24,826 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 15:31:24,827 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:24,827 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 15:31:24,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:24,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:24,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:24,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:24,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:25,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:25,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:31:25,009 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:25,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:25,018 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:25,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:25,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:25,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:31:25,038 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:25,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:25,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:25,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:25,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:31:25,049 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:25,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:25,072 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:25,072 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 15:31:25,315 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:25,316 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 15:31:25,317 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:25,377 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 15:31:25,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:25,379 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:25,379 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:32 [2019-12-18 15:31:25,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:25,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 15:31:25,504 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:25,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:25,509 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:31:25,509 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:7 [2019-12-18 15:31:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:25,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:31:25,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-18 15:31:25,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545646293] [2019-12-18 15:31:25,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-18 15:31:25,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:25,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-18 15:31:25,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 15:31:25,535 INFO L87 Difference]: Start difference. First operand 400 states and 884 transitions. Second operand 33 states. [2019-12-18 15:31:26,641 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 52 [2019-12-18 15:31:26,910 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 56 [2019-12-18 15:31:27,138 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2019-12-18 15:31:28,233 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-18 15:31:28,618 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-12-18 15:31:28,848 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-18 15:31:29,276 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-12-18 15:31:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:30,253 INFO L93 Difference]: Finished difference Result 503 states and 1101 transitions. [2019-12-18 15:31:30,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 15:31:30,254 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 23 [2019-12-18 15:31:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:30,257 INFO L225 Difference]: With dead ends: 503 [2019-12-18 15:31:30,257 INFO L226 Difference]: Without dead ends: 503 [2019-12-18 15:31:30,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 831 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=452, Invalid=3088, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 15:31:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-12-18 15:31:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 400. [2019-12-18 15:31:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-12-18 15:31:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 884 transitions. [2019-12-18 15:31:30,267 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 884 transitions. Word has length 23 [2019-12-18 15:31:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:30,267 INFO L462 AbstractCegarLoop]: Abstraction has 400 states and 884 transitions. [2019-12-18 15:31:30,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-18 15:31:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 884 transitions. [2019-12-18 15:31:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:31:30,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:30,269 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:31:30,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:30,472 INFO L410 AbstractCegarLoop]: === Iteration 19 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:31:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1827682534, now seen corresponding path program 13 times [2019-12-18 15:31:30,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:30,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873158626] [2019-12-18 15:31:30,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:30,931 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 43 [2019-12-18 15:31:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:31,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873158626] [2019-12-18 15:31:31,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565150341] [2019-12-18 15:31:31,580 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:31,645 WARN L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 93 conjunts are in the unsatisfiable core [2019-12-18 15:31:31,646 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:31:31,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 15:31:31,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:31,682 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 15:31:31,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:31,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:31:31,687 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:31,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:31,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:31,698 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 15:31:32,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,178 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:32,209 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:32,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:31:32,210 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:32,269 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 15:31:32,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:32,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-18 15:31:32,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:32,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:32,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,450 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:31:32,450 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:32,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:31:32,483 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:32,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:32,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:31:32,492 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:32,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:32,510 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:32,511 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-18 15:31:32,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:32,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 127 [2019-12-18 15:31:32,742 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:32,802 INFO L614 ElimStorePlain]: treesize reduction 64, result has 48.8 percent of original size [2019-12-18 15:31:32,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:32,804 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:32,804 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:61, output treesize:32 [2019-12-18 15:31:32,920 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:32,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2019-12-18 15:31:32,921 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:32,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:32,932 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:31:32,932 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:7 [2019-12-18 15:31:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:32,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:31:32,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 34 [2019-12-18 15:31:32,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722350991] [2019-12-18 15:31:32,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-18 15:31:33,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:33,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-18 15:31:33,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:31:33,000 INFO L87 Difference]: Start difference. First operand 400 states and 884 transitions. Second operand 36 states. [2019-12-18 15:31:33,891 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2019-12-18 15:31:34,126 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-12-18 15:31:34,326 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-12-18 15:31:35,452 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-18 15:31:35,825 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-18 15:31:36,487 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2019-12-18 15:31:37,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:37,469 INFO L93 Difference]: Finished difference Result 470 states and 1032 transitions. [2019-12-18 15:31:37,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:31:37,469 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 23 [2019-12-18 15:31:37,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:37,472 INFO L225 Difference]: With dead ends: 470 [2019-12-18 15:31:37,472 INFO L226 Difference]: Without dead ends: 470 [2019-12-18 15:31:37,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=482, Invalid=3300, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 15:31:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-12-18 15:31:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 364. [2019-12-18 15:31:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-12-18 15:31:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 809 transitions. [2019-12-18 15:31:37,481 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 809 transitions. Word has length 23 [2019-12-18 15:31:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:37,481 INFO L462 AbstractCegarLoop]: Abstraction has 364 states and 809 transitions. [2019-12-18 15:31:37,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-18 15:31:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 809 transitions. [2019-12-18 15:31:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:37,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:37,483 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:31:37,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:37,686 INFO L410 AbstractCegarLoop]: === Iteration 20 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:31:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2090449835, now seen corresponding path program 14 times [2019-12-18 15:31:37,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:37,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322455511] [2019-12-18 15:31:37,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:38,480 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2019-12-18 15:31:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:39,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322455511] [2019-12-18 15:31:39,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932553416] [2019-12-18 15:31:39,031 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:39,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:31:39,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:31:39,106 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 98 conjunts are in the unsatisfiable core [2019-12-18 15:31:39,107 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:31:39,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:31:39,115 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:31:39,141 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:31:39,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,145 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:31:39,146 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:39,157 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:39,157 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:39,158 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:31:39,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,597 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:39,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:39,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:31:39,623 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:39,680 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 15:31:39,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:39,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 15:31:39,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:39,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:39,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:31:39,876 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:39,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,908 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:31:39,908 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:39,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:39,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:31:39,916 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:39,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:39,935 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:39,936 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 15:31:40,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:40,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:40,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:40,198 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:40,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 15:31:40,200 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:40,260 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-18 15:31:40,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:40,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 15:31:40,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:40,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:40,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 15:31:40,371 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:40,412 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 15:31:40,412 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:40,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 15:31:40,431 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:40,493 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-18 15:31:40,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:40,494 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-18 15:31:40,651 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:40,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 15:31:40,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:40,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:40,658 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:31:40,658 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-18 15:31:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:40,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:31:40,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 35 [2019-12-18 15:31:40,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802545114] [2019-12-18 15:31:40,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-18 15:31:40,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:40,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-18 15:31:40,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 15:31:40,749 INFO L87 Difference]: Start difference. First operand 364 states and 809 transitions. Second operand 37 states. [2019-12-18 15:31:41,620 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-12-18 15:31:41,848 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 56 [2019-12-18 15:31:42,062 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65 [2019-12-18 15:31:42,893 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-18 15:31:43,110 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-18 15:31:43,558 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-12-18 15:31:44,215 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-18 15:31:44,470 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-12-18 15:31:44,916 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-12-18 15:31:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:45,700 INFO L93 Difference]: Finished difference Result 532 states and 1171 transitions. [2019-12-18 15:31:45,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:31:45,701 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 25 [2019-12-18 15:31:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:45,704 INFO L225 Difference]: With dead ends: 532 [2019-12-18 15:31:45,704 INFO L226 Difference]: Without dead ends: 532 [2019-12-18 15:31:45,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=486, Invalid=3420, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 15:31:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-18 15:31:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 376. [2019-12-18 15:31:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-12-18 15:31:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 833 transitions. [2019-12-18 15:31:45,714 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 833 transitions. Word has length 25 [2019-12-18 15:31:45,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:45,714 INFO L462 AbstractCegarLoop]: Abstraction has 376 states and 833 transitions. [2019-12-18 15:31:45,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-18 15:31:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 833 transitions. [2019-12-18 15:31:45,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:45,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:45,715 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:31:45,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:45,919 INFO L410 AbstractCegarLoop]: === Iteration 21 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:31:45,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:45,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1978593398, now seen corresponding path program 1 times [2019-12-18 15:31:45,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:45,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765302246] [2019-12-18 15:31:45,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:46,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765302246] [2019-12-18 15:31:46,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533433723] [2019-12-18 15:31:46,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:46,953 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 78 conjunts are in the unsatisfiable core [2019-12-18 15:31:46,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:31:46,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:31:46,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:31:47,011 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:31:47,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:47,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:31:47,017 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:47,025 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:47,026 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:47,026 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:31:47,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:47,334 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:47,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:31:47,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:47,381 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-18 15:31:47,381 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:47,382 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-18 15:31:47,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:47,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:47,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:47,454 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 15:31:47,455 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:47,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:47,471 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 15:31:47,472 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:47,474 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 15:31:47,475 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:47,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:47,485 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:47,485 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 15:31:47,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:47,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:47,674 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:47,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:47,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 15:31:47,681 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:47,695 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:47,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:47,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 15:31:47,700 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:47,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 15:31:47,704 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:47,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:47,715 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:47,715 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 15:31:47,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:47,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:31:47,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 29 [2019-12-18 15:31:47,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661249194] [2019-12-18 15:31:47,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-18 15:31:47,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:47,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-18 15:31:47,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:31:47,820 INFO L87 Difference]: Start difference. First operand 376 states and 833 transitions. Second operand 30 states. [2019-12-18 15:31:48,698 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2019-12-18 15:31:49,042 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2019-12-18 15:31:49,302 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-12-18 15:31:49,486 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2019-12-18 15:31:49,808 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 60 [2019-12-18 15:31:49,975 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 47 [2019-12-18 15:31:50,278 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 57 [2019-12-18 15:31:51,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:51,393 INFO L93 Difference]: Finished difference Result 464 states and 1011 transitions. [2019-12-18 15:31:51,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 15:31:51,393 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 25 [2019-12-18 15:31:51,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:51,396 INFO L225 Difference]: With dead ends: 464 [2019-12-18 15:31:51,396 INFO L226 Difference]: Without dead ends: 447 [2019-12-18 15:31:51,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=371, Invalid=1885, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 15:31:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-18 15:31:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 435. [2019-12-18 15:31:51,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-12-18 15:31:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 959 transitions. [2019-12-18 15:31:51,405 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 959 transitions. Word has length 25 [2019-12-18 15:31:51,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:51,405 INFO L462 AbstractCegarLoop]: Abstraction has 435 states and 959 transitions. [2019-12-18 15:31:51,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-18 15:31:51,405 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 959 transitions. [2019-12-18 15:31:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:51,406 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:51,407 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:31:51,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:51,610 INFO L410 AbstractCegarLoop]: === Iteration 22 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:31:51,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:51,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1352666678, now seen corresponding path program 2 times [2019-12-18 15:31:51,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:51,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607853732] [2019-12-18 15:31:51,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:52,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607853732] [2019-12-18 15:31:52,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843271521] [2019-12-18 15:31:52,449 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:52,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:31:52,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:31:52,523 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 78 conjunts are in the unsatisfiable core [2019-12-18 15:31:52,525 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:31:52,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:31:52,535 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:31:52,564 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:31:52,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:52,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:31:52,570 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:52,579 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:52,579 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:52,580 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:31:52,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:52,859 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:52,859 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:31:52,860 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:52,901 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-18 15:31:52,902 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:52,902 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-18 15:31:53,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:53,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:53,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:53,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 15:31:53,040 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:53,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:53,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 15:31:53,054 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:53,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 15:31:53,060 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:53,068 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:53,069 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:53,069 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 15:31:53,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:53,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:53,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:53,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:53,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 15:31:53,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:53,236 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:53,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:53,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 15:31:53,241 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:53,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 15:31:53,246 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:53,278 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:53,278 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:53,278 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 15:31:53,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:53,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:31:53,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 31 [2019-12-18 15:31:53,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347290155] [2019-12-18 15:31:53,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-18 15:31:53,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:53,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-18 15:31:53,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:31:53,431 INFO L87 Difference]: Start difference. First operand 435 states and 959 transitions. Second operand 32 states. [2019-12-18 15:31:55,769 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2019-12-18 15:31:56,258 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 54 [2019-12-18 15:31:56,791 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 51 [2019-12-18 15:31:58,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:31:58,227 INFO L93 Difference]: Finished difference Result 548 states and 1192 transitions. [2019-12-18 15:31:58,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:31:58,227 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 25 [2019-12-18 15:31:58,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:31:58,230 INFO L225 Difference]: With dead ends: 548 [2019-12-18 15:31:58,230 INFO L226 Difference]: Without dead ends: 531 [2019-12-18 15:31:58,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=522, Invalid=2900, Unknown=0, NotChecked=0, Total=3422 [2019-12-18 15:31:58,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-12-18 15:31:58,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 472. [2019-12-18 15:31:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-12-18 15:31:58,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1038 transitions. [2019-12-18 15:31:58,239 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1038 transitions. Word has length 25 [2019-12-18 15:31:58,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:31:58,239 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 1038 transitions. [2019-12-18 15:31:58,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-18 15:31:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1038 transitions. [2019-12-18 15:31:58,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:31:58,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:31:58,241 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:31:58,444 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:58,444 INFO L410 AbstractCegarLoop]: === Iteration 23 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:31:58,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:31:58,445 INFO L82 PathProgramCache]: Analyzing trace with hash 638994318, now seen corresponding path program 3 times [2019-12-18 15:31:58,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:31:58,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771409534] [2019-12-18 15:31:58,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:31:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:31:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:59,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771409534] [2019-12-18 15:31:59,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684282377] [2019-12-18 15:31:59,046 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:31:59,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 15:31:59,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:31:59,117 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 76 conjunts are in the unsatisfiable core [2019-12-18 15:31:59,119 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:31:59,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:31:59,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:31:59,154 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:31:59,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:59,160 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:31:59,160 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:59,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:59,169 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:59,170 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:31:59,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:59,389 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:59,389 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:31:59,390 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:59,432 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.0 percent of original size [2019-12-18 15:31:59,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:59,433 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2019-12-18 15:31:59,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:59,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:59,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:59,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 15:31:59,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:59,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:59,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 15:31:59,514 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:59,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 15:31:59,525 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:59,534 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:59,535 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:59,535 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 15:31:59,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:59,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:59,728 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:59,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:59,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2019-12-18 15:31:59,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:59,746 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:31:59,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:31:59,751 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-12-18 15:31:59,751 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:59,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-12-18 15:31:59,755 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:31:59,765 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:31:59,766 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:31:59,766 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:29 [2019-12-18 15:31:59,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:31:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:31:59,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:31:59,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2019-12-18 15:31:59,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922118437] [2019-12-18 15:31:59,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-18 15:31:59,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:31:59,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-18 15:31:59,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=728, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:31:59,855 INFO L87 Difference]: Start difference. First operand 472 states and 1038 transitions. Second operand 29 states. [2019-12-18 15:32:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:03,160 INFO L93 Difference]: Finished difference Result 543 states and 1182 transitions. [2019-12-18 15:32:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:32:03,160 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-12-18 15:32:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:03,163 INFO L225 Difference]: With dead ends: 543 [2019-12-18 15:32:03,163 INFO L226 Difference]: Without dead ends: 526 [2019-12-18 15:32:03,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=384, Invalid=2166, Unknown=0, NotChecked=0, Total=2550 [2019-12-18 15:32:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-18 15:32:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 472. [2019-12-18 15:32:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-12-18 15:32:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 1038 transitions. [2019-12-18 15:32:03,172 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 1038 transitions. Word has length 25 [2019-12-18 15:32:03,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:03,172 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 1038 transitions. [2019-12-18 15:32:03,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-18 15:32:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 1038 transitions. [2019-12-18 15:32:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:32:03,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:03,174 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:03,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:03,377 INFO L410 AbstractCegarLoop]: === Iteration 24 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:03,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:03,377 INFO L82 PathProgramCache]: Analyzing trace with hash -631310293, now seen corresponding path program 15 times [2019-12-18 15:32:03,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:03,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749451302] [2019-12-18 15:32:03,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:03,781 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 38 [2019-12-18 15:32:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:04,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749451302] [2019-12-18 15:32:04,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942935441] [2019-12-18 15:32:04,552 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:04,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 15:32:04,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:32:04,641 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-18 15:32:04,642 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:32:04,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 15:32:04,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:04,677 INFO L614 ElimStorePlain]: treesize reduction 13, result has 78.7 percent of original size [2019-12-18 15:32:04,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:04,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:32:04,685 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:04,696 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:04,696 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:04,697 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:55, output treesize:34 [2019-12-18 15:32:05,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,083 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:32:05,114 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:05,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:32:05,116 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:05,180 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 15:32:05,181 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:05,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 15:32:05,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:05,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:05,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,411 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:32:05,413 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:32:05,424 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:05,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,459 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:32:05,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:32:05,471 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:05,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:32:05,484 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:05,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:05,510 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:05,511 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 15:32:05,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:05,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:05,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 15:32:05,928 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:05,994 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-18 15:32:05,994 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:05,994 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 15:32:06,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:06,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:06,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 15:32:06,105 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:06,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 15:32:06,133 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:06,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 15:32:06,144 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:06,204 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-18 15:32:06,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:06,205 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-18 15:32:06,431 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:06,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 15:32:06,432 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:06,440 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:06,440 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:32:06,441 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:7 [2019-12-18 15:32:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:06,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:32:06,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 36 [2019-12-18 15:32:06,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804764115] [2019-12-18 15:32:06,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 15:32:06,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:06,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 15:32:06,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 15:32:06,518 INFO L87 Difference]: Start difference. First operand 472 states and 1038 transitions. Second operand 38 states. [2019-12-18 15:32:07,623 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2019-12-18 15:32:07,993 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 67 [2019-12-18 15:32:08,380 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-12-18 15:32:08,760 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-12-18 15:32:09,181 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2019-12-18 15:32:09,836 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-12-18 15:32:10,031 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2019-12-18 15:32:10,440 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 75 [2019-12-18 15:32:10,669 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 75 [2019-12-18 15:32:11,190 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 79 [2019-12-18 15:32:11,445 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2019-12-18 15:32:11,641 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 62 [2019-12-18 15:32:11,846 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-12-18 15:32:12,304 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 82 [2019-12-18 15:32:12,536 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 65 [2019-12-18 15:32:13,129 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 79 [2019-12-18 15:32:13,371 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-12-18 15:32:13,884 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 82 [2019-12-18 15:32:14,326 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 79 [2019-12-18 15:32:14,584 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2019-12-18 15:32:14,876 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-12-18 15:32:15,153 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 82 [2019-12-18 15:32:15,485 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-12-18 15:32:15,767 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 69 [2019-12-18 15:32:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:16,438 INFO L93 Difference]: Finished difference Result 721 states and 1595 transitions. [2019-12-18 15:32:16,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 15:32:16,439 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 25 [2019-12-18 15:32:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:16,443 INFO L225 Difference]: With dead ends: 721 [2019-12-18 15:32:16,443 INFO L226 Difference]: Without dead ends: 721 [2019-12-18 15:32:16,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=779, Invalid=4771, Unknown=0, NotChecked=0, Total=5550 [2019-12-18 15:32:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2019-12-18 15:32:16,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 478. [2019-12-18 15:32:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-12-18 15:32:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 1051 transitions. [2019-12-18 15:32:16,452 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 1051 transitions. Word has length 25 [2019-12-18 15:32:16,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:16,452 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 1051 transitions. [2019-12-18 15:32:16,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 15:32:16,452 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 1051 transitions. [2019-12-18 15:32:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:32:16,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:16,454 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:16,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:16,657 INFO L410 AbstractCegarLoop]: === Iteration 25 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:16,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:16,657 INFO L82 PathProgramCache]: Analyzing trace with hash 927642954, now seen corresponding path program 4 times [2019-12-18 15:32:16,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:16,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107510230] [2019-12-18 15:32:16,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:17,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107510230] [2019-12-18 15:32:17,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989917910] [2019-12-18 15:32:17,427 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:17,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:32:17,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:32:17,493 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 84 conjunts are in the unsatisfiable core [2019-12-18 15:32:17,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:32:17,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 15:32:17,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:17,525 INFO L614 ElimStorePlain]: treesize reduction 13, result has 76.4 percent of original size [2019-12-18 15:32:17,537 INFO L343 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-12-18 15:32:17,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:32:17,538 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:17,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:17,546 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:17,546 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:28 [2019-12-18 15:32:17,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:17,853 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:17,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:32:17,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:17,903 INFO L614 ElimStorePlain]: treesize reduction 46, result has 48.3 percent of original size [2019-12-18 15:32:17,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:17,904 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:34 [2019-12-18 15:32:18,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:18,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:18,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:18,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:18,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 15:32:18,083 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:18,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:18,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:18,103 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 15:32:18,104 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:18,116 INFO L343 Elim1Store]: treesize reduction 35, result has 16.7 percent of original size [2019-12-18 15:32:18,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 15:32:18,117 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:18,124 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:18,124 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:18,125 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:28 [2019-12-18 15:32:18,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:18,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:18,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:18,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:18,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-12-18 15:32:18,365 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:18,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:18,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:18,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-12-18 15:32:18,381 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:18,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:18,386 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2019-12-18 15:32:18,386 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:18,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:18,395 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:18,395 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:186, output treesize:28 [2019-12-18 15:32:18,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:18,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:32:18,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2019-12-18 15:32:18,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266725249] [2019-12-18 15:32:18,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-18 15:32:18,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:18,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-18 15:32:18,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:32:18,576 INFO L87 Difference]: Start difference. First operand 478 states and 1051 transitions. Second operand 30 states. [2019-12-18 15:32:20,292 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2019-12-18 15:32:20,919 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2019-12-18 15:32:21,273 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 43 [2019-12-18 15:32:21,585 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2019-12-18 15:32:21,808 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 52 [2019-12-18 15:32:23,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:23,280 INFO L93 Difference]: Finished difference Result 520 states and 1132 transitions. [2019-12-18 15:32:23,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:32:23,281 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 25 [2019-12-18 15:32:23,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:23,284 INFO L225 Difference]: With dead ends: 520 [2019-12-18 15:32:23,284 INFO L226 Difference]: Without dead ends: 503 [2019-12-18 15:32:23,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=470, Invalid=2722, Unknown=0, NotChecked=0, Total=3192 [2019-12-18 15:32:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2019-12-18 15:32:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 450. [2019-12-18 15:32:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-12-18 15:32:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 990 transitions. [2019-12-18 15:32:23,293 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 990 transitions. Word has length 25 [2019-12-18 15:32:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:23,293 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 990 transitions. [2019-12-18 15:32:23,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-18 15:32:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 990 transitions. [2019-12-18 15:32:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:32:23,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:23,294 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:23,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:23,498 INFO L410 AbstractCegarLoop]: === Iteration 26 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:23,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:23,498 INFO L82 PathProgramCache]: Analyzing trace with hash -709771567, now seen corresponding path program 16 times [2019-12-18 15:32:23,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:23,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635958562] [2019-12-18 15:32:23,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:24,076 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 41 [2019-12-18 15:32:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:25,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635958562] [2019-12-18 15:32:25,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073401190] [2019-12-18 15:32:25,081 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:25,156 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:32:25,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:32:25,158 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 104 conjunts are in the unsatisfiable core [2019-12-18 15:32:25,160 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:32:25,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:32:25,170 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:32:25,196 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:32:25,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:25,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:32:25,201 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:25,212 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:25,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:25,213 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 15:32:25,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:25,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:25,702 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:32:25,729 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:25,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:32:25,730 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:25,781 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 15:32:25,781 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:25,782 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2019-12-18 15:32:25,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:25,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:25,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:25,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:25,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:25,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:25,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:32:25,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:25,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:25,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:25,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:25,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:26,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:32:26,002 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:26,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:26,007 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:26,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:26,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:32:26,010 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:26,028 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:26,029 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:26,029 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:269, output treesize:49 [2019-12-18 15:32:26,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:26,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:26,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:26,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:26,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 15:32:26,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:26,352 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-18 15:32:26,353 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:26,353 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:49 [2019-12-18 15:32:26,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:26,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:26,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 15:32:26,457 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:26,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 15:32:26,488 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:26,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 15:32:26,500 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:26,562 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-18 15:32:26,563 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:26,563 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:212, output treesize:46 [2019-12-18 15:32:26,724 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:26,725 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 15:32:26,725 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:26,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:26,732 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:32:26,733 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:7 [2019-12-18 15:32:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:26,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:32:26,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 36 [2019-12-18 15:32:26,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149726539] [2019-12-18 15:32:26,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 15:32:26,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:26,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 15:32:26,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 15:32:26,819 INFO L87 Difference]: Start difference. First operand 450 states and 990 transitions. Second operand 38 states. [2019-12-18 15:32:28,003 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2019-12-18 15:32:28,331 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 55 [2019-12-18 15:32:28,601 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 53 [2019-12-18 15:32:29,352 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 60 [2019-12-18 15:32:29,740 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-12-18 15:32:30,038 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-12-18 15:32:30,651 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 64 [2019-12-18 15:32:31,001 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 62 [2019-12-18 15:32:31,516 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 64 [2019-12-18 15:32:31,834 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 70 [2019-12-18 15:32:32,033 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2019-12-18 15:32:32,437 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 72 [2019-12-18 15:32:32,918 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 55 [2019-12-18 15:32:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:33,486 INFO L93 Difference]: Finished difference Result 563 states and 1237 transitions. [2019-12-18 15:32:33,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 15:32:33,487 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 25 [2019-12-18 15:32:33,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:33,490 INFO L225 Difference]: With dead ends: 563 [2019-12-18 15:32:33,490 INFO L226 Difference]: Without dead ends: 563 [2019-12-18 15:32:33,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=512, Invalid=3648, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 15:32:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2019-12-18 15:32:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 407. [2019-12-18 15:32:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-18 15:32:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 899 transitions. [2019-12-18 15:32:33,497 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 899 transitions. Word has length 25 [2019-12-18 15:32:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:33,497 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 899 transitions. [2019-12-18 15:32:33,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 15:32:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 899 transitions. [2019-12-18 15:32:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:32:33,498 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:33,498 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:33,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:33,699 INFO L410 AbstractCegarLoop]: === Iteration 27 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:33,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1324684501, now seen corresponding path program 17 times [2019-12-18 15:32:33,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:33,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12627465] [2019-12-18 15:32:33,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:34,130 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-12-18 15:32:34,420 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2019-12-18 15:32:34,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:34,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12627465] [2019-12-18 15:32:34,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116921049] [2019-12-18 15:32:34,956 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:35,023 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:32:35,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:32:35,025 WARN L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 98 conjunts are in the unsatisfiable core [2019-12-18 15:32:35,027 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:32:35,041 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:32:35,041 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:32:35,067 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:32:35,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:32:35,072 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:35,082 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:35,082 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:35,083 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:32:35,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,526 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:32:35,552 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:35,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:32:35,553 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:35,608 INFO L614 ElimStorePlain]: treesize reduction 46, result has 54.5 percent of original size [2019-12-18 15:32:35,609 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:35,609 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:55 [2019-12-18 15:32:35,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:35,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:35,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 64 [2019-12-18 15:32:35,801 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:35,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2019-12-18 15:32:35,830 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:35,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:35,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2019-12-18 15:32:35,838 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:35,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:35,858 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:35,859 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:269, output treesize:49 [2019-12-18 15:32:36,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:36,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:36,068 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:36,108 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:36,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 120 [2019-12-18 15:32:36,110 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:36,166 INFO L614 ElimStorePlain]: treesize reduction 72, result has 44.6 percent of original size [2019-12-18 15:32:36,167 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:36,167 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 15:32:36,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:36,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:36,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 50 [2019-12-18 15:32:36,266 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:36,294 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 15:32:36,295 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:36,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 48 [2019-12-18 15:32:36,306 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:36,367 INFO L614 ElimStorePlain]: treesize reduction 121, result has 27.5 percent of original size [2019-12-18 15:32:36,368 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:36,368 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:212, output treesize:46 [2019-12-18 15:32:36,524 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:36,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2019-12-18 15:32:36,525 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:36,531 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:36,532 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:32:36,532 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:7 [2019-12-18 15:32:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:36,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:32:36,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 35 [2019-12-18 15:32:36,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842988836] [2019-12-18 15:32:36,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-18 15:32:36,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:36,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-18 15:32:36,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1210, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 15:32:36,606 INFO L87 Difference]: Start difference. First operand 407 states and 899 transitions. Second operand 37 states. [2019-12-18 15:32:37,691 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 56 [2019-12-18 15:32:37,904 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-12-18 15:32:38,757 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2019-12-18 15:32:38,991 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-18 15:32:39,478 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2019-12-18 15:32:39,745 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-12-18 15:32:40,141 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-12-18 15:32:40,392 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-12-18 15:32:40,849 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-12-18 15:32:41,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:41,661 INFO L93 Difference]: Finished difference Result 501 states and 1106 transitions. [2019-12-18 15:32:41,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:32:41,661 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 25 [2019-12-18 15:32:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:41,664 INFO L225 Difference]: With dead ends: 501 [2019-12-18 15:32:41,665 INFO L226 Difference]: Without dead ends: 501 [2019-12-18 15:32:41,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1015 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=489, Invalid=3417, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 15:32:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-12-18 15:32:41,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 397. [2019-12-18 15:32:41,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-12-18 15:32:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 877 transitions. [2019-12-18 15:32:41,671 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 877 transitions. Word has length 25 [2019-12-18 15:32:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:41,671 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 877 transitions. [2019-12-18 15:32:41,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-18 15:32:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 877 transitions. [2019-12-18 15:32:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:32:41,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:41,672 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:41,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:41,874 INFO L410 AbstractCegarLoop]: === Iteration 28 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:41,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:41,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1550608564, now seen corresponding path program 5 times [2019-12-18 15:32:41,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:41,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521700184] [2019-12-18 15:32:41,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:42,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521700184] [2019-12-18 15:32:42,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103164954] [2019-12-18 15:32:42,911 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:43,041 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:32:43,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:32:43,046 WARN L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-18 15:32:43,048 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:32:43,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:32:43,072 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:32:43,104 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:32:43,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:43,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:32:43,108 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:43,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:43,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:43,120 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:32:43,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:43,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:43,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:32:43,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:43,476 INFO L614 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-12-18 15:32:43,477 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:43,477 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:46 [2019-12-18 15:32:43,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:43,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:43,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:43,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 15:32:43,613 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:43,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:43,631 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2019-12-18 15:32:43,631 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:43,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2019-12-18 15:32:43,636 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:43,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:43,648 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:43,649 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:210, output treesize:36 [2019-12-18 15:32:43,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:43,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:43,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:43,916 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:32:43,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:43,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2019-12-18 15:32:43,919 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:43,944 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:32:43,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:43,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-12-18 15:32:43,947 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:43,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 60 [2019-12-18 15:32:43,953 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:43,966 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:43,967 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:43,967 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:210, output treesize:36 [2019-12-18 15:32:44,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:44,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2019-12-18 15:32:44,079 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:44,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2019-12-18 15:32:44,090 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:44,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:44,093 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:32:44,093 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:3 [2019-12-18 15:32:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:44,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:32:44,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-12-18 15:32:44,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113268242] [2019-12-18 15:32:44,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-18 15:32:44,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:44,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-18 15:32:44,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:32:44,100 INFO L87 Difference]: Start difference. First operand 397 states and 877 transitions. Second operand 32 states. [2019-12-18 15:32:45,081 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 54 [2019-12-18 15:32:45,344 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 59 [2019-12-18 15:32:45,512 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2019-12-18 15:32:45,767 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-18 15:32:45,978 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-12-18 15:32:46,154 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2019-12-18 15:32:46,378 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2019-12-18 15:32:46,618 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2019-12-18 15:32:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:47,820 INFO L93 Difference]: Finished difference Result 433 states and 946 transitions. [2019-12-18 15:32:47,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 15:32:47,821 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 25 [2019-12-18 15:32:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:47,823 INFO L225 Difference]: With dead ends: 433 [2019-12-18 15:32:47,823 INFO L226 Difference]: Without dead ends: 416 [2019-12-18 15:32:47,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=380, Invalid=1972, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 15:32:47,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-18 15:32:47,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 345. [2019-12-18 15:32:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-18 15:32:47,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 768 transitions. [2019-12-18 15:32:47,832 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 768 transitions. Word has length 25 [2019-12-18 15:32:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:47,832 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 768 transitions. [2019-12-18 15:32:47,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-18 15:32:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 768 transitions. [2019-12-18 15:32:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:32:47,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:47,833 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:48,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:48,047 INFO L410 AbstractCegarLoop]: === Iteration 29 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:48,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2088272730, now seen corresponding path program 18 times [2019-12-18 15:32:48,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:48,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243607353] [2019-12-18 15:32:48,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:32:48,539 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-12-18 15:32:49,169 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-12-18 15:32:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:49,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243607353] [2019-12-18 15:32:49,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118986821] [2019-12-18 15:32:49,888 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:49,971 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 15:32:49,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:32:49,974 WARN L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 108 conjunts are in the unsatisfiable core [2019-12-18 15:32:49,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:32:49,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:49,987 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-18 15:32:49,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:32:49,988 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:49,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:49,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:49,998 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-18 15:32:50,216 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,216 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:32:50,241 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:50,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 76 [2019-12-18 15:32:50,243 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:50,298 INFO L614 ElimStorePlain]: treesize reduction 46, result has 48.9 percent of original size [2019-12-18 15:32:50,299 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:32:50,299 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:44 [2019-12-18 15:32:50,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-18 15:32:50,439 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:50,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 54 [2019-12-18 15:32:50,458 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:50,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2019-12-18 15:32:50,463 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:50,478 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:50,478 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:32:50,478 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:236, output treesize:38 [2019-12-18 15:32:50,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,673 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:50,673 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 111 [2019-12-18 15:32:50,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,700 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:32:50,837 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 39 [2019-12-18 15:32:50,838 INFO L614 ElimStorePlain]: treesize reduction 740, result has 9.2 percent of original size [2019-12-18 15:32:50,838 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:32:50,839 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:79, output treesize:57 [2019-12-18 15:32:50,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:50,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 49 [2019-12-18 15:32:50,955 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:50,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:32:50,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 57 [2019-12-18 15:32:50,974 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:50,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 48 [2019-12-18 15:32:50,980 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:51,036 INFO L614 ElimStorePlain]: treesize reduction 125, result has 27.7 percent of original size [2019-12-18 15:32:51,037 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:32:51,037 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:237, output treesize:48 [2019-12-18 15:32:51,312 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:51,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 123 [2019-12-18 15:32:51,314 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:51,378 INFO L614 ElimStorePlain]: treesize reduction 64, result has 51.5 percent of original size [2019-12-18 15:32:51,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:32:51,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:32:51,380 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:64, output treesize:23 [2019-12-18 15:32:51,466 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:51,467 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 35 [2019-12-18 15:32:51,467 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:32:51,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:32:51,472 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:32:51,472 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:9 [2019-12-18 15:32:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:32:51,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:32:51,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 34 [2019-12-18 15:32:51,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426614580] [2019-12-18 15:32:51,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-18 15:32:51,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:32:51,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-18 15:32:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:32:51,483 INFO L87 Difference]: Start difference. First operand 345 states and 768 transitions. Second operand 36 states. [2019-12-18 15:32:56,170 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 64 [2019-12-18 15:32:56,490 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-12-18 15:32:56,692 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2019-12-18 15:32:56,979 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-12-18 15:32:57,142 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-12-18 15:32:57,329 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2019-12-18 15:32:57,613 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-12-18 15:32:59,029 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-12-18 15:32:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:32:59,618 INFO L93 Difference]: Finished difference Result 591 states and 1296 transitions. [2019-12-18 15:32:59,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-18 15:32:59,619 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 30 [2019-12-18 15:32:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:32:59,622 INFO L225 Difference]: With dead ends: 591 [2019-12-18 15:32:59,622 INFO L226 Difference]: Without dead ends: 591 [2019-12-18 15:32:59,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 9 SyntacticMatches, 12 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2784 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=838, Invalid=7718, Unknown=0, NotChecked=0, Total=8556 [2019-12-18 15:32:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-12-18 15:32:59,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 491. [2019-12-18 15:32:59,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2019-12-18 15:32:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 1098 transitions. [2019-12-18 15:32:59,632 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 1098 transitions. Word has length 30 [2019-12-18 15:32:59,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:32:59,632 INFO L462 AbstractCegarLoop]: Abstraction has 491 states and 1098 transitions. [2019-12-18 15:32:59,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-18 15:32:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 1098 transitions. [2019-12-18 15:32:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:32:59,634 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:32:59,634 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:32:59,837 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:32:59,838 INFO L410 AbstractCegarLoop]: === Iteration 30 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:32:59,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:32:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1686493757, now seen corresponding path program 6 times [2019-12-18 15:32:59,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:32:59,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791018124] [2019-12-18 15:32:59,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:32:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:01,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:01,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791018124] [2019-12-18 15:33:01,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569737051] [2019-12-18 15:33:01,037 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:01,140 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 15:33:01,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:01,143 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 116 conjunts are in the unsatisfiable core [2019-12-18 15:33:01,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:01,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:33:01,152 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:33:01,179 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:33:01,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:01,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:33:01,185 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:01,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:01,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:01,198 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:33:01,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:01,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:01,631 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:01,657 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:01,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:33:01,658 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:01,720 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-18 15:33:01,721 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:01,721 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 15:33:01,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:01,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:01,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:01,855 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:01,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:01,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 15:33:01,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:01,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:01,875 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:01,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:01,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 15:33:01,879 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:01,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:01,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 15:33:01,884 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:01,901 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:01,902 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:01,902 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-18 15:33:02,106 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:02,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-18 15:33:02,107 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:02,122 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:02,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:02,123 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-18 15:33:02,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:02,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:02,465 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:02,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:02,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:02,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 114 [2019-12-18 15:33:02,508 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:02,543 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:02,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:02,581 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:02,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 113 [2019-12-18 15:33:02,582 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:02,613 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:02,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 87 treesize of output 124 [2019-12-18 15:33:02,615 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:02,648 INFO L614 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-12-18 15:33:02,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:02,649 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:258, output treesize:45 [2019-12-18 15:33:02,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:02,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:02,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 37 [2019-12-18 15:33:02,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905859056] [2019-12-18 15:33:02,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 15:33:02,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:02,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 15:33:02,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 15:33:02,784 INFO L87 Difference]: Start difference. First operand 491 states and 1098 transitions. Second operand 38 states. [2019-12-18 15:33:04,591 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-12-18 15:33:07,095 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 15:33:07,649 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-18 15:33:08,180 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-12-18 15:33:08,332 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 57 [2019-12-18 15:33:08,745 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-18 15:33:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:09,307 INFO L93 Difference]: Finished difference Result 546 states and 1204 transitions. [2019-12-18 15:33:09,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-18 15:33:09,307 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 30 [2019-12-18 15:33:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:09,311 INFO L225 Difference]: With dead ends: 546 [2019-12-18 15:33:09,311 INFO L226 Difference]: Without dead ends: 534 [2019-12-18 15:33:09,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=745, Invalid=5417, Unknown=0, NotChecked=0, Total=6162 [2019-12-18 15:33:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-12-18 15:33:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 497. [2019-12-18 15:33:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2019-12-18 15:33:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1110 transitions. [2019-12-18 15:33:09,321 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1110 transitions. Word has length 30 [2019-12-18 15:33:09,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:09,321 INFO L462 AbstractCegarLoop]: Abstraction has 497 states and 1110 transitions. [2019-12-18 15:33:09,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 15:33:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1110 transitions. [2019-12-18 15:33:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:33:09,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:09,323 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:09,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:09,526 INFO L410 AbstractCegarLoop]: === Iteration 31 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:09,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:09,527 INFO L82 PathProgramCache]: Analyzing trace with hash 6218509, now seen corresponding path program 7 times [2019-12-18 15:33:09,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:09,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24968355] [2019-12-18 15:33:09,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:10,737 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 42 [2019-12-18 15:33:10,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:10,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24968355] [2019-12-18 15:33:10,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934839359] [2019-12-18 15:33:10,893 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:10,976 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 128 conjunts are in the unsatisfiable core [2019-12-18 15:33:10,977 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:10,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:10,998 INFO L343 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2019-12-18 15:33:10,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:33:10,999 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,006 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:11,007 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:11,007 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2019-12-18 15:33:11,148 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:11,173 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:11,173 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 76 [2019-12-18 15:33:11,174 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,224 INFO L614 ElimStorePlain]: treesize reduction 46, result has 50.5 percent of original size [2019-12-18 15:33:11,225 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,225 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:38 [2019-12-18 15:33:11,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:11,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:11,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:11,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:11,319 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:11,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:11,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 42 [2019-12-18 15:33:11,325 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,331 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:11,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:11,332 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:11,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:11,337 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2019-12-18 15:33:11,337 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,340 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:11,341 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:11,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2019-12-18 15:33:11,343 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:11,357 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,358 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:212, output treesize:32 [2019-12-18 15:33:11,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:11,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:11,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:11,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:11,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:11,661 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 45 [2019-12-18 15:33:11,662 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:11,668 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:11,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:11,674 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 36 [2019-12-18 15:33:11,674 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:11,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 37 [2019-12-18 15:33:11,680 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:11,697 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,697 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:225, output treesize:41 [2019-12-18 15:33:11,772 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:11,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 67 [2019-12-18 15:33:11,773 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,795 INFO L614 ElimStorePlain]: treesize reduction 16, result has 63.6 percent of original size [2019-12-18 15:33:11,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:28 [2019-12-18 15:33:11,898 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:11,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 44 [2019-12-18 15:33:11,899 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:11,902 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:33:11,902 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:7 [2019-12-18 15:33:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:11,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:11,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 35 [2019-12-18 15:33:11,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106584472] [2019-12-18 15:33:11,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-18 15:33:11,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:11,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-18 15:33:11,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:33:11,971 INFO L87 Difference]: Start difference. First operand 497 states and 1110 transitions. Second operand 36 states. [2019-12-18 15:33:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:16,173 INFO L93 Difference]: Finished difference Result 540 states and 1189 transitions. [2019-12-18 15:33:16,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 15:33:16,173 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 30 [2019-12-18 15:33:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:16,176 INFO L225 Difference]: With dead ends: 540 [2019-12-18 15:33:16,177 INFO L226 Difference]: Without dead ends: 530 [2019-12-18 15:33:16,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=450, Invalid=3456, Unknown=0, NotChecked=0, Total=3906 [2019-12-18 15:33:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-12-18 15:33:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 503. [2019-12-18 15:33:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2019-12-18 15:33:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 1122 transitions. [2019-12-18 15:33:16,183 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 1122 transitions. Word has length 30 [2019-12-18 15:33:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:16,183 INFO L462 AbstractCegarLoop]: Abstraction has 503 states and 1122 transitions. [2019-12-18 15:33:16,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-18 15:33:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 1122 transitions. [2019-12-18 15:33:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:33:16,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:16,184 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:16,387 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:16,388 INFO L410 AbstractCegarLoop]: === Iteration 32 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:16,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:16,389 INFO L82 PathProgramCache]: Analyzing trace with hash -383631969, now seen corresponding path program 8 times [2019-12-18 15:33:16,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:16,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102417236] [2019-12-18 15:33:16,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:16,903 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 36 [2019-12-18 15:33:17,130 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 36 [2019-12-18 15:33:17,713 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-12-18 15:33:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:17,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102417236] [2019-12-18 15:33:17,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536078725] [2019-12-18 15:33:17,923 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:18,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:33:18,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:18,008 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-18 15:33:18,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:18,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 15:33:18,020 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:18,041 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 15:33:18,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:18,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:33:18,046 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:18,055 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:18,056 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:18,056 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:33:18,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:18,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:18,376 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:18,401 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:18,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:33:18,402 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:18,454 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 15:33:18,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:18,455 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:43 [2019-12-18 15:33:18,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:18,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:18,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:18,616 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:18,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:18,620 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 15:33:18,621 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:18,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:18,653 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:18,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:18,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 15:33:18,657 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:18,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:18,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 15:33:18,662 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:18,676 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:18,676 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:18,677 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:233, output treesize:37 [2019-12-18 15:33:19,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:19,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:19,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:19,047 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:19,051 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:19,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-12-18 15:33:19,055 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:19,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:19,066 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:19,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:19,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-18 15:33:19,072 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:19,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:19,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2019-12-18 15:33:19,078 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:19,096 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:19,096 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:19,096 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:240, output treesize:40 [2019-12-18 15:33:19,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2019-12-18 15:33:19,181 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:19,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:19,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:19,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:29 [2019-12-18 15:33:19,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:19,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:19,345 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:19,347 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:19,348 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-12-18 15:33:19,348 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:19,351 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:19,352 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2019-12-18 15:33:19,352 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:19,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:19,357 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:33:19,358 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:7 [2019-12-18 15:33:19,405 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:19,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:19,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 39 [2019-12-18 15:33:19,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542959891] [2019-12-18 15:33:19,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-18 15:33:19,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:19,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-18 15:33:19,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:33:19,407 INFO L87 Difference]: Start difference. First operand 503 states and 1122 transitions. Second operand 40 states. [2019-12-18 15:33:20,105 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-12-18 15:33:20,474 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2019-12-18 15:33:20,762 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2019-12-18 15:33:21,005 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-18 15:33:22,091 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-12-18 15:33:22,587 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-18 15:33:22,752 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-18 15:33:23,080 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-12-18 15:33:23,248 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-18 15:33:23,436 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-18 15:33:23,872 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-18 15:33:24,086 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2019-12-18 15:33:24,274 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 55 [2019-12-18 15:33:24,531 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2019-12-18 15:33:24,768 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 58 [2019-12-18 15:33:25,094 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-12-18 15:33:25,266 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 57 [2019-12-18 15:33:25,544 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2019-12-18 15:33:25,739 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-18 15:33:25,932 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-18 15:33:26,702 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-18 15:33:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:28,472 INFO L93 Difference]: Finished difference Result 632 states and 1377 transitions. [2019-12-18 15:33:28,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-18 15:33:28,472 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 30 [2019-12-18 15:33:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:28,476 INFO L225 Difference]: With dead ends: 632 [2019-12-18 15:33:28,476 INFO L226 Difference]: Without dead ends: 622 [2019-12-18 15:33:28,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=812, Invalid=6498, Unknown=0, NotChecked=0, Total=7310 [2019-12-18 15:33:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-18 15:33:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 501. [2019-12-18 15:33:28,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-12-18 15:33:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 1118 transitions. [2019-12-18 15:33:28,483 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 1118 transitions. Word has length 30 [2019-12-18 15:33:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:28,483 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 1118 transitions. [2019-12-18 15:33:28,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-18 15:33:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 1118 transitions. [2019-12-18 15:33:28,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:33:28,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:28,484 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:28,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:28,688 INFO L410 AbstractCegarLoop]: === Iteration 33 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1470594389, now seen corresponding path program 9 times [2019-12-18 15:33:28,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:28,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529664223] [2019-12-18 15:33:28,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:29,235 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 36 [2019-12-18 15:33:29,458 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 36 [2019-12-18 15:33:30,061 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-12-18 15:33:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:30,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529664223] [2019-12-18 15:33:30,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668700193] [2019-12-18 15:33:30,275 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:30,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:33:30,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:30,353 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-18 15:33:30,354 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:30,362 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:33:30,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:33:30,387 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:33:30,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:30,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:33:30,392 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:30,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:30,402 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:30,403 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:33:30,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:30,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:30,726 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:30,752 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:30,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:33:30,753 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:30,804 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 15:33:30,805 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:30,805 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:65, output treesize:43 [2019-12-18 15:33:30,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:30,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:30,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:30,941 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:30,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:30,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 15:33:30,945 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:30,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:30,966 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:30,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:30,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 15:33:30,969 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:30,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:30,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 15:33:30,974 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:30,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:30,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:30,989 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:233, output treesize:37 [2019-12-18 15:33:31,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:31,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:31,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:31,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:31,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:31,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2019-12-18 15:33:31,358 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:31,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:31,370 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:31,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:31,376 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 55 [2019-12-18 15:33:31,377 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:31,382 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:31,383 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2019-12-18 15:33:31,383 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:31,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:31,401 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:31,402 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:240, output treesize:40 [2019-12-18 15:33:31,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2019-12-18 15:33:31,506 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:31,516 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:31,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:31,517 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:29 [2019-12-18 15:33:31,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:31,676 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:31,679 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:31,681 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:31,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2019-12-18 15:33:31,682 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:31,685 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:31,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2019-12-18 15:33:31,686 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:31,693 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:31,693 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:33:31,693 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:7 [2019-12-18 15:33:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:31,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:31,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 39 [2019-12-18 15:33:31,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643031252] [2019-12-18 15:33:31,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-18 15:33:31,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:31,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-18 15:33:31,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:33:31,740 INFO L87 Difference]: Start difference. First operand 501 states and 1118 transitions. Second operand 40 states. [2019-12-18 15:33:32,445 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-12-18 15:33:32,857 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2019-12-18 15:33:33,136 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2019-12-18 15:33:33,379 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-18 15:33:34,770 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 57 [2019-12-18 15:33:34,972 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2019-12-18 15:33:35,134 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-12-18 15:33:35,478 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-12-18 15:33:35,640 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 59 [2019-12-18 15:33:35,825 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-12-18 15:33:36,036 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-12-18 15:33:36,281 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-12-18 15:33:36,562 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 59 [2019-12-18 15:33:37,078 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-12-18 15:33:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:39,173 INFO L93 Difference]: Finished difference Result 595 states and 1306 transitions. [2019-12-18 15:33:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 15:33:39,174 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 30 [2019-12-18 15:33:39,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:39,178 INFO L225 Difference]: With dead ends: 595 [2019-12-18 15:33:39,178 INFO L226 Difference]: Without dead ends: 585 [2019-12-18 15:33:39,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=558, Invalid=4698, Unknown=0, NotChecked=0, Total=5256 [2019-12-18 15:33:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-12-18 15:33:39,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 500. [2019-12-18 15:33:39,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-18 15:33:39,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1116 transitions. [2019-12-18 15:33:39,186 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1116 transitions. Word has length 30 [2019-12-18 15:33:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:39,186 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1116 transitions. [2019-12-18 15:33:39,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-18 15:33:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1116 transitions. [2019-12-18 15:33:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:33:39,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:39,187 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:39,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:39,391 INFO L410 AbstractCegarLoop]: === Iteration 34 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:39,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:39,392 INFO L82 PathProgramCache]: Analyzing trace with hash -48444409, now seen corresponding path program 10 times [2019-12-18 15:33:39,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:39,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922988993] [2019-12-18 15:33:39,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:39,814 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 33 [2019-12-18 15:33:40,007 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2019-12-18 15:33:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:41,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922988993] [2019-12-18 15:33:41,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732068404] [2019-12-18 15:33:41,075 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:41,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:33:41,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:41,145 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 120 conjunts are in the unsatisfiable core [2019-12-18 15:33:41,147 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:41,153 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:33:41,153 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:33:41,177 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:33:41,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:41,182 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:33:41,182 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:41,191 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:41,191 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:41,191 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:33:41,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:41,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:41,573 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:41,599 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:41,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:33:41,600 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:41,662 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-18 15:33:41,663 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:41,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 15:33:41,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:41,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:41,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:41,810 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:41,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:41,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 15:33:41,814 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:41,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:41,832 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:41,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:41,835 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 15:33:41,835 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:41,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:41,840 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 15:33:41,840 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:41,860 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:41,860 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:41,860 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-18 15:33:42,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:42,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:42,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:42,152 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:42,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:42,159 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-12-18 15:33:42,160 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:42,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:42,174 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:42,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:42,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2019-12-18 15:33:42,180 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:42,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:42,186 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-12-18 15:33:42,187 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:42,206 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:42,206 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:42,206 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:231, output treesize:43 [2019-12-18 15:33:42,372 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:42,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-18 15:33:42,373 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:42,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:42,386 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:42,387 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-18 15:33:42,529 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:42,529 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-18 15:33:42,530 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:42,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:42,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:33:42,536 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-18 15:33:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:42,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:42,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 39 [2019-12-18 15:33:42,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091939679] [2019-12-18 15:33:42,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-18 15:33:42,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:42,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-18 15:33:42,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1504, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:33:42,626 INFO L87 Difference]: Start difference. First operand 500 states and 1116 transitions. Second operand 41 states. [2019-12-18 15:33:43,284 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2019-12-18 15:33:43,638 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 53 [2019-12-18 15:33:43,878 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-12-18 15:33:44,107 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-12-18 15:33:45,418 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-12-18 15:33:46,130 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2019-12-18 15:33:46,849 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-12-18 15:33:49,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:49,691 INFO L93 Difference]: Finished difference Result 665 states and 1474 transitions. [2019-12-18 15:33:49,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 15:33:49,691 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 30 [2019-12-18 15:33:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:49,695 INFO L225 Difference]: With dead ends: 665 [2019-12-18 15:33:49,695 INFO L226 Difference]: Without dead ends: 665 [2019-12-18 15:33:49,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=655, Invalid=5507, Unknown=0, NotChecked=0, Total=6162 [2019-12-18 15:33:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-12-18 15:33:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 577. [2019-12-18 15:33:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-12-18 15:33:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 1288 transitions. [2019-12-18 15:33:49,703 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 1288 transitions. Word has length 30 [2019-12-18 15:33:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:49,704 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 1288 transitions. [2019-12-18 15:33:49,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-18 15:33:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 1288 transitions. [2019-12-18 15:33:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:33:49,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:49,705 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:49,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:49,908 INFO L410 AbstractCegarLoop]: === Iteration 35 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:49,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:49,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1731509287, now seen corresponding path program 11 times [2019-12-18 15:33:49,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:49,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378123795] [2019-12-18 15:33:49,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:50,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378123795] [2019-12-18 15:33:50,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895918398] [2019-12-18 15:33:50,926 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:51,005 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:33:51,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:51,007 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 108 conjunts are in the unsatisfiable core [2019-12-18 15:33:51,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:51,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-12-18 15:33:51,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-18 15:33:51,046 INFO L614 ElimStorePlain]: treesize reduction 14, result has 76.3 percent of original size [2019-12-18 15:33:51,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:33:51,051 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:51,062 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:51,063 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:51,063 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:31 [2019-12-18 15:33:51,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,351 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:51,384 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:51,384 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:33:51,385 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:51,448 INFO L614 ElimStorePlain]: treesize reduction 46, result has 55.8 percent of original size [2019-12-18 15:33:51,448 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:51,449 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:71, output treesize:49 [2019-12-18 15:33:51,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:51,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:51,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,601 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:51,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 15:33:51,604 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:51,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,619 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:51,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 15:33:51,622 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:51,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 15:33:51,628 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:51,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:51,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:51,645 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:251, output treesize:43 [2019-12-18 15:33:51,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:51,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:51,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,887 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:51,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-12-18 15:33:51,895 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:51,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,907 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:51,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2019-12-18 15:33:51,914 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:51,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:51,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-12-18 15:33:51,920 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:51,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:51,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:51,938 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:231, output treesize:43 [2019-12-18 15:33:52,147 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:52,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 77 [2019-12-18 15:33:52,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:52,180 INFO L614 ElimStorePlain]: treesize reduction 16, result has 70.9 percent of original size [2019-12-18 15:33:52,181 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:52,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:39 [2019-12-18 15:33:52,305 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:52,306 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 47 [2019-12-18 15:33:52,306 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:52,311 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:52,311 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:33:52,311 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-12-18 15:33:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:52,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:33:52,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 37 [2019-12-18 15:33:52,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773011866] [2019-12-18 15:33:52,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 15:33:52,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:33:52,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 15:33:52,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1257, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 15:33:52,383 INFO L87 Difference]: Start difference. First operand 577 states and 1288 transitions. Second operand 38 states. [2019-12-18 15:33:53,532 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2019-12-18 15:33:53,788 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-12-18 15:33:54,243 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-18 15:33:54,657 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2019-12-18 15:33:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:33:57,175 INFO L93 Difference]: Finished difference Result 632 states and 1394 transitions. [2019-12-18 15:33:57,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 15:33:57,175 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 30 [2019-12-18 15:33:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:33:57,179 INFO L225 Difference]: With dead ends: 632 [2019-12-18 15:33:57,179 INFO L226 Difference]: Without dead ends: 622 [2019-12-18 15:33:57,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=584, Invalid=3838, Unknown=0, NotChecked=0, Total=4422 [2019-12-18 15:33:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-12-18 15:33:57,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 589. [2019-12-18 15:33:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-12-18 15:33:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 1312 transitions. [2019-12-18 15:33:57,186 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 1312 transitions. Word has length 30 [2019-12-18 15:33:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:33:57,186 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 1312 transitions. [2019-12-18 15:33:57,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 15:33:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 1312 transitions. [2019-12-18 15:33:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:33:57,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:33:57,187 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:33:57,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:57,388 INFO L410 AbstractCegarLoop]: === Iteration 36 === [reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr2ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_fnErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-18 15:33:57,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:33:57,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1694747289, now seen corresponding path program 12 times [2019-12-18 15:33:57,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:33:57,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213227567] [2019-12-18 15:33:57,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:33:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:33:58,468 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2019-12-18 15:33:58,643 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 34 [2019-12-18 15:33:58,845 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 34 [2019-12-18 15:33:59,045 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 32 [2019-12-18 15:33:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:33:59,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213227567] [2019-12-18 15:33:59,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209535042] [2019-12-18 15:33:59,369 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:33:59,450 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-12-18 15:33:59,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:33:59,452 WARN L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 107 conjunts are in the unsatisfiable core [2019-12-18 15:33:59,454 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:33:59,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-12-18 15:33:59,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:59,479 INFO L614 ElimStorePlain]: treesize reduction 13, result has 77.6 percent of original size [2019-12-18 15:33:59,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:59,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2019-12-18 15:33:59,484 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:59,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:59,495 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:59,495 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:31 [2019-12-18 15:33:59,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:59,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:33:59,803 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:33:59,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:33:59,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 86 [2019-12-18 15:33:59,829 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:33:59,882 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.1 percent of original size [2019-12-18 15:33:59,882 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:33:59,883 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:65, output treesize:43 [2019-12-18 15:33:59,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:59,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:33:59,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:34:00,003 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:34:00,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:34:00,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 52 [2019-12-18 15:34:00,008 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:34:00,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:34:00,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:34:00,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:34:00,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2019-12-18 15:34:00,027 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:34:00,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:34:00,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-12-18 15:34:00,031 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:34:00,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:34:00,046 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:34:00,046 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:233, output treesize:37 [2019-12-18 15:34:00,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:34:00,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:34:00,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:34:00,322 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:34:00,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:34:00,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-12-18 15:34:00,334 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:34:00,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:34:00,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:34:00,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:34:00,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2019-12-18 15:34:00,349 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:34:00,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-18 15:34:00,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2019-12-18 15:34:00,354 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-18 15:34:00,380 INFO L614 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-12-18 15:34:00,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:34:00,381 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:213, output treesize:33 [2019-12-18 15:34:00,577 INFO L343 Elim1Store]: treesize reduction 20, result has 76.7 percent of original size [2019-12-18 15:34:00,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 89 [2019-12-18 15:34:00,578 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:34:00,602 INFO L614 ElimStorePlain]: treesize reduction 8, result has 80.0 percent of original size [2019-12-18 15:34:00,603 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-18 15:34:00,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-12-18 15:34:00,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-18 15:34:00,725 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:34:00,730 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:34:00,732 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:34:00,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:34:00,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 21 [2019-12-18 15:34:00,739 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-18 15:34:00,749 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-18 15:34:00,753 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:34:00,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 22 [2019-12-18 15:34:00,754 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-18 15:34:00,759 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-18 15:34:00,760 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-18 15:34:00,760 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:7 [2019-12-18 15:34:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:34:00,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:34:00,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 39 [2019-12-18 15:34:00,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989532320] [2019-12-18 15:34:00,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-18 15:34:00,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:34:00,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-18 15:34:00,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:34:00,811 INFO L87 Difference]: Start difference. First operand 589 states and 1312 transitions. Second operand 40 states. [2019-12-18 15:34:01,533 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-12-18 15:34:01,906 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 52 [2019-12-18 15:34:02,170 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 59 Received shutdown request... [2019-12-18 15:34:02,309 WARN L209 SmtUtils]: Removed 27 from assertion stack [2019-12-18 15:34:02,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:34:02,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:34:02,510 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-18 15:34:02,514 WARN L227 ceAbstractionStarter]: Timeout [2019-12-18 15:34:02,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:34:02 BasicIcfg [2019-12-18 15:34:02,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:34:02,515 INFO L168 Benchmark]: Toolchain (without parser) took 243244.50 ms. Allocated memory was 135.8 MB in the beginning and 302.5 MB in the end (delta: 166.7 MB). Free memory was 99.2 MB in the beginning and 82.4 MB in the end (delta: 16.8 MB). Peak memory consumption was 183.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,516 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.49 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 99.0 MB in the beginning and 146.9 MB in the end (delta: -47.8 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.54 ms. Allocated memory is still 200.3 MB. Free memory was 146.9 MB in the beginning and 144.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,516 INFO L168 Benchmark]: Boogie Preprocessor took 33.90 ms. Allocated memory is still 200.3 MB. Free memory was 144.7 MB in the beginning and 142.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,516 INFO L168 Benchmark]: RCFGBuilder took 614.75 ms. Allocated memory is still 200.3 MB. Free memory was 142.5 MB in the beginning and 112.3 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,516 INFO L168 Benchmark]: TraceAbstraction took 241739.47 ms. Allocated memory was 200.3 MB in the beginning and 302.5 MB in the end (delta: 102.2 MB). Free memory was 112.3 MB in the beginning and 82.4 MB in the end (delta: 29.9 MB). Peak memory consumption was 132.1 MB. Max. memory is 7.1 GB. [2019-12-18 15:34:02,517 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.56 ms. Allocated memory is still 135.8 MB. Free memory was 119.0 MB in the beginning and 118.8 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.49 ms. Allocated memory was 135.8 MB in the beginning and 200.3 MB in the end (delta: 64.5 MB). Free memory was 99.0 MB in the beginning and 146.9 MB in the end (delta: -47.8 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.54 ms. Allocated memory is still 200.3 MB. Free memory was 146.9 MB in the beginning and 144.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.90 ms. Allocated memory is still 200.3 MB. Free memory was 144.7 MB in the beginning and 142.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 614.75 ms. Allocated memory is still 200.3 MB. Free memory was 142.5 MB in the beginning and 112.3 MB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 241739.47 ms. Allocated memory was 200.3 MB in the beginning and 302.5 MB in the end (delta: 102.2 MB). Free memory was 112.3 MB in the beginning and 82.4 MB in the end (delta: 29.9 MB). Peak memory consumption was 132.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 122 ProgramPointsBefore, 30 ProgramPointsAfterwards, 128 TransitionsBefore, 34 TransitionsAfterwards, 4968 CoEnabledTransitionPairs, 6 FixpointIterations, 18 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 3 ChoiceCompositions, 2682 VarBasedMoverChecksPositive, 65 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 68 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 5902 CheckedPairsTotal, 114 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 821]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (589states) and FLOYD_HOARE automaton (currently 10 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 97 for 22ms.. - TimeoutResultAtElement [Line: 825]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 825). Cancelled while BasicCegarLoop was constructing difference of abstraction (589states) and FLOYD_HOARE automaton (currently 10 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 97 for 22ms.. - TimeoutResultAtElement [Line: 826]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 826). Cancelled while BasicCegarLoop was constructing difference of abstraction (589states) and FLOYD_HOARE automaton (currently 10 states, 40 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 97 for 22ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 3 error locations. Result: TIMEOUT, OverallTime: 241.5s, OverallIterations: 36, TraceHistogramMax: 3, AutomataDifference: 160.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1041 SDtfs, 5840 SDslu, 7520 SDs, 0 SdLazy, 54800 SolverSat, 2126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 56.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2126 GetRequests, 251 SyntacticMatches, 80 SemanticMatches, 1794 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29531 ImplicationChecksByTransitivity, 150.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 2970 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 68.0s InterpolantComputationTime, 1455 NumberOfCodeBlocks, 1455 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 1394 ConstructedInterpolants, 487 QuantifiedInterpolants, 1195882 SizeOfPredicates, 1031 NumberOfNonLiveVariables, 4185 ConjunctsInSsa, 2354 ConjunctsInUnsatCore, 61 InterpolantComputations, 11 PerfectInterpolantSequences, 51/402 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown