./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/simple-ext_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf7f5d5a0c627430d9132d0f1be3b1c0ad58f22e7924c03137596c145de85b8c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:51:59,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:51:59,958 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:51:59,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:51:59,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:51:59,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:51:59,994 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:51:59,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:51:59,999 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:52:00,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:52:00,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:52:00,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:52:00,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:52:00,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:52:00,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:52:00,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:52:00,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:52:00,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:52:00,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:52:00,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:52:00,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:52:00,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:52:00,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:52:00,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:52:00,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:52:00,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:52:00,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:52:00,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:52:00,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:52:00,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:52:00,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:52:00,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:52:00,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:52:00,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:52:00,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:52:00,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:52:00,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:52:00,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:52:00,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:52:00,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:52:00,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:52:00,041 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 20:52:00,063 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:52:00,069 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:52:00,069 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:52:00,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:52:00,070 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:52:00,071 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:52:00,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:52:00,071 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:52:00,072 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:52:00,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:52:00,073 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:52:00,073 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:52:00,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:52:00,073 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:52:00,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:52:00,074 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:52:00,074 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:52:00,074 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:52:00,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:52:00,074 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:52:00,075 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:52:00,075 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:52:00,075 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:52:00,075 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:52:00,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:52:00,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:52:00,076 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:52:00,076 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:52:00,076 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 20:52:00,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 20:52:00,077 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:52:00,077 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf7f5d5a0c627430d9132d0f1be3b1c0ad58f22e7924c03137596c145de85b8c [2021-12-18 20:52:00,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:52:00,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:52:00,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:52:00,341 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:52:00,341 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:52:00,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext_1.i [2021-12-18 20:52:00,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca819cdc/d6671b3fbeaa4e2bb24d4c4af8bb34a8/FLAG66db7cca6 [2021-12-18 20:52:00,829 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:52:00,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext_1.i [2021-12-18 20:52:00,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca819cdc/d6671b3fbeaa4e2bb24d4c4af8bb34a8/FLAG66db7cca6 [2021-12-18 20:52:00,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fca819cdc/d6671b3fbeaa4e2bb24d4c4af8bb34a8 [2021-12-18 20:52:00,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:52:00,874 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:52:00,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:52:00,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:52:00,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:52:00,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:52:00" (1/1) ... [2021-12-18 20:52:00,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c4a4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:00, skipping insertion in model container [2021-12-18 20:52:00,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:52:00" (1/1) ... [2021-12-18 20:52:00,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:52:00,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:52:01,148 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext_1.i[23274,23287] [2021-12-18 20:52:01,152 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:52:01,158 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 20:52:01,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext_1.i[23274,23287] [2021-12-18 20:52:01,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:52:01,212 INFO L208 MainTranslator]: Completed translation [2021-12-18 20:52:01,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01 WrapperNode [2021-12-18 20:52:01,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:52:01,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 20:52:01,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 20:52:01,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 20:52:01,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (1/1) ... [2021-12-18 20:52:01,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (1/1) ... [2021-12-18 20:52:01,261 INFO L137 Inliner]: procedures = 124, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 78 [2021-12-18 20:52:01,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 20:52:01,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 20:52:01,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 20:52:01,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 20:52:01,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (1/1) ... [2021-12-18 20:52:01,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (1/1) ... [2021-12-18 20:52:01,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (1/1) ... [2021-12-18 20:52:01,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (1/1) ... [2021-12-18 20:52:01,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (1/1) ... [2021-12-18 20:52:01,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (1/1) ... [2021-12-18 20:52:01,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (1/1) ... [2021-12-18 20:52:01,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 20:52:01,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 20:52:01,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 20:52:01,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 20:52:01,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (1/1) ... [2021-12-18 20:52:01,324 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:52:01,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:01,345 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 20:52:01,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 20:52:01,390 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-18 20:52:01,390 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-18 20:52:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 20:52:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 20:52:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 20:52:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 20:52:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 20:52:01,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 20:52:01,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 20:52:01,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 20:52:01,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 20:52:01,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 20:52:01,470 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 20:52:01,471 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 20:52:01,494 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-18 20:52:01,633 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 20:52:01,638 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 20:52:01,638 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-18 20:52:01,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:52:01 BoogieIcfgContainer [2021-12-18 20:52:01,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 20:52:01,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 20:52:01,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 20:52:01,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 20:52:01,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:52:00" (1/3) ... [2021-12-18 20:52:01,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28217180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:52:01, skipping insertion in model container [2021-12-18 20:52:01,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:52:01" (2/3) ... [2021-12-18 20:52:01,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28217180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:52:01, skipping insertion in model container [2021-12-18 20:52:01,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:52:01" (3/3) ... [2021-12-18 20:52:01,647 INFO L111 eAbstractionObserver]: Analyzing ICFG simple-ext_1.i [2021-12-18 20:52:01,651 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 20:52:01,651 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-18 20:52:01,700 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 20:52:01,705 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 20:52:01,705 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-18 20:52:01,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.911764705882353) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:01,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 20:52:01,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:01,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 20:52:01,726 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:01,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517416, now seen corresponding path program 1 times [2021-12-18 20:52:01,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:01,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441122057] [2021-12-18 20:52:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:01,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:01,881 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:01,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441122057] [2021-12-18 20:52:01,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441122057] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:52:01,883 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:52:01,883 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:52:01,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156674176] [2021-12-18 20:52:01,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:52:01,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-18 20:52:01,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-18 20:52:01,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-18 20:52:01,917 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.911764705882353) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:01,929 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2021-12-18 20:52:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 20:52:01,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 20:52:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:01,934 INFO L225 Difference]: With dead ends: 58 [2021-12-18 20:52:01,935 INFO L226 Difference]: Without dead ends: 52 [2021-12-18 20:52:01,936 INFO L932 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 [2021-12-18 20:52:01,940 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:01,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:52:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-18 20:52:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-18 20:52:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2021-12-18 20:52:01,971 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 6 [2021-12-18 20:52:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:01,972 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2021-12-18 20:52:01,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2021-12-18 20:52:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 20:52:01,974 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:01,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:01,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 20:52:01,975 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:01,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 620871745, now seen corresponding path program 1 times [2021-12-18 20:52:01,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:01,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938528671] [2021-12-18 20:52:01,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:01,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:02,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:02,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938528671] [2021-12-18 20:52:02,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938528671] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:52:02,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:52:02,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:52:02,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356539751] [2021-12-18 20:52:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:52:02,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:52:02,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:02,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:52:02,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:52:02,066 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:02,213 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2021-12-18 20:52:02,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:52:02,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-18 20:52:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:02,215 INFO L225 Difference]: With dead ends: 70 [2021-12-18 20:52:02,215 INFO L226 Difference]: Without dead ends: 70 [2021-12-18 20:52:02,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:52:02,217 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 94 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:02,218 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 31 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:52:02,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-18 20:52:02,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2021-12-18 20:52:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.675) internal successors, (67), 55 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2021-12-18 20:52:02,224 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 8 [2021-12-18 20:52:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:02,224 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2021-12-18 20:52:02,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2021-12-18 20:52:02,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 20:52:02,225 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:02,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:02,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 20:52:02,225 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:02,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:02,226 INFO L85 PathProgramCache]: Analyzing trace with hash 620871746, now seen corresponding path program 1 times [2021-12-18 20:52:02,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:02,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731850097] [2021-12-18 20:52:02,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:02,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:02,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:02,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:02,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731850097] [2021-12-18 20:52:02,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731850097] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:52:02,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:52:02,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:52:02,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323916585] [2021-12-18 20:52:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:52:02,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:52:02,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:02,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:52:02,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:52:02,330 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:02,415 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2021-12-18 20:52:02,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:52:02,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-18 20:52:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:02,417 INFO L225 Difference]: With dead ends: 77 [2021-12-18 20:52:02,417 INFO L226 Difference]: Without dead ends: 77 [2021-12-18 20:52:02,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:52:02,419 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 99 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:02,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 33 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:52:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-12-18 20:52:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2021-12-18 20:52:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.489795918367347) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2021-12-18 20:52:02,425 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 8 [2021-12-18 20:52:02,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:02,426 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2021-12-18 20:52:02,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2021-12-18 20:52:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-18 20:52:02,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:02,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:02,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 20:52:02,427 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:02,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:02,428 INFO L85 PathProgramCache]: Analyzing trace with hash -382774458, now seen corresponding path program 1 times [2021-12-18 20:52:02,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:02,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431330148] [2021-12-18 20:52:02,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:02,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:02,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:02,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431330148] [2021-12-18 20:52:02,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431330148] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:52:02,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:52:02,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:52:02,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655748766] [2021-12-18 20:52:02,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:52:02,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 20:52:02,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:02,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 20:52:02,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:52:02,531 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:02,774 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2021-12-18 20:52:02,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 20:52:02,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-18 20:52:02,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:02,779 INFO L225 Difference]: With dead ends: 140 [2021-12-18 20:52:02,779 INFO L226 Difference]: Without dead ends: 140 [2021-12-18 20:52:02,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:52:02,788 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 115 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:02,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 127 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:52:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-18 20:52:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 69. [2021-12-18 20:52:02,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.471698113207547) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2021-12-18 20:52:02,803 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2021-12-18 20:52:02,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:02,804 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2021-12-18 20:52:02,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,804 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2021-12-18 20:52:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 20:52:02,805 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:02,805 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:02,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 20:52:02,806 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:02,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1017634056, now seen corresponding path program 1 times [2021-12-18 20:52:02,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:02,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723836171] [2021-12-18 20:52:02,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:02,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:02,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:02,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723836171] [2021-12-18 20:52:02,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723836171] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:52:02,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:52:02,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:52:02,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656768778] [2021-12-18 20:52:02,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:52:02,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:52:02,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:02,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:52:02,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:52:02,869 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:02,930 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-18 20:52:02,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:52:02,931 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 20:52:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:02,931 INFO L225 Difference]: With dead ends: 76 [2021-12-18 20:52:02,932 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 20:52:02,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:52:02,935 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:02,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 51 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:52:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 20:52:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2021-12-18 20:52:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2021-12-18 20:52:02,945 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 15 [2021-12-18 20:52:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:02,945 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2021-12-18 20:52:02,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2021-12-18 20:52:02,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 20:52:02,946 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:02,946 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:02,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 20:52:02,947 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:02,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:02,947 INFO L85 PathProgramCache]: Analyzing trace with hash -90857936, now seen corresponding path program 1 times [2021-12-18 20:52:02,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:02,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379098088] [2021-12-18 20:52:02,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:02,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:03,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:03,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:03,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379098088] [2021-12-18 20:52:03,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379098088] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:03,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719366694] [2021-12-18 20:52:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:03,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:03,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:03,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:52:03,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 20:52:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:03,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-18 20:52:03,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:03,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:52:03,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:52:03,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2021-12-18 20:52:03,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2021-12-18 20:52:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:03,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:03,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 55 treesize of output 49 [2021-12-18 20:52:03,617 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 47 treesize of output 41 [2021-12-18 20:52:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:03,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719366694] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:03,815 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:03,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2021-12-18 20:52:03,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923014567] [2021-12-18 20:52:03,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:03,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-18 20:52:03,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:03,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-18 20:52:03,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2021-12-18 20:52:03,817 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:04,063 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2021-12-18 20:52:04,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 20:52:04,064 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 20:52:04,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:04,065 INFO L225 Difference]: With dead ends: 100 [2021-12-18 20:52:04,065 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 20:52:04,065 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2021-12-18 20:52:04,066 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 237 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:04,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 191 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 235 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2021-12-18 20:52:04,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 20:52:04,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 72. [2021-12-18 20:52:04,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2021-12-18 20:52:04,071 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 17 [2021-12-18 20:52:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:04,071 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2021-12-18 20:52:04,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2021-12-18 20:52:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 20:52:04,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:04,072 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:04,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:04,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-18 20:52:04,273 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:04,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204603, now seen corresponding path program 1 times [2021-12-18 20:52:04,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:04,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641436544] [2021-12-18 20:52:04,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:04,274 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:04,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:04,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:04,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641436544] [2021-12-18 20:52:04,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641436544] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:52:04,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:52:04,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:52:04,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060927979] [2021-12-18 20:52:04,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:52:04,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:52:04,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:04,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:52:04,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:52:04,320 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:04,419 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2021-12-18 20:52:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:52:04,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 20:52:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:04,420 INFO L225 Difference]: With dead ends: 74 [2021-12-18 20:52:04,420 INFO L226 Difference]: Without dead ends: 74 [2021-12-18 20:52:04,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:52:04,421 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:04,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 123 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:52:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-18 20:52:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2021-12-18 20:52:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2021-12-18 20:52:04,426 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 17 [2021-12-18 20:52:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:04,426 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2021-12-18 20:52:04,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2021-12-18 20:52:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 20:52:04,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:04,427 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:04,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 20:52:04,427 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:04,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:04,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204604, now seen corresponding path program 1 times [2021-12-18 20:52:04,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:04,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309359179] [2021-12-18 20:52:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:04,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:04,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:04,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:04,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309359179] [2021-12-18 20:52:04,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309359179] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:52:04,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:52:04,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:52:04,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784459828] [2021-12-18 20:52:04,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:52:04,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:52:04,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:04,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:52:04,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:52:04,510 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:04,665 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2021-12-18 20:52:04,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 20:52:04,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 20:52:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:04,667 INFO L225 Difference]: With dead ends: 70 [2021-12-18 20:52:04,667 INFO L226 Difference]: Without dead ends: 70 [2021-12-18 20:52:04,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-18 20:52:04,668 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:04,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 144 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:52:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-18 20:52:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2021-12-18 20:52:04,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2021-12-18 20:52:04,672 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 17 [2021-12-18 20:52:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:04,672 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2021-12-18 20:52:04,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2021-12-18 20:52:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:52:04,673 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:04,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:04,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 20:52:04,673 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:04,674 INFO L85 PathProgramCache]: Analyzing trace with hash 76906689, now seen corresponding path program 1 times [2021-12-18 20:52:04,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:04,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108202853] [2021-12-18 20:52:04,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:04,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:52:04,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:04,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108202853] [2021-12-18 20:52:04,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108202853] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:52:04,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:52:04,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:52:04,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625294247] [2021-12-18 20:52:04,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:52:04,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:52:04,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:04,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:52:04,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:52:04,707 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:04,756 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2021-12-18 20:52:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:52:04,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:52:04,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:04,757 INFO L225 Difference]: With dead ends: 70 [2021-12-18 20:52:04,758 INFO L226 Difference]: Without dead ends: 70 [2021-12-18 20:52:04,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:52:04,758 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:04,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 39 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:52:04,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-18 20:52:04,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2021-12-18 20:52:04,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2021-12-18 20:52:04,762 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 22 [2021-12-18 20:52:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:04,762 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2021-12-18 20:52:04,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2021-12-18 20:52:04,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 20:52:04,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:04,763 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:04,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 20:52:04,763 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:04,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash -296680512, now seen corresponding path program 1 times [2021-12-18 20:52:04,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:04,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269528923] [2021-12-18 20:52:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:04,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:04,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:04,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269528923] [2021-12-18 20:52:04,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269528923] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:04,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337670207] [2021-12-18 20:52:04,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:04,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:04,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:04,912 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:52:04,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 20:52:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:04,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-18 20:52:04,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:05,064 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:52:05,104 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:05,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:05,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:05,157 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:52:05,161 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:05,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 8 [2021-12-18 20:52:05,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:05,294 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:05,349 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:05,351 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:05,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-18 20:52:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:05,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:05,464 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_35| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_35|))) is different from false [2021-12-18 20:52:05,541 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_35| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_35|))) is different from false [2021-12-18 20:52:05,557 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_35| 0) (= 0 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_35|))) is different from false [2021-12-18 20:52:05,574 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_171 Int) (v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_35| 0) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_171)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_35|))) is different from false [2021-12-18 20:52:05,689 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:05,694 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:05,694 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2021-12-18 20:52:05,704 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:05,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-18 20:52:05,720 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:05,721 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:52:05,725 INFO L388 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 9 treesize of output 7 [2021-12-18 20:52:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 20:52:05,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337670207] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:05,907 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:05,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2021-12-18 20:52:05,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782257655] [2021-12-18 20:52:05,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:05,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-18 20:52:05,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:05,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-18 20:52:05,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=557, Unknown=4, NotChecked=204, Total=870 [2021-12-18 20:52:05,909 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:06,265 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (= .cse0 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_171 Int) (v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_35| 0) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_171)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_35|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| |c_ULTIMATE.start_main_~p~0#1.offset|) (= .cse0 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|) (<= |c_ULTIMATE.start_main_~p~0#1.offset| 0)))) is different from false [2021-12-18 20:52:06,523 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~a~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~p~0#1.base|)) (forall ((v_ArrVal_171 Int) (v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_35| 0) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_171)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|)) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2021-12-18 20:52:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:06,863 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2021-12-18 20:52:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 20:52:06,864 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-18 20:52:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:06,864 INFO L225 Difference]: With dead ends: 121 [2021-12-18 20:52:06,864 INFO L226 Difference]: Without dead ends: 121 [2021-12-18 20:52:06,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=816, Unknown=6, NotChecked=390, Total=1406 [2021-12-18 20:52:06,865 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 211 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:06,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 309 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 430 Invalid, 0 Unknown, 370 Unchecked, 0.2s Time] [2021-12-18 20:52:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-18 20:52:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2021-12-18 20:52:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2021-12-18 20:52:06,869 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 23 [2021-12-18 20:52:06,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:06,869 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2021-12-18 20:52:06,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2021-12-18 20:52:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 20:52:06,870 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:06,870 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:06,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:07,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-18 20:52:07,083 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1909738955, now seen corresponding path program 1 times [2021-12-18 20:52:07,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:07,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224101383] [2021-12-18 20:52:07,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:07,084 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:52:07,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:07,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224101383] [2021-12-18 20:52:07,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224101383] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:07,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359387052] [2021-12-18 20:52:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:07,215 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:07,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:07,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:52:07,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 20:52:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:07,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 20:52:07,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:07,357 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:52:07,361 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:52:07,440 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:07,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-18 20:52:07,445 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:07,446 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2021-12-18 20:52:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:07,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:07,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 25 [2021-12-18 20:52:07,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:07,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:07,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359387052] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:07,744 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:07,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 21 [2021-12-18 20:52:07,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514790073] [2021-12-18 20:52:07,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:07,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 20:52:07,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:07,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 20:52:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2021-12-18 20:52:07,746 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:08,047 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2021-12-18 20:52:08,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 20:52:08,047 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-18 20:52:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:08,048 INFO L225 Difference]: With dead ends: 91 [2021-12-18 20:52:08,048 INFO L226 Difference]: Without dead ends: 91 [2021-12-18 20:52:08,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2021-12-18 20:52:08,049 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 267 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:08,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 189 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:52:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-18 20:52:08,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2021-12-18 20:52:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 83 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2021-12-18 20:52:08,052 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 25 [2021-12-18 20:52:08,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:08,052 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2021-12-18 20:52:08,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 21 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:08,053 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2021-12-18 20:52:08,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 20:52:08,053 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:08,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:08,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:08,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:08,264 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash -927635976, now seen corresponding path program 1 times [2021-12-18 20:52:08,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:08,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508177503] [2021-12-18 20:52:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:08,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:08,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:52:08,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:08,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508177503] [2021-12-18 20:52:08,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508177503] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:08,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689473233] [2021-12-18 20:52:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:08,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:08,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:08,316 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:52:08,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-18 20:52:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:08,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 20:52:08,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:08,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2021-12-18 20:52:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:52:08,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:08,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:52:08,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689473233] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:08,598 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:08,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-12-18 20:52:08,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360436636] [2021-12-18 20:52:08,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:08,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:52:08,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:08,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:52:08,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:52:08,600 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:08,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:08,679 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2021-12-18 20:52:08,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:52:08,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 20:52:08,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:08,680 INFO L225 Difference]: With dead ends: 86 [2021-12-18 20:52:08,680 INFO L226 Difference]: Without dead ends: 67 [2021-12-18 20:52:08,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:52:08,681 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:08,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 107 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2021-12-18 20:52:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-18 20:52:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-18 20:52:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2021-12-18 20:52:08,689 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 26 [2021-12-18 20:52:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:08,689 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2021-12-18 20:52:08,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:08,689 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2021-12-18 20:52:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 20:52:08,690 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:08,690 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:08,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:08,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:08,907 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:08,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:08,908 INFO L85 PathProgramCache]: Analyzing trace with hash 638411638, now seen corresponding path program 1 times [2021-12-18 20:52:08,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:08,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553317365] [2021-12-18 20:52:08,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:08,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:09,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:09,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553317365] [2021-12-18 20:52:09,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553317365] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:09,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898214672] [2021-12-18 20:52:09,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:09,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:09,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:09,104 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:52:09,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-18 20:52:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:09,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 20:52:09,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:09,264 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 20:52:09,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2021-12-18 20:52:09,314 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:09,451 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:09,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:52:09,472 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:09,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-18 20:52:09,576 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:09,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2021-12-18 20:52:09,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:09,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:09,914 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:09,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2021-12-18 20:52:09,922 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:09,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2021-12-18 20:52:09,927 INFO L388 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 13 treesize of output 9 [2021-12-18 20:52:10,393 INFO L354 Elim1Store]: treesize reduction 18, result has 63.3 percent of original size [2021-12-18 20:52:10,394 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 67 [2021-12-18 20:52:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:10,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898214672] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:10,597 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:10,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2021-12-18 20:52:10,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855947870] [2021-12-18 20:52:10,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:10,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-18 20:52:10,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:10,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-18 20:52:10,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=945, Unknown=9, NotChecked=0, Total=1122 [2021-12-18 20:52:10,599 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:11,017 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2021-12-18 20:52:11,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 20:52:11,017 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 20:52:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:11,018 INFO L225 Difference]: With dead ends: 118 [2021-12-18 20:52:11,018 INFO L226 Difference]: Without dead ends: 118 [2021-12-18 20:52:11,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=1262, Unknown=9, NotChecked=0, Total=1560 [2021-12-18 20:52:11,019 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 213 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:11,019 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 365 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 458 Invalid, 0 Unknown, 325 Unchecked, 0.3s Time] [2021-12-18 20:52:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-18 20:52:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 71. [2021-12-18 20:52:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:11,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2021-12-18 20:52:11,022 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 26 [2021-12-18 20:52:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:11,022 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2021-12-18 20:52:11,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2021-12-18 20:52:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 20:52:11,023 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:11,023 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:11,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:11,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-18 20:52:11,236 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:11,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:11,236 INFO L85 PathProgramCache]: Analyzing trace with hash 638411639, now seen corresponding path program 1 times [2021-12-18 20:52:11,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:11,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278696108] [2021-12-18 20:52:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:11,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:11,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:11,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278696108] [2021-12-18 20:52:11,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278696108] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:11,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092190267] [2021-12-18 20:52:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:11,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:11,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:11,437 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:52:11,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-18 20:52:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:11,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-18 20:52:11,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:11,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:52:11,587 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:11,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:11,642 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:11,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:11,777 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:11,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:52:11,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:11,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:11,811 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:11,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 20:52:11,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 20:52:11,927 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:11,928 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2021-12-18 20:52:11,931 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:11,933 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:11,933 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 16 [2021-12-18 20:52:11,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:11,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:12,492 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:12,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 59 [2021-12-18 20:52:12,497 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:12,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2021-12-18 20:52:12,505 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:12,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 89 [2021-12-18 20:52:12,515 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:12,515 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 134 [2021-12-18 20:52:12,525 INFO L388 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 95 treesize of output 87 [2021-12-18 20:52:12,529 INFO L388 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 87 treesize of output 79 [2021-12-18 20:52:12,533 INFO L388 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 79 treesize of output 75 [2021-12-18 20:52:12,822 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:12,822 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:52:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:12,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092190267] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:12,936 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:12,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2021-12-18 20:52:12,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394010587] [2021-12-18 20:52:12,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:12,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2021-12-18 20:52:12,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:12,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-18 20:52:12,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1018, Unknown=11, NotChecked=0, Total=1190 [2021-12-18 20:52:12,938 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:13,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:13,696 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2021-12-18 20:52:13,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 20:52:13,696 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 20:52:13,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:13,697 INFO L225 Difference]: With dead ends: 122 [2021-12-18 20:52:13,697 INFO L226 Difference]: Without dead ends: 122 [2021-12-18 20:52:13,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=436, Invalid=2003, Unknown=11, NotChecked=0, Total=2450 [2021-12-18 20:52:13,699 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 314 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:13,699 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 421 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 556 Invalid, 0 Unknown, 286 Unchecked, 0.3s Time] [2021-12-18 20:52:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-12-18 20:52:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 70. [2021-12-18 20:52:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.278688524590164) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2021-12-18 20:52:13,702 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 26 [2021-12-18 20:52:13,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:13,702 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2021-12-18 20:52:13,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2021-12-18 20:52:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 20:52:13,703 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:13,703 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:13,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:13,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:13,928 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:13,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash -666737801, now seen corresponding path program 1 times [2021-12-18 20:52:13,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:13,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605915292] [2021-12-18 20:52:13,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:13,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:14,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:14,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:14,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605915292] [2021-12-18 20:52:14,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605915292] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:14,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209843824] [2021-12-18 20:52:14,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:14,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:14,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:14,232 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:52:14,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 20:52:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:14,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-18 20:52:14,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:14,371 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:14,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:14,424 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:14,439 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:14,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:52:14,584 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:14,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-18 20:52:14,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:14,591 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2021-12-18 20:52:14,621 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:14,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2021-12-18 20:52:14,625 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 20:52:14,628 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2021-12-18 20:52:14,755 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:14,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2021-12-18 20:52:14,759 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:14,761 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:14,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 18 [2021-12-18 20:52:14,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2021-12-18 20:52:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:14,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:14,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_ArrVal_435 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_62| Int) (v_ArrVal_433 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_62|) (= (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_62| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_434)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1) (< |v_ULTIMATE.start_main_~p~0#1.offset_62| 0))) is different from false [2021-12-18 20:52:14,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 458 treesize of output 414 [2021-12-18 20:52:15,511 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:15,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 88 [2021-12-18 20:52:15,516 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:15,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 78 [2021-12-18 20:52:15,523 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:15,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 106 [2021-12-18 20:52:15,531 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:15,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 132 [2021-12-18 20:52:15,537 INFO L388 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 93 treesize of output 89 [2021-12-18 20:52:15,540 INFO L388 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 89 treesize of output 85 [2021-12-18 20:52:15,544 INFO L388 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 85 treesize of output 81 [2021-12-18 20:52:15,549 INFO L388 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 81 treesize of output 77 [2021-12-18 20:52:15,811 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:52:15,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:52:15,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:15,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209843824] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:52:15,943 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:52:15,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 37 [2021-12-18 20:52:15,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590978859] [2021-12-18 20:52:15,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:52:15,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-12-18 20:52:15,944 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:52:15,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-12-18 20:52:15,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1116, Unknown=1, NotChecked=68, Total=1332 [2021-12-18 20:52:15,945 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:52:17,967 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2021-12-18 20:52:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 20:52:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-18 20:52:17,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:52:17,968 INFO L225 Difference]: With dead ends: 118 [2021-12-18 20:52:17,968 INFO L226 Difference]: Without dead ends: 118 [2021-12-18 20:52:17,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=321, Invalid=1844, Unknown=1, NotChecked=90, Total=2256 [2021-12-18 20:52:17,970 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 229 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:52:17,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 468 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 579 Invalid, 0 Unknown, 369 Unchecked, 0.3s Time] [2021-12-18 20:52:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-12-18 20:52:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 72. [2021-12-18 20:52:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:17,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2021-12-18 20:52:17,973 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 28 [2021-12-18 20:52:17,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:52:17,973 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2021-12-18 20:52:17,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.0) internal successors, (74), 37 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:52:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2021-12-18 20:52:17,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-12-18 20:52:17,974 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:52:17,974 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:52:17,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 20:52:18,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:18,179 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:52:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:52:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1442763871, now seen corresponding path program 2 times [2021-12-18 20:52:18,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:52:18,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516707852] [2021-12-18 20:52:18,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:52:18,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:52:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:52:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:18,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:52:18,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516707852] [2021-12-18 20:52:18,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516707852] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:52:18,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618617886] [2021-12-18 20:52:18,426 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:52:18,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:18,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:18,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:52:18,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 20:52:18,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:52:18,494 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:52:18,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 59 conjunts are in the unsatisfiable core [2021-12-18 20:52:18,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:18,557 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:52:18,566 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:52:18,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:52:18,605 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:18,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:18,739 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:18,740 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 20:52:18,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:52:18,750 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:52:18,804 INFO L354 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2021-12-18 20:52:18,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 49 [2021-12-18 20:52:18,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2021-12-18 20:52:18,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-12-18 20:52:19,389 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:19,390 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:19,391 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:19,397 INFO L354 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2021-12-18 20:52:19,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 44 [2021-12-18 20:52:19,402 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:52:19,406 INFO L354 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-12-18 20:52:19,407 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2021-12-18 20:52:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:19,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:19,730 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:19,730 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 85 [2021-12-18 20:52:19,734 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:19,735 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 84 [2021-12-18 20:52:21,047 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:21,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 102 [2021-12-18 20:52:21,061 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:21,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 86 [2021-12-18 20:52:21,103 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:21,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 273 [2021-12-18 20:52:21,131 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:21,131 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 223 [2021-12-18 20:52:21,314 INFO L354 Elim1Store]: treesize reduction 54, result has 75.7 percent of original size [2021-12-18 20:52:21,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 516 treesize of output 585 [2021-12-18 20:52:21,387 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:21,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 482 treesize of output 472 [2021-12-18 20:55:20,864 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:55:20,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:55:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:20,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618617886] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:55:20,962 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:55:20,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 39 [2021-12-18 20:55:20,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932981390] [2021-12-18 20:55:20,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:55:20,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-18 20:55:20,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:55:20,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-18 20:55:20,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1318, Unknown=15, NotChecked=0, Total=1482 [2021-12-18 20:55:20,965 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:21,421 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2021-12-18 20:55:21,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 20:55:21,421 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-12-18 20:55:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:21,422 INFO L225 Difference]: With dead ends: 82 [2021-12-18 20:55:21,422 INFO L226 Difference]: Without dead ends: 82 [2021-12-18 20:55:21,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=247, Invalid=1808, Unknown=15, NotChecked=0, Total=2070 [2021-12-18 20:55:21,423 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 62 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:21,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 535 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 382 Invalid, 0 Unknown, 299 Unchecked, 0.2s Time] [2021-12-18 20:55:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-12-18 20:55:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2021-12-18 20:55:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2021-12-18 20:55:21,425 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 31 [2021-12-18 20:55:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:21,426 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2021-12-18 20:55:21,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:21,426 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2021-12-18 20:55:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 20:55:21,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:21,427 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:21,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:21,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-12-18 20:55:21,639 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:21,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash 118832262, now seen corresponding path program 2 times [2021-12-18 20:55:21,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:55:21,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999120351] [2021-12-18 20:55:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:21,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:55:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:21,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:55:21,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999120351] [2021-12-18 20:55:21,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999120351] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:55:21,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162999671] [2021-12-18 20:55:21,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:55:21,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:55:21,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:55:21,853 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:55:21,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 20:55:21,934 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:55:21,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:55:21,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-18 20:55:21,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:22,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:55:22,037 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:55:22,038 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:55:22,078 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:22,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:55:22,083 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:55:22,118 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 8 [2021-12-18 20:55:22,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:55:22,205 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:55:22,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:55:22,236 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:55:22,240 INFO L388 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 13 treesize of output 9 [2021-12-18 20:55:22,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:55:22,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:55:22,332 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:55:22,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:55:22,384 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:22,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2021-12-18 20:55:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:22,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:55:22,471 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_75| Int) (v_ArrVal_599 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_75|) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_75|)) (< |v_ULTIMATE.start_main_~p~0#1.offset_75| 0))) is different from false [2021-12-18 20:55:22,514 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_75| Int) (v_ArrVal_599 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_75|) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_75|)) (< |v_ULTIMATE.start_main_~p~0#1.offset_75| 0))) is different from false [2021-12-18 20:55:22,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_75| Int) (v_ArrVal_599 (Array Int Int))) (or (= 0 (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_75|)) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_75|) (< |v_ULTIMATE.start_main_~p~0#1.offset_75| 0))) is different from false [2021-12-18 20:55:22,539 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_75| Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_75|) (< |v_ULTIMATE.start_main_~p~0#1.offset_75| 0) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_75|)))) is different from false [2021-12-18 20:55:22,624 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_75| Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|))) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_75|) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_75|)) (< |v_ULTIMATE.start_main_~p~0#1.offset_75| 0))) is different from false [2021-12-18 20:55:22,716 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_75| Int) (v_ArrVal_597 (Array Int Int)) (v_ArrVal_599 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|))) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_75|) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_597) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_75|)) (< |v_ULTIMATE.start_main_~p~0#1.offset_75| 0))) is different from false [2021-12-18 20:55:22,780 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:55:22,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:55:23,020 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:55:23,025 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:23,026 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2021-12-18 20:55:23,036 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:23,036 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 63 [2021-12-18 20:55:23,051 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:55:23,052 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:55:23,057 INFO L388 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 48 treesize of output 44 [2021-12-18 20:55:23,061 INFO L388 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 22 treesize of output 20 [2021-12-18 20:55:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2021-12-18 20:55:23,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162999671] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:55:23,349 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:55:23,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 43 [2021-12-18 20:55:23,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425498484] [2021-12-18 20:55:23,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:55:23,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2021-12-18 20:55:23,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:55:23,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2021-12-18 20:55:23,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1135, Unknown=42, NotChecked=450, Total=1806 [2021-12-18 20:55:23,351 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:23,940 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2021-12-18 20:55:23,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 20:55:23,941 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-18 20:55:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:23,941 INFO L225 Difference]: With dead ends: 126 [2021-12-18 20:55:23,941 INFO L226 Difference]: Without dead ends: 126 [2021-12-18 20:55:23,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=396, Invalid=1927, Unknown=53, NotChecked=594, Total=2970 [2021-12-18 20:55:23,943 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 121 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 600 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:23,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 367 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 434 Invalid, 0 Unknown, 600 Unchecked, 0.2s Time] [2021-12-18 20:55:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-18 20:55:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2021-12-18 20:55:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 89 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2021-12-18 20:55:23,947 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 32 [2021-12-18 20:55:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:23,948 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2021-12-18 20:55:23,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2021-12-18 20:55:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-18 20:55:23,950 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:23,950 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:23,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:24,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-18 20:55:24,160 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:24,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:24,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1785556241, now seen corresponding path program 1 times [2021-12-18 20:55:24,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:55:24,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579267641] [2021-12-18 20:55:24,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:24,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:55:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:24,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:24,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:55:24,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579267641] [2021-12-18 20:55:24,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579267641] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:55:24,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115569826] [2021-12-18 20:55:24,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:24,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:55:24,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:55:24,393 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:55:24,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 20:55:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:24,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 20:55:24,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:24,538 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:55:24,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:55:24,575 INFO L388 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 13 treesize of output 9 [2021-12-18 20:55:24,672 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:55:24,672 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2021-12-18 20:55:24,686 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:55:24,686 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2021-12-18 20:55:24,767 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:55:24,769 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:24,769 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 15 [2021-12-18 20:55:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:55:24,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:55:24,910 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_83| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_83| 0) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_83|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_83| 4)) 0)))) is different from false [2021-12-18 20:55:24,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_83| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_83| 0) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_83|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_83| 4)) 0)))) is different from false [2021-12-18 20:55:24,960 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_83| Int)) (or (< |v_ULTIMATE.start_main_~p~0#1.offset_83| 0) (< |c_ULTIMATE.start_main_~a~0#1.offset| |v_ULTIMATE.start_main_~p~0#1.offset_83|) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_661) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_83| 4)) 0)))) is different from false [2021-12-18 20:55:24,967 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:24,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2021-12-18 20:55:24,973 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:24,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 42 [2021-12-18 20:55:24,976 INFO L388 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 22 treesize of output 18 [2021-12-18 20:55:25,167 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:55:25,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 20:55:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2021-12-18 20:55:25,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115569826] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:55:25,260 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 20:55:25,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 39 [2021-12-18 20:55:25,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566251059] [2021-12-18 20:55:25,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 20:55:25,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2021-12-18 20:55:25,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:55:25,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-12-18 20:55:25,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1112, Unknown=3, NotChecked=210, Total=1482 [2021-12-18 20:55:25,261 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 39 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:26,064 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2021-12-18 20:55:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-18 20:55:26,065 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-12-18 20:55:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:26,065 INFO L225 Difference]: With dead ends: 123 [2021-12-18 20:55:26,065 INFO L226 Difference]: Without dead ends: 123 [2021-12-18 20:55:26,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=497, Invalid=2374, Unknown=3, NotChecked=318, Total=3192 [2021-12-18 20:55:26,067 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 227 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:26,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 506 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 756 Invalid, 0 Unknown, 330 Unchecked, 0.3s Time] [2021-12-18 20:55:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-18 20:55:26,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 99. [2021-12-18 20:55:26,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 98 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:26,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2021-12-18 20:55:26,071 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 34 [2021-12-18 20:55:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:26,071 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2021-12-18 20:55:26,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.2564102564102564) internal successors, (88), 39 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:26,071 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2021-12-18 20:55:26,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 20:55:26,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:26,072 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:26,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:26,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-18 20:55:26,272 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:26,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:26,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1083714800, now seen corresponding path program 3 times [2021-12-18 20:55:26,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 20:55:26,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122410435] [2021-12-18 20:55:26,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:26,273 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 20:55:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:26,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 20:55:26,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122410435] [2021-12-18 20:55:26,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122410435] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 20:55:26,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625736948] [2021-12-18 20:55:26,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 20:55:26,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:55:26,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:55:26,531 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:55:26,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 20:55:26,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-18 20:55:26,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:55:26,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-18 20:55:26,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:26,714 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:55:26,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 20:55:26,757 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:26,890 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:55:26,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-12-18 20:55:26,964 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-12-18 20:55:26,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2021-12-18 20:55:26,972 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:27,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2021-12-18 20:55:27,243 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:55:27,261 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-12-18 20:55:27,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 55 [2021-12-18 20:55:27,290 INFO L388 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 7 treesize of output 3 [2021-12-18 20:55:27,305 INFO L388 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 25 treesize of output 13 [2021-12-18 20:55:27,318 INFO L388 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 31 treesize of output 19 [2021-12-18 20:55:27,504 INFO L354 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2021-12-18 20:55:27,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 135 [2021-12-18 20:55:27,518 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-18 20:55:27,519 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 20:55:27,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-12-18 20:55:27,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015995491] [2021-12-18 20:55:27,520 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 20:55:27,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-18 20:55:27,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 20:55:27,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-18 20:55:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2021-12-18 20:55:27,522 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 17 states, 16 states have (on average 2.1875) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:27,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 20:55:27,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2021-12-18 20:55:27,524 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:27,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:55:27,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2021-12-18 20:55:27,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:55:27,748 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@6dd4232c at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-18 20:55:27,750 INFO L158 Benchmark]: Toolchain (without parser) took 206876.09ms. Allocated memory was 92.3MB in the beginning and 490.7MB in the end (delta: 398.5MB). Free memory was 51.8MB in the beginning and 194.5MB in the end (delta: -142.7MB). Peak memory consumption was 257.4MB. Max. memory is 16.1GB. [2021-12-18 20:55:27,750 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 20:55:27,751 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.11ms. Allocated memory is still 92.3MB. Free memory was 51.5MB in the beginning and 62.2MB in the end (delta: -10.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2021-12-18 20:55:27,751 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.40ms. Allocated memory is still 92.3MB. Free memory was 62.2MB in the beginning and 60.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:55:27,752 INFO L158 Benchmark]: Boogie Preprocessor took 49.66ms. Allocated memory is still 92.3MB. Free memory was 60.2MB in the beginning and 58.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 20:55:27,752 INFO L158 Benchmark]: RCFGBuilder took 327.17ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 45.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-18 20:55:27,752 INFO L158 Benchmark]: TraceAbstraction took 206108.38ms. Allocated memory was 92.3MB in the beginning and 490.7MB in the end (delta: 398.5MB). Free memory was 44.6MB in the beginning and 194.5MB in the end (delta: -149.9MB). Peak memory consumption was 248.9MB. Max. memory is 16.1GB. [2021-12-18 20:55:27,753 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 92.3MB. Free memory is still 69.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.11ms. Allocated memory is still 92.3MB. Free memory was 51.5MB in the beginning and 62.2MB in the end (delta: -10.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.40ms. Allocated memory is still 92.3MB. Free memory was 62.2MB in the beginning and 60.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.66ms. Allocated memory is still 92.3MB. Free memory was 60.2MB in the beginning and 58.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 327.17ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 45.1MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 206108.38ms. Allocated memory was 92.3MB in the beginning and 490.7MB in the end (delta: 398.5MB). Free memory was 44.6MB in the beginning and 194.5MB in the end (delta: -149.9MB). Peak memory consumption was 248.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@6dd4232c de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@6dd4232c: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-18 20:55:27,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/simple-ext_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cf7f5d5a0c627430d9132d0f1be3b1c0ad58f22e7924c03137596c145de85b8c --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:55:29,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:55:29,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:55:29,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:55:29,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:55:29,660 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:55:29,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:55:29,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:55:29,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:55:29,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:55:29,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:55:29,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:55:29,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:55:29,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:55:29,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:55:29,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:55:29,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:55:29,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:55:29,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:55:29,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:55:29,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:55:29,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:55:29,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:55:29,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:55:29,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:55:29,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:55:29,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:55:29,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:55:29,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:55:29,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:55:29,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:55:29,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:55:29,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:55:29,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:55:29,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:55:29,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:55:29,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:55:29,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:55:29,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:55:29,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:55:29,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:55:29,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 20:55:29,765 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:55:29,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:55:29,767 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:55:29,767 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:55:29,768 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:55:29,768 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:55:29,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:55:29,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:55:29,769 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:55:29,770 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:55:29,770 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:55:29,770 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:55:29,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:55:29,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:55:29,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:55:29,771 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:55:29,771 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:55:29,772 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:55:29,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:55:29,772 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:55:29,772 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 20:55:29,772 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 20:55:29,772 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:55:29,773 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:55:29,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:55:29,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:55:29,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:55:29,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:55:29,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:55:29,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:55:29,774 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 20:55:29,774 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 20:55:29,775 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:55:29,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 20:55:29,775 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cf7f5d5a0c627430d9132d0f1be3b1c0ad58f22e7924c03137596c145de85b8c [2021-12-18 20:55:30,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:55:30,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:55:30,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:55:30,112 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:55:30,113 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:55:30,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext_1.i [2021-12-18 20:55:30,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f020a7d7f/f844c330b7d3448fad3d4fa4db3205d3/FLAGf881e8067 [2021-12-18 20:55:30,640 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:55:30,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext_1.i [2021-12-18 20:55:30,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f020a7d7f/f844c330b7d3448fad3d4fa4db3205d3/FLAGf881e8067 [2021-12-18 20:55:30,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f020a7d7f/f844c330b7d3448fad3d4fa4db3205d3 [2021-12-18 20:55:30,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:55:30,664 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:55:30,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:55:30,665 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:55:30,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:55:30,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:55:30" (1/1) ... [2021-12-18 20:55:30,673 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ecb973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:30, skipping insertion in model container [2021-12-18 20:55:30,673 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:55:30" (1/1) ... [2021-12-18 20:55:30,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:55:30,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:55:31,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext_1.i[23274,23287] [2021-12-18 20:55:31,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:55:31,034 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 20:55:31,081 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext_1.i[23274,23287] [2021-12-18 20:55:31,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:55:31,115 INFO L208 MainTranslator]: Completed translation [2021-12-18 20:55:31,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31 WrapperNode [2021-12-18 20:55:31,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:55:31,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 20:55:31,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 20:55:31,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 20:55:31,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (1/1) ... [2021-12-18 20:55:31,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (1/1) ... [2021-12-18 20:55:31,177 INFO L137 Inliner]: procedures = 127, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 73 [2021-12-18 20:55:31,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 20:55:31,179 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 20:55:31,179 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 20:55:31,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 20:55:31,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (1/1) ... [2021-12-18 20:55:31,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (1/1) ... [2021-12-18 20:55:31,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (1/1) ... [2021-12-18 20:55:31,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (1/1) ... [2021-12-18 20:55:31,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (1/1) ... [2021-12-18 20:55:31,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (1/1) ... [2021-12-18 20:55:31,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (1/1) ... [2021-12-18 20:55:31,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 20:55:31,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 20:55:31,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 20:55:31,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 20:55:31,224 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (1/1) ... [2021-12-18 20:55:31,234 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:55:31,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:55:31,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 20:55:31,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 20:55:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2021-12-18 20:55:31,293 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2021-12-18 20:55:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 20:55:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 20:55:31,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 20:55:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 20:55:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 20:55:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 20:55:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 20:55:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 20:55:31,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 20:55:31,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 20:55:31,391 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 20:55:31,392 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 20:55:31,447 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2021-12-18 20:55:31,673 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 20:55:31,683 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 20:55:31,683 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-18 20:55:31,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:55:31 BoogieIcfgContainer [2021-12-18 20:55:31,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 20:55:31,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 20:55:31,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 20:55:31,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 20:55:31,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:55:30" (1/3) ... [2021-12-18 20:55:31,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5486fe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:55:31, skipping insertion in model container [2021-12-18 20:55:31,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:55:31" (2/3) ... [2021-12-18 20:55:31,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5486fe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:55:31, skipping insertion in model container [2021-12-18 20:55:31,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:55:31" (3/3) ... [2021-12-18 20:55:31,691 INFO L111 eAbstractionObserver]: Analyzing ICFG simple-ext_1.i [2021-12-18 20:55:31,695 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 20:55:31,695 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2021-12-18 20:55:31,739 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 20:55:31,747 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 20:55:31,747 INFO L340 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2021-12-18 20:55:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 32 states have (on average 1.9375) internal successors, (62), 54 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 20:55:31,769 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:31,770 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 20:55:31,771 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:31,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516511, now seen corresponding path program 1 times [2021-12-18 20:55:31,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:31,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711272456] [2021-12-18 20:55:31,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:31,786 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:31,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:31,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:31,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 20:55:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:31,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 20:55:31,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:31,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:55:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:32,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:55:32,044 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:55:32,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711272456] [2021-12-18 20:55:32,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711272456] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:55:32,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:55:32,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:55:32,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901709953] [2021-12-18 20:55:32,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:55:32,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:55:32,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:55:32,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:55:32,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:55:32,080 INFO L87 Difference]: Start difference. First operand has 56 states, 32 states have (on average 1.9375) internal successors, (62), 54 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:32,355 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2021-12-18 20:55:32,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:55:32,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 20:55:32,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:32,362 INFO L225 Difference]: With dead ends: 96 [2021-12-18 20:55:32,363 INFO L226 Difference]: Without dead ends: 87 [2021-12-18 20:55:32,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:55:32,367 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 125 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:32,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 37 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:55:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-18 20:55:32,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2021-12-18 20:55:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.7777777777777777) internal successors, (80), 65 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2021-12-18 20:55:32,402 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 6 [2021-12-18 20:55:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:32,403 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2021-12-18 20:55:32,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2021-12-18 20:55:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-18 20:55:32,404 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:32,404 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-18 20:55:32,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:32,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:55:32,614 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:32,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:32,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516510, now seen corresponding path program 1 times [2021-12-18 20:55:32,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:32,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976244447] [2021-12-18 20:55:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:32,615 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:32,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:32,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:32,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 20:55:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:32,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 20:55:32,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:32,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:55:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:32,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:55:32,721 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:55:32,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976244447] [2021-12-18 20:55:32,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976244447] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:55:32,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:55:32,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:55:32,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507376622] [2021-12-18 20:55:32,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:55:32,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:55:32,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:55:32,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:55:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:55:32,731 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:32,868 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2021-12-18 20:55:32,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:55:32,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-18 20:55:32,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:32,870 INFO L225 Difference]: With dead ends: 68 [2021-12-18 20:55:32,870 INFO L226 Difference]: Without dead ends: 68 [2021-12-18 20:55:32,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:55:32,871 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 77 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:32,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 29 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:55:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-18 20:55:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2021-12-18 20:55:32,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.488888888888889) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2021-12-18 20:55:32,876 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 6 [2021-12-18 20:55:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:32,877 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2021-12-18 20:55:32,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2021-12-18 20:55:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 20:55:32,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:32,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:32,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:33,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:55:33,087 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:33,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash 71880067, now seen corresponding path program 1 times [2021-12-18 20:55:33,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:33,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824465465] [2021-12-18 20:55:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:33,088 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:33,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:33,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:33,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 20:55:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:33,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 20:55:33,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:33,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:55:33,265 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 20:55:33,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:55:33,324 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2021-12-18 20:55:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:33,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:55:33,343 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:55:33,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824465465] [2021-12-18 20:55:33,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824465465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:55:33,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:55:33,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 20:55:33,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243937084] [2021-12-18 20:55:33,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:55:33,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 20:55:33,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:55:33,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 20:55:33,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:55:33,348 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:33,714 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2021-12-18 20:55:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:55:33,715 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 20:55:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:33,716 INFO L225 Difference]: With dead ends: 134 [2021-12-18 20:55:33,716 INFO L226 Difference]: Without dead ends: 134 [2021-12-18 20:55:33,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:55:33,717 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 131 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:33,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 96 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:55:33,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-18 20:55:33,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 65. [2021-12-18 20:55:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.469387755102041) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2021-12-18 20:55:33,723 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 12 [2021-12-18 20:55:33,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:33,723 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2021-12-18 20:55:33,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:33,723 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2021-12-18 20:55:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 20:55:33,724 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:33,724 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:33,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:33,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:55:33,925 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2067944860, now seen corresponding path program 1 times [2021-12-18 20:55:33,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:33,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050143276] [2021-12-18 20:55:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:33,927 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:33,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:33,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:33,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 20:55:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:33,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 20:55:33,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:34,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:55:34,022 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:55:34,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050143276] [2021-12-18 20:55:34,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050143276] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:55:34,023 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:55:34,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:55:34,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199639277] [2021-12-18 20:55:34,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:55:34,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:55:34,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:55:34,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:55:34,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:55:34,025 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:34,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:34,145 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2021-12-18 20:55:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:55:34,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 20:55:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:34,146 INFO L225 Difference]: With dead ends: 72 [2021-12-18 20:55:34,146 INFO L226 Difference]: Without dead ends: 72 [2021-12-18 20:55:34,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:55:34,147 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 79 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:34,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 46 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:55:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-12-18 20:55:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2021-12-18 20:55:34,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-12-18 20:55:34,152 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 13 [2021-12-18 20:55:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:34,152 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-12-18 20:55:34,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-12-18 20:55:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 20:55:34,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:34,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:34,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:34,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:55:34,363 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:34,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769707, now seen corresponding path program 1 times [2021-12-18 20:55:34,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:34,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303349607] [2021-12-18 20:55:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:34,364 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:34,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:34,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:34,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 20:55:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:34,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 20:55:34,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:34,448 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:55:34,473 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:34,488 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:34,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 9 [2021-12-18 20:55:34,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-12-18 20:55:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:34,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:55:34,569 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:55:34,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303349607] [2021-12-18 20:55:34,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303349607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:55:34,569 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:55:34,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:55:34,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090531525] [2021-12-18 20:55:34,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:55:34,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:55:34,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:55:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:55:34,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:55:34,571 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:34,921 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2021-12-18 20:55:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 20:55:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 20:55:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:34,923 INFO L225 Difference]: With dead ends: 76 [2021-12-18 20:55:34,923 INFO L226 Difference]: Without dead ends: 76 [2021-12-18 20:55:34,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-18 20:55:34,924 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 34 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:34,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:55:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-18 20:55:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2021-12-18 20:55:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-12-18 20:55:34,928 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 13 [2021-12-18 20:55:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:34,928 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-12-18 20:55:34,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-12-18 20:55:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 20:55:34,929 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:34,929 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:34,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-18 20:55:35,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:55:35,140 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:35,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:35,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1327769708, now seen corresponding path program 1 times [2021-12-18 20:55:35,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:35,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351977787] [2021-12-18 20:55:35,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:35,141 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:35,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:35,142 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:35,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 20:55:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:35,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 20:55:35,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:35,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:55:35,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:35,240 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 12 [2021-12-18 20:55:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:35,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:55:35,256 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:55:35,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351977787] [2021-12-18 20:55:35,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351977787] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:55:35,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:55:35,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:55:35,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046375381] [2021-12-18 20:55:35,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:55:35,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:55:35,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:55:35,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:55:35,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:55:35,258 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:35,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:35,485 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2021-12-18 20:55:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:55:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 20:55:35,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:35,486 INFO L225 Difference]: With dead ends: 70 [2021-12-18 20:55:35,486 INFO L226 Difference]: Without dead ends: 70 [2021-12-18 20:55:35,486 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-18 20:55:35,487 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:35,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 111 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:55:35,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2021-12-18 20:55:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2021-12-18 20:55:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:35,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2021-12-18 20:55:35,491 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 13 [2021-12-18 20:55:35,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:35,491 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2021-12-18 20:55:35,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:35,492 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2021-12-18 20:55:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-18 20:55:35,492 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:35,492 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:35,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:35,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:55:35,701 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:35,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:35,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1804762195, now seen corresponding path program 1 times [2021-12-18 20:55:35,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:35,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165581421] [2021-12-18 20:55:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:35,702 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:35,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:35,703 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:35,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 20:55:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:35,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 20:55:35,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:35,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:35,839 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:35,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-12-18 20:55:35,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-12-18 20:55:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:35,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:55:36,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 29 [2021-12-18 20:55:36,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:55:36,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:55:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:36,060 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:55:36,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165581421] [2021-12-18 20:55:36,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165581421] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:55:36,060 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:55:36,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2021-12-18 20:55:36,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855941240] [2021-12-18 20:55:36,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:55:36,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 20:55:36,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:55:36,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 20:55:36,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:55:36,062 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:36,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:36,464 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2021-12-18 20:55:36,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 20:55:36,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-18 20:55:36,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:36,476 INFO L225 Difference]: With dead ends: 89 [2021-12-18 20:55:36,476 INFO L226 Difference]: Without dead ends: 89 [2021-12-18 20:55:36,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-18 20:55:36,478 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:36,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 98 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:55:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-12-18 20:55:36,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2021-12-18 20:55:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2021-12-18 20:55:36,497 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 15 [2021-12-18 20:55:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:36,497 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2021-12-18 20:55:36,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2021-12-18 20:55:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 20:55:36,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:36,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:36,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:36,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:55:36,708 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:36,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1932101049, now seen corresponding path program 1 times [2021-12-18 20:55:36,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:36,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828122123] [2021-12-18 20:55:36,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:36,709 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:36,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:36,710 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:36,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 20:55:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:36,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 20:55:36,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:36,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:55:36,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:55:36,906 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:55:36,907 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:55:36,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:55:36,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:55:36,958 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:36,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 8 [2021-12-18 20:55:37,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:55:37,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:55:37,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2021-12-18 20:55:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:37,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:55:37,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32))) is different from false [2021-12-18 20:55:37,221 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_133) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32))) is different from false [2021-12-18 20:55:37,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32))) v_ArrVal_133) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32))) is different from false [2021-12-18 20:55:37,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_129 (_ BitVec 32)) (v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)) v_ArrVal_129)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32))) is different from false [2021-12-18 20:55:37,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_10| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_10|))) (forall ((v_ArrVal_129 (_ BitVec 32)) (v_ArrVal_133 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)) v_ArrVal_129)) |v_ULTIMATE.start_main_~t~0#1.base_10| v_ArrVal_133) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32))))) is different from false [2021-12-18 20:55:37,320 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-18 20:55:37,320 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2021-12-18 20:55:37,331 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:37,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2021-12-18 20:55:37,336 INFO L388 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 9 treesize of output 7 [2021-12-18 20:55:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-18 20:55:37,529 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:55:37,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [828122123] [2021-12-18 20:55:37,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [828122123] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:55:37,529 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:55:37,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2021-12-18 20:55:37,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018210406] [2021-12-18 20:55:37,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:55:37,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-18 20:55:37,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:55:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-18 20:55:37,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=177, Unknown=5, NotChecked=150, Total=380 [2021-12-18 20:55:37,531 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:38,974 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2021-12-18 20:55:38,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 20:55:38,974 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 20:55:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:38,975 INFO L225 Difference]: With dead ends: 116 [2021-12-18 20:55:38,975 INFO L226 Difference]: Without dead ends: 116 [2021-12-18 20:55:38,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=124, Invalid=442, Unknown=6, NotChecked=240, Total=812 [2021-12-18 20:55:38,977 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 86 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:38,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 146 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 360 Invalid, 0 Unknown, 398 Unchecked, 0.5s Time] [2021-12-18 20:55:38,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-18 20:55:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 69. [2021-12-18 20:55:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2021-12-18 20:55:38,981 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 19 [2021-12-18 20:55:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:38,981 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2021-12-18 20:55:38,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 20 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2021-12-18 20:55:38,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 20:55:38,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:38,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:38,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:39,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:55:39,188 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:39,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:39,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1843938690, now seen corresponding path program 1 times [2021-12-18 20:55:39,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:39,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276315798] [2021-12-18 20:55:39,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:39,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:39,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:39,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:39,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 20:55:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:39,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 20:55:39,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:55:39,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:55:39,367 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:55:39,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276315798] [2021-12-18 20:55:39,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276315798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:55:39,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:55:39,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:55:39,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115511091] [2021-12-18 20:55:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:55:39,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:55:39,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:55:39,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:55:39,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:55:39,368 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:39,476 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2021-12-18 20:55:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:55:39,477 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-18 20:55:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:39,477 INFO L225 Difference]: With dead ends: 74 [2021-12-18 20:55:39,477 INFO L226 Difference]: Without dead ends: 74 [2021-12-18 20:55:39,478 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:55:39,478 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 113 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:39,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 34 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 20:55:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-12-18 20:55:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2021-12-18 20:55:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2021-12-18 20:55:39,482 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 20 [2021-12-18 20:55:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:39,482 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2021-12-18 20:55:39,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2021-12-18 20:55:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:55:39,483 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:39,483 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:39,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:39,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:55:39,696 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:39,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:39,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1924507721, now seen corresponding path program 1 times [2021-12-18 20:55:39,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:39,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327382050] [2021-12-18 20:55:39,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:39,697 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:39,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:39,698 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:39,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 20:55:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:39,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 20:55:39,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:39,809 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:55:39,864 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:55:39,865 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:55:39,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:55:39,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:39,945 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:40,085 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:55:40,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-18 20:55:40,095 INFO L388 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 7 treesize of output 3 [2021-12-18 20:55:40,115 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:55:40,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2021-12-18 20:55:40,164 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:55:40,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:55:40,183 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:55:40,288 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 13 [2021-12-18 20:55:40,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:55:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:40,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:55:40,688 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_185 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2021-12-18 20:55:40,738 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_184) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (forall ((v_ArrVal_185 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))) is different from false [2021-12-18 20:55:40,763 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_184 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)))) (.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_185) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_184) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) (forall ((v_ArrVal_185 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32))) v_ArrVal_185) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse2 (bvadd .cse2 (_ bv4 32)))))) is different from false [2021-12-18 20:55:40,783 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:40,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2021-12-18 20:55:40,798 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:40,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2021-12-18 20:55:40,813 INFO L388 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 17 treesize of output 9 [2021-12-18 20:55:40,866 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:40,866 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2021-12-18 20:55:40,875 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:40,875 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:55:40,877 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:55:40,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:55:40,881 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2021-12-18 20:55:40,883 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:55:40,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:55:40,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2021-12-18 20:55:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-18 20:55:41,104 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:55:41,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327382050] [2021-12-18 20:55:41,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327382050] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:55:41,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:55:41,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-12-18 20:55:41,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379487804] [2021-12-18 20:55:41,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:55:41,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 20:55:41,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:55:41,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 20:55:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=260, Unknown=3, NotChecked=102, Total=420 [2021-12-18 20:55:41,105 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:43,742 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 20:55:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:55:49,497 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2021-12-18 20:55:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-18 20:55:49,498 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:55:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:55:49,499 INFO L225 Difference]: With dead ends: 127 [2021-12-18 20:55:49,499 INFO L226 Difference]: Without dead ends: 127 [2021-12-18 20:55:49,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=177, Invalid=700, Unknown=5, NotChecked=174, Total=1056 [2021-12-18 20:55:49,500 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 125 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:55:49,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 296 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 540 Invalid, 1 Unknown, 358 Unchecked, 3.4s Time] [2021-12-18 20:55:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-18 20:55:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 74. [2021-12-18 20:55:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 73 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:49,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-12-18 20:55:49,502 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 22 [2021-12-18 20:55:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:55:49,503 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-12-18 20:55:49,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.05) internal successors, (41), 21 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:55:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-12-18 20:55:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:55:49,503 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:55:49,504 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:55:49,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 20:55:49,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:55:49,714 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:55:49,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:55:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1924507722, now seen corresponding path program 1 times [2021-12-18 20:55:49,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:55:49,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439724517] [2021-12-18 20:55:49,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:55:49,715 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:55:49,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:55:49,716 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:55:49,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 20:55:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:55:49,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 20:55:49,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:55:49,829 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-18 20:55:49,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-18 20:55:49,959 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-18 20:55:49,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 47 [2021-12-18 20:55:50,049 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:55:50,242 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:55:50,242 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 56 [2021-12-18 20:55:50,303 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:55:50,303 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2021-12-18 20:55:50,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 30 [2021-12-18 20:55:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:55:50,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:55:50,767 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2021-12-18 20:55:50,785 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2021-12-18 20:55:50,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_219 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32))) v_ArrVal_219) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2021-12-18 20:55:50,804 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:50,804 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-18 20:55:50,812 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:55:50,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 47 [2021-12-18 20:55:50,817 INFO L388 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 15 treesize of output 11 [2021-12-18 20:56:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-18 20:56:10,849 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:56:10,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439724517] [2021-12-18 20:56:10,855 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439724517] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:56:10,855 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:56:10,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2021-12-18 20:56:10,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048930220] [2021-12-18 20:56:10,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:56:10,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-18 20:56:10,856 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:56:10,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-18 20:56:10,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=308, Unknown=8, NotChecked=114, Total=506 [2021-12-18 20:56:10,857 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:56:12,805 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2021-12-18 20:56:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-18 20:56:12,805 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:56:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:56:12,806 INFO L225 Difference]: With dead ends: 112 [2021-12-18 20:56:12,806 INFO L226 Difference]: Without dead ends: 112 [2021-12-18 20:56:12,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=180, Invalid=694, Unknown=8, NotChecked=174, Total=1056 [2021-12-18 20:56:12,807 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 124 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:56:12,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 175 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 212 Invalid, 0 Unknown, 402 Unchecked, 1.5s Time] [2021-12-18 20:56:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-18 20:56:12,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 73. [2021-12-18 20:56:12,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.234375) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2021-12-18 20:56:12,810 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 22 [2021-12-18 20:56:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:56:12,810 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2021-12-18 20:56:12,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2021-12-18 20:56:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 20:56:12,811 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:56:12,811 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:56:12,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 20:56:13,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:56:13,021 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:56:13,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:56:13,021 INFO L85 PathProgramCache]: Analyzing trace with hash -145669177, now seen corresponding path program 1 times [2021-12-18 20:56:13,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:56:13,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859193747] [2021-12-18 20:56:13,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:56:13,022 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:56:13,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:56:13,023 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:56:13,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 20:56:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:56:13,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-18 20:56:13,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:56:13,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:56:13,130 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:56:13,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-12-18 20:56:13,216 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2021-12-18 20:56:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:56:13,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:56:13,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 35 treesize of output 29 [2021-12-18 20:56:13,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:56:13,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:56:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:56:13,382 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:56:13,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859193747] [2021-12-18 20:56:13,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859193747] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:56:13,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:56:13,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2021-12-18 20:56:13,383 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868596698] [2021-12-18 20:56:13,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:56:13,383 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:56:13,383 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:56:13,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:56:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:56:13,384 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:56:13,890 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2021-12-18 20:56:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 20:56:13,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-18 20:56:13,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:56:13,891 INFO L225 Difference]: With dead ends: 91 [2021-12-18 20:56:13,891 INFO L226 Difference]: Without dead ends: 91 [2021-12-18 20:56:13,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2021-12-18 20:56:13,892 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 48 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:56:13,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 131 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:56:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-18 20:56:13,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2021-12-18 20:56:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-12-18 20:56:13,894 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 23 [2021-12-18 20:56:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:56:13,895 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-12-18 20:56:13,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:13,895 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-12-18 20:56:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 20:56:13,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:56:13,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:56:13,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 20:56:14,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:56:14,099 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:56:14,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:56:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash -220778635, now seen corresponding path program 1 times [2021-12-18 20:56:14,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:56:14,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642695601] [2021-12-18 20:56:14,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:56:14,101 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:56:14,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:56:14,102 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:56:14,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 20:56:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:56:14,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 20:56:14,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:56:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:56:14,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:56:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 20:56:16,488 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:56:16,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642695601] [2021-12-18 20:56:16,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642695601] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:56:16,489 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:56:16,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-18 20:56:16,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959172019] [2021-12-18 20:56:16,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:56:16,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 20:56:16,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:56:16,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 20:56:16,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-12-18 20:56:16,490 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:16,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:56:16,516 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2021-12-18 20:56:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:56:16,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-18 20:56:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:56:16,517 INFO L225 Difference]: With dead ends: 83 [2021-12-18 20:56:16,517 INFO L226 Difference]: Without dead ends: 64 [2021-12-18 20:56:16,517 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-12-18 20:56:16,517 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:56:16,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 94 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 46 Unchecked, 0.0s Time] [2021-12-18 20:56:16,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-12-18 20:56:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-12-18 20:56:16,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 63 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:16,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2021-12-18 20:56:16,520 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 24 [2021-12-18 20:56:16,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:56:16,520 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2021-12-18 20:56:16,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:16,520 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2021-12-18 20:56:16,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-18 20:56:16,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:56:16,520 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:56:16,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 20:56:16,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:56:16,721 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:56:16,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:56:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1678984919, now seen corresponding path program 1 times [2021-12-18 20:56:16,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:56:16,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639139872] [2021-12-18 20:56:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:56:16,722 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:56:16,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:56:16,723 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:56:16,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 20:56:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:56:16,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-18 20:56:16,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:56:16,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:56:16,887 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:56:16,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:56:16,916 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:56:16,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:56:17,060 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:56:17,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-12-18 20:56:17,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:56:17,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:56:17,076 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 20:56:17,133 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:56:17,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 80 [2021-12-18 20:56:17,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:56:17,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2021-12-18 20:56:17,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2021-12-18 20:56:17,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 39 treesize of output 21 [2021-12-18 20:56:17,241 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-12-18 20:56:17,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2021-12-18 20:56:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:56:17,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:56:17,499 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_293 (_ BitVec 32)) (v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)) v_ArrVal_293)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (_ bv1 32))) is different from false [2021-12-18 20:56:17,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 204 treesize of output 182 [2021-12-18 20:56:17,666 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (or (and (= .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~p~0#1.base|))) (= .cse0 (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)))))) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (or (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~p~0#1.base|))) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)))))) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_~p~0#1.base|))) is different from false [2021-12-18 20:56:17,780 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_#t~mem6#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (or (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_#t~mem6#1.base|))) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (bvadd |c_ULTIMATE.start_main_#t~mem6#1.offset| (_ bv4 32)))))) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (or (= .cse0 (bvadd |c_ULTIMATE.start_main_#t~mem6#1.offset| (_ bv4 32))) (and (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_#t~mem6#1.base|)) (= .cse0 |c_ULTIMATE.start_main_#t~mem6#1.offset|))))) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) |c_ULTIMATE.start_main_#t~mem6#1.offset|))) is different from false [2021-12-18 20:56:17,860 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3) v_ArrVal_292) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse3))) (or (= .cse0 (bvadd .cse1 (_ bv4 32))) (and (= .cse0 .cse1) (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32))))) (= (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) .cse2)))))))) (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4) v_ArrVal_292) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4)))) (or (forall ((v_ArrVal_292 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5) v_ArrVal_292) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5) (_ bv4 32)))))) (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32))))) (= (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) .cse6))))) (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32))))) (= (select (select (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_295) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))) .cse7)))) is different from false [2021-12-18 20:56:17,890 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:17,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2021-12-18 20:56:17,902 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:17,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2021-12-18 20:56:17,907 INFO L388 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 11 treesize of output 7 [2021-12-18 20:56:17,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:56:17,933 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:56:17,941 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 20:56:17,941 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 1 [2021-12-18 20:56:17,949 INFO L354 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-18 20:56:17,950 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 13 [2021-12-18 20:56:17,952 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:56:17,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2021-12-18 20:56:17,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:56:17,957 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:56:17,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:56:17,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 6 [2021-12-18 20:56:17,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:56:17,977 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:56:17,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:56:17,981 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2021-12-18 20:56:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-18 20:56:18,123 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:56:18,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639139872] [2021-12-18 20:56:18,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639139872] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:56:18,124 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:56:18,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2021-12-18 20:56:18,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233150517] [2021-12-18 20:56:18,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:56:18,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-18 20:56:18,124 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:56:18,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-18 20:56:18,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=337, Unknown=4, NotChecked=156, Total=552 [2021-12-18 20:56:18,126 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:56:27,455 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2021-12-18 20:56:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 20:56:27,456 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-12-18 20:56:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:56:27,456 INFO L225 Difference]: With dead ends: 108 [2021-12-18 20:56:27,456 INFO L226 Difference]: Without dead ends: 108 [2021-12-18 20:56:27,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=157, Invalid=785, Unknown=4, NotChecked=244, Total=1190 [2021-12-18 20:56:27,457 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 147 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 20:56:27,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 220 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 558 Invalid, 0 Unknown, 369 Unchecked, 0.8s Time] [2021-12-18 20:56:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-12-18 20:56:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 66. [2021-12-18 20:56:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:27,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2021-12-18 20:56:27,460 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 24 [2021-12-18 20:56:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:56:27,460 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2021-12-18 20:56:27,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2021-12-18 20:56:27,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 20:56:27,460 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:56:27,460 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:56:27,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 20:56:27,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:56:27,661 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:56:27,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:56:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1242121411, now seen corresponding path program 2 times [2021-12-18 20:56:27,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:56:27,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4587646] [2021-12-18 20:56:27,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:56:27,662 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:56:27,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:56:27,663 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:56:27,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 20:56:27,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:56:27,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:56:27,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 20:56:27,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:56:27,781 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:56:27,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 20:56:27,856 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:56:27,856 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:56:27,898 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:56:27,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:56:27,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 20:56:27,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 treesize of output 8 [2021-12-18 20:56:28,001 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:56:28,021 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:56:28,021 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:56:28,063 INFO L388 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 13 treesize of output 9 [2021-12-18 20:56:28,070 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:56:28,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2021-12-18 20:56:28,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:56:28,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:56:28,199 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2021-12-18 20:56:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:56:28,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:56:28,260 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32))) is different from false [2021-12-18 20:56:28,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32))) is different from false [2021-12-18 20:56:28,276 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32))) v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32))) is different from false [2021-12-18 20:56:28,282 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_346) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32))) is different from false [2021-12-18 20:56:28,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_27|))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_346) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-18 20:56:28,389 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_27|))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_346) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-18 20:56:28,406 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_27|))) (= (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32))) v_ArrVal_346) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-18 20:56:28,435 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 20:56:28,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 14 [2021-12-18 20:56:28,451 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~p~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_27|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)) v_ArrVal_342)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_346) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32)))) is different from false [2021-12-18 20:56:28,522 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~t~0#1.base_28| (_ BitVec 32))) (or (forall ((v_ArrVal_346 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_350 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_342 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1.base_27| (_ BitVec 32))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)) v_ArrVal_342)) |v_ULTIMATE.start_main_~t~0#1.base_28| v_ArrVal_346) |v_ULTIMATE.start_main_~t~0#1.base_27| v_ArrVal_350) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (_ bv0 32)) (= |c_ULTIMATE.start_main_~p~0#1.base| |v_ULTIMATE.start_main_~t~0#1.base_27|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_28|))))) is different from false [2021-12-18 20:56:28,552 INFO L354 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2021-12-18 20:56:28,553 INFO L388 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2021-12-18 20:56:28,563 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:28,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 63 [2021-12-18 20:56:28,568 INFO L388 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 48 treesize of output 44 [2021-12-18 20:56:28,572 INFO L388 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 22 treesize of output 20 [2021-12-18 20:56:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2021-12-18 20:56:28,779 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:56:28,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4587646] [2021-12-18 20:56:28,779 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4587646] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:56:28,779 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:56:28,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2021-12-18 20:56:28,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452126873] [2021-12-18 20:56:28,779 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:56:28,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-18 20:56:28,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:56:28,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-18 20:56:28,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=325, Unknown=11, NotChecked=396, Total=812 [2021-12-18 20:56:28,781 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:56:29,659 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2021-12-18 20:56:29,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 20:56:29,659 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 20:56:29,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:56:29,660 INFO L225 Difference]: With dead ends: 117 [2021-12-18 20:56:29,660 INFO L226 Difference]: Without dead ends: 117 [2021-12-18 20:56:29,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=923, Unknown=11, NotChecked=648, Total=1806 [2021-12-18 20:56:29,661 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 70 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 724 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:56:29,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 256 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 338 Invalid, 0 Unknown, 724 Unchecked, 0.4s Time] [2021-12-18 20:56:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-18 20:56:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 77. [2021-12-18 20:56:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 76 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:29,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2021-12-18 20:56:29,664 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 26 [2021-12-18 20:56:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:56:29,664 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2021-12-18 20:56:29,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:56:29,665 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2021-12-18 20:56:29,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 20:56:29,665 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:56:29,665 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:56:29,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-18 20:56:29,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:56:29,871 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:56:29,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:56:29,872 INFO L85 PathProgramCache]: Analyzing trace with hash -544564775, now seen corresponding path program 2 times [2021-12-18 20:56:29,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:56:29,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928530605] [2021-12-18 20:56:29,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:56:29,872 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:56:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:56:29,873 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:56:29,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 20:56:29,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:56:29,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:56:29,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 36 conjunts are in the unsatisfiable core [2021-12-18 20:56:29,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:56:29,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:56:30,042 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:56:30,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:56:30,076 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:56:30,086 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:56:30,218 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:56:30,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2021-12-18 20:56:30,224 INFO L388 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 15 treesize of output 7 [2021-12-18 20:56:30,250 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:56:30,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2021-12-18 20:56:30,284 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:56:30,295 INFO L354 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2021-12-18 20:56:30,295 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 51 [2021-12-18 20:56:30,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2021-12-18 20:56:30,589 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:56:30,592 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 20:56:30,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2021-12-18 20:56:30,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2021-12-18 20:56:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:56:30,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:56:31,138 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:31,139 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2021-12-18 20:56:31,144 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:31,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2021-12-18 20:56:31,189 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:31,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2021-12-18 20:56:31,198 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:31,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2021-12-18 20:56:32,299 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:32,299 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2021-12-18 20:56:32,313 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:32,313 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2021-12-18 20:56:32,331 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:32,331 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 75 [2021-12-18 20:56:32,756 INFO L354 Elim1Store]: treesize reduction 62, result has 75.6 percent of original size [2021-12-18 20:56:32,756 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 335 [2021-12-18 20:56:32,844 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:32,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 238 treesize of output 256 [2021-12-18 20:56:32,889 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:56:32,890 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 135 [2021-12-18 20:57:21,464 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:57:21,465 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2021-12-18 20:57:21,511 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:57:21,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2021-12-18 20:57:39,776 WARN L227 SmtUtils]: Spent 18.25s on a formula simplification. DAG size of input: 51 DAG size of output: 39 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-18 20:57:39,777 INFO L354 Elim1Store]: treesize reduction 79, result has 40.2 percent of original size [2021-12-18 20:57:39,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 136 [2021-12-18 20:57:41,224 INFO L354 Elim1Store]: treesize reduction 12, result has 20.0 percent of original size [2021-12-18 20:57:41,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 89 [2021-12-18 20:57:41,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:57:41,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 78 [2021-12-18 20:57:41,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:57:41,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:57:41,247 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:57:41,247 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 116 [2021-12-18 20:57:45,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:57:45,639 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:57:45,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928530605] [2021-12-18 20:57:45,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928530605] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:57:45,639 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:57:45,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2021-12-18 20:57:45,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097625554] [2021-12-18 20:57:45,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:57:45,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-18 20:57:45,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:57:45,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-18 20:57:45,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=511, Unknown=27, NotChecked=0, Total=600 [2021-12-18 20:57:45,640 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:57:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:57:46,577 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2021-12-18 20:57:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 20:57:46,578 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 20:57:46,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:57:46,578 INFO L225 Difference]: With dead ends: 86 [2021-12-18 20:57:46,578 INFO L226 Difference]: Without dead ends: 86 [2021-12-18 20:57:46,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=148, Invalid=871, Unknown=37, NotChecked=0, Total=1056 [2021-12-18 20:57:46,579 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 104 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:57:46,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 321 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 286 Invalid, 0 Unknown, 158 Unchecked, 0.4s Time] [2021-12-18 20:57:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2021-12-18 20:57:46,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2021-12-18 20:57:46,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 81 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:57:46,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2021-12-18 20:57:46,582 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 27 [2021-12-18 20:57:46,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:57:46,582 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2021-12-18 20:57:46,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:57:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2021-12-18 20:57:46,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 20:57:46,583 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:57:46,583 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:57:46,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-18 20:57:46,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:57:46,787 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 17 more)] === [2021-12-18 20:57:46,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:57:46,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1394424723, now seen corresponding path program 3 times [2021-12-18 20:57:46,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:57:46,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055538172] [2021-12-18 20:57:46,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 20:57:46,788 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:57:46,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:57:46,789 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:57:46,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 20:57:46,916 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-18 20:57:46,916 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:57:46,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-18 20:57:46,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:57:46,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:57:46,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:57:46,980 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:57:46,980 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:57:47,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:57:47,029 INFO L388 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 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:57:47,151 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:57:47,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-18 20:57:47,155 INFO L388 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 7 treesize of output 3 [2021-12-18 20:57:47,176 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:57:47,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2021-12-18 20:57:47,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:57:47,251 INFO L354 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2021-12-18 20:57:47,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 22 [2021-12-18 20:57:47,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2021-12-18 20:57:47,325 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:57:47,325 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-18 20:57:47,343 INFO L388 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 7 treesize of output 3 [2021-12-18 20:57:47,371 INFO L354 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2021-12-18 20:57:47,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2021-12-18 20:57:47,575 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:57:47,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2021-12-18 20:57:47,583 INFO L388 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 7 treesize of output 3 [2021-12-18 20:57:47,610 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-18 20:57:47,610 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 67 [2021-12-18 20:57:47,682 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-12-18 20:57:47,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 77 [2021-12-18 20:57:47,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-12-18 20:57:47,867 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-18 20:57:47,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 24 [2021-12-18 20:57:47,874 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:57:47,942 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:57:47,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:57:48,280 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_446) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2021-12-18 20:57:48,324 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_446) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem6#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))) is different from false [2021-12-18 20:57:48,355 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32))) v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |c_ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)))) (.cse2 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_446) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)))))) is different from false [2021-12-18 20:57:48,450 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~p~0#1.offset| (_ BitVec 32)) (v_ArrVal_446 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_443) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (bvadd |ULTIMATE.start_main_~p~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_446) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) (forall ((v_ArrVal_443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_447 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_443) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_447) |c_ULTIMATE.start_main_~a~0#1.base|) (bvadd |c_ULTIMATE.start_main_~a~0#1.offset| (_ bv4 32))))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))) is different from false [2021-12-18 20:57:48,834 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:57:48,834 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 73 [2021-12-18 20:57:48,868 INFO L388 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 48 treesize of output 36 [2021-12-18 20:57:51,318 INFO L388 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 48 treesize of output 36 [2021-12-18 20:57:51,590 INFO L388 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 48 treesize of output 36 [2021-12-18 20:57:52,262 INFO L388 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 60 treesize of output 48 [2021-12-18 20:57:54,925 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:57:54,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 105 [2021-12-18 20:57:54,976 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:57:54,976 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 105 [2021-12-18 20:57:55,091 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:57:55,091 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 429 treesize of output 426 [2021-12-18 20:57:55,261 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:57:55,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2459 treesize of output 2348 [2021-12-18 20:57:55,374 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:57:55,375 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2358 treesize of output 1806 [2021-12-18 20:57:55,622 INFO L354 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2021-12-18 20:57:55,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1822 treesize of output 1822 [2021-12-18 20:57:55,673 INFO L388 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 1749 treesize of output 1685 [2021-12-18 20:57:55,705 INFO L388 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 1685 treesize of output 1557 [2021-12-18 20:57:55,738 INFO L388 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 1557 treesize of output 1429 [2021-12-18 20:57:55,770 INFO L388 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 1429 treesize of output 1413 [2021-12-18 20:57:55,802 INFO L388 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 1413 treesize of output 1381 [2021-12-18 20:57:55,815 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:57:55,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2055538172] [2021-12-18 20:57:55,815 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 20:57:55,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [282135264] [2021-12-18 20:57:55,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 20:57:55,816 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 20:57:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 20:57:55,820 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 20:57:55,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-12-18 20:57:56,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-18 20:57:56,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:57:56,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 49 conjunts are in the unsatisfiable core [2021-12-18 20:57:56,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:57:57,078 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 20:57:57,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:57:57,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:57:59,595 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:57:59,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2021-12-18 20:57:59,631 INFO L388 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 15 treesize of output 7 [2021-12-18 20:57:59,945 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:57:59,945 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2021-12-18 20:58:00,023 INFO L388 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 17 treesize of output 9 [2021-12-18 20:58:01,257 INFO L354 Elim1Store]: treesize reduction 36, result has 53.2 percent of original size [2021-12-18 20:58:01,258 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 67 [2021-12-18 20:58:01,529 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:58:01,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 20:58:02,729 INFO L354 Elim1Store]: treesize reduction 31, result has 29.5 percent of original size [2021-12-18 20:58:02,729 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2021-12-18 20:58:02,863 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:58:02,990 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-18 20:58:02,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2021-12-18 20:58:06,687 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-12-18 20:58:06,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 117 [2021-12-18 20:58:07,034 INFO L354 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2021-12-18 20:58:07,034 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 111 [2021-12-18 20:58:07,315 INFO L388 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 17 [2021-12-18 20:58:07,630 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-12-18 20:58:08,240 INFO L388 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 72 treesize of output 44 [2021-12-18 20:58:08,384 INFO L388 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 19 treesize of output 13 [2021-12-18 20:58:08,768 INFO L388 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 7 treesize of output 3 [2021-12-18 20:58:09,241 INFO L388 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 7 treesize of output 3 [2021-12-18 20:58:11,209 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:58:12,127 INFO L354 Elim1Store]: treesize reduction 147, result has 37.2 percent of original size [2021-12-18 20:58:12,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 203 treesize of output 241 [2021-12-18 20:58:12,145 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:58:13,021 INFO L354 Elim1Store]: treesize reduction 129, result has 32.8 percent of original size [2021-12-18 20:58:13,022 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 254 treesize of output 225 [2021-12-18 20:58:29,576 INFO L354 Elim1Store]: treesize reduction 14, result has 82.3 percent of original size [2021-12-18 20:58:29,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 163 [2021-12-18 20:58:30,348 INFO L354 Elim1Store]: treesize reduction 8, result has 86.9 percent of original size [2021-12-18 20:58:30,348 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 181 [2021-12-18 20:58:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:58:40,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:58:46,619 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:58:46,619 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 103 [2021-12-18 20:58:46,656 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:58:46,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 83 [2021-12-18 20:58:46,731 INFO L388 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 8 treesize of output 4 [2021-12-18 20:58:48,477 INFO L388 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 8 treesize of output 4 [2021-12-18 20:58:51,775 INFO L388 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 8 treesize of output 4 [2021-12-18 20:58:53,816 INFO L388 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 8 treesize of output 4 [2021-12-18 20:58:54,129 INFO L388 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 8 treesize of output 4 [2021-12-18 20:58:56,090 INFO L388 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 8 treesize of output 4 [2021-12-18 20:58:56,728 INFO L388 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 8 treesize of output 4 [2021-12-18 20:58:58,581 INFO L388 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 14 treesize of output 4 [2021-12-18 20:58:59,619 INFO L388 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 14 treesize of output 4 [2021-12-18 20:59:00,273 INFO L388 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 14 treesize of output 4 [2021-12-18 20:59:02,920 INFO L388 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 8 treesize of output 4 [2021-12-18 20:59:05,297 INFO L388 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 8 treesize of output 4 [2021-12-18 20:59:07,293 INFO L388 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 8 treesize of output 4 [2021-12-18 20:59:09,700 INFO L388 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 8 treesize of output 4 [2021-12-18 20:59:19,306 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:59:19,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 124 [2021-12-18 20:59:19,356 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:59:19,356 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 132 [2021-12-18 20:59:19,495 INFO L354 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2021-12-18 20:59:19,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2021-12-18 20:59:21,399 INFO L388 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 64 treesize of output 48 [2021-12-18 20:59:24,358 INFO L388 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 45 treesize of output 33 Killed by 15