./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-properties/simple_built_from_end.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-properties/simple_built_from_end.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:51:52,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:51:52,392 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:51:52,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:51:52,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:51:52,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:51:52,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:51:52,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:51:52,423 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:51:52,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:51:52,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:51:52,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:51:52,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:51:52,432 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:51:52,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:51:52,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:51:52,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:51:52,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:51:52,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:51:52,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:51:52,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:51:52,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:51:52,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:51:52,443 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:51:52,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:51:52,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:51:52,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:51:52,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:51:52,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:51:52,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:51:52,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:51:52,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:51:52,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:51:52,455 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:51:52,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:51:52,456 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:51:52,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:51:52,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:51:52,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:51:52,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:51:52,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:51:52,459 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:51:52,484 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:51:52,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:51:52,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:51:52,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:51:52,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:51:52,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:51:52,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:51:52,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:51:52,486 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:51:52,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:51:52,487 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:51:52,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:51:52,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:51:52,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:51:52,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:51:52,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:51:52,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:51:52,488 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:51:52,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:51:52,488 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:51:52,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:51:52,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:51:52,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:51:52,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:51:52,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:51:52,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:51:52,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:51:52,490 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:51:52,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:51:52,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:51:52,490 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:51:52,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:51:52,490 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:51:52,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:51:52,491 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:51:52,491 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! call(reach_error())) ) 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 -> 0eb3d3e07cae1efa9dc9af5091aea6a309746434756c62bcf3ece83b84aec27a [2023-02-16 00:51:52,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:51:52,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:51:52,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:51:52,738 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:51:52,738 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:51:52,739 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/simple_built_from_end.i [2023-02-16 00:51:53,728 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:51:53,937 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:51:53,939 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/simple_built_from_end.i [2023-02-16 00:51:53,950 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f21de3b4/dffae7a58ed44751bf41a8498966d3bd/FLAG27526f49e [2023-02-16 00:51:53,960 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f21de3b4/dffae7a58ed44751bf41a8498966d3bd [2023-02-16 00:51:53,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:51:53,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:51:53,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:51:53,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:51:53,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:51:53,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:51:53" (1/1) ... [2023-02-16 00:51:53,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@257935ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:53, skipping insertion in model container [2023-02-16 00:51:53,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:51:53" (1/1) ... [2023-02-16 00:51:53,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:51:54,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:51:54,250 WARN L237 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-properties/simple_built_from_end.i[23125,23138] [2023-02-16 00:51:54,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:51:54,260 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:51:54,288 WARN L237 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-properties/simple_built_from_end.i[23125,23138] [2023-02-16 00:51:54,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:51:54,306 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:51:54,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54 WrapperNode [2023-02-16 00:51:54,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:51:54,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:51:54,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:51:54,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:51:54,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,342 INFO L138 Inliner]: procedures = 124, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2023-02-16 00:51:54,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:51:54,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:51:54,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:51:54,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:51:54,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,365 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:51:54,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:51:54,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:51:54,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:51:54,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (1/1) ... [2023-02-16 00:51:54,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:51:54,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:51:54,438 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) [2023-02-16 00:51:54,440 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 [2023-02-16 00:51:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:51:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:51:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 00:51:54,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:51:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 00:51:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 00:51:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:51:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:51:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:51:54,627 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:51:54,629 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:51:54,693 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:51:54,701 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:51:54,702 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 00:51:54,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:51:54 BoogieIcfgContainer [2023-02-16 00:51:54,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:51:54,705 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:51:54,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:51:54,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:51:54,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:51:53" (1/3) ... [2023-02-16 00:51:54,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ceab31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:51:54, skipping insertion in model container [2023-02-16 00:51:54,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:51:54" (2/3) ... [2023-02-16 00:51:54,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ceab31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:51:54, skipping insertion in model container [2023-02-16 00:51:54,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:51:54" (3/3) ... [2023-02-16 00:51:54,710 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.i [2023-02-16 00:51:54,722 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:51:54,723 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:51:54,767 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:51:54,774 INFO L357 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72477d87, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:51:54,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:51:54,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 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) [2023-02-16 00:51:54,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 00:51:54,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:51:54,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 00:51:54,810 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:51:54,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:51:54,814 INFO L85 PathProgramCache]: Analyzing trace with hash 890037006, now seen corresponding path program 1 times [2023-02-16 00:51:54,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:51:54,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117514391] [2023-02-16 00:51:54,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:51:54,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:51:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:51:54,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:51:54,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:51:54,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117514391] [2023-02-16 00:51:54,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117514391] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:51:54,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:51:54,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 00:51:54,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867075892] [2023-02-16 00:51:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:51:54,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 00:51:54,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:51:55,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 00:51:55,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 00:51:55,028 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 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) 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) [2023-02-16 00:51:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:51:55,039 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2023-02-16 00:51:55,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 00:51:55,040 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 [2023-02-16 00:51:55,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:51:55,046 INFO L225 Difference]: With dead ends: 23 [2023-02-16 00:51:55,046 INFO L226 Difference]: Without dead ends: 11 [2023-02-16 00:51:55,048 INFO L412 NwaCegarLoop]: 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 [2023-02-16 00:51:55,051 INFO L413 NwaCegarLoop]: 17 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, 17 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 [2023-02-16 00:51:55,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:51:55,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-02-16 00:51:55,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-02-16 00:51:55,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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) [2023-02-16 00:51:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-02-16 00:51:55,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2023-02-16 00:51:55,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:51:55,077 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-02-16 00:51:55,077 INFO L496 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) [2023-02-16 00:51:55,078 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-02-16 00:51:55,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 00:51:55,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:51:55,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:51:55,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:51:55,079 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:51:55,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:51:55,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1806862075, now seen corresponding path program 1 times [2023-02-16 00:51:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:51:55,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436072376] [2023-02-16 00:51:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:51:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:51:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:51:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:51:55,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:51:55,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436072376] [2023-02-16 00:51:55,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436072376] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:51:55,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:51:55,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:51:55,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846011243] [2023-02-16 00:51:55,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:51:55,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:51:55,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:51:55,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:51:55,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:51:55,186 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-02-16 00:51:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:51:55,218 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2023-02-16 00:51:55,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:51:55,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2023-02-16 00:51:55,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:51:55,220 INFO L225 Difference]: With dead ends: 21 [2023-02-16 00:51:55,220 INFO L226 Difference]: Without dead ends: 15 [2023-02-16 00:51:55,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:51:55,225 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:51:55,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:51:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-02-16 00:51:55,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2023-02-16 00:51:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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) [2023-02-16 00:51:55,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-02-16 00:51:55,232 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 7 [2023-02-16 00:51:55,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:51:55,233 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-02-16 00:51:55,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-02-16 00:51:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-02-16 00:51:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 00:51:55,234 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:51:55,235 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:51:55,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 00:51:55,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:51:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:51:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1217762572, now seen corresponding path program 1 times [2023-02-16 00:51:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:51:55,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874342167] [2023-02-16 00:51:55,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:51:55,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:51:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:51:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:51:55,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:51:55,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874342167] [2023-02-16 00:51:55,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874342167] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:51:55,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:51:55,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:51:55,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734302206] [2023-02-16 00:51:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:51:55,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:51:55,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:51:55,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:51:55,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:51:55,457 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2023-02-16 00:51:55,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:51:55,492 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2023-02-16 00:51:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:51:55,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2023-02-16 00:51:55,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:51:55,493 INFO L225 Difference]: With dead ends: 20 [2023-02-16 00:51:55,493 INFO L226 Difference]: Without dead ends: 18 [2023-02-16 00:51:55,493 INFO L412 NwaCegarLoop]: 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 [2023-02-16 00:51:55,494 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:51:55,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:51:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-16 00:51:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2023-02-16 00:51:55,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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) [2023-02-16 00:51:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-02-16 00:51:55,501 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2023-02-16 00:51:55,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:51:55,502 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-02-16 00:51:55,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2023-02-16 00:51:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-02-16 00:51:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 00:51:55,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:51:55,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:51:55,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 00:51:55,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:51:55,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:51:55,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1228764301, now seen corresponding path program 1 times [2023-02-16 00:51:55,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:51:55,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105746894] [2023-02-16 00:51:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:51:55,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:51:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:51:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:51:55,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:51:55,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105746894] [2023-02-16 00:51:55,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105746894] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:51:55,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888053511] [2023-02-16 00:51:55,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:51:55,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:51:55,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:51:55,696 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) [2023-02-16 00:51:55,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:51:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:51:55,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 00:51:55,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:51:55,818 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:55,823 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:55,874 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:55,877 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:51:55,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:51:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:51:55,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888053511] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:51:55,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:51:55,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 6 [2023-02-16 00:51:55,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313291788] [2023-02-16 00:51:55,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:51:55,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:51:55,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:51:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:51:55,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:51:55,935 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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) [2023-02-16 00:51:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:51:55,969 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-02-16 00:51:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 00:51:55,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 14 [2023-02-16 00:51:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:51:55,969 INFO L225 Difference]: With dead ends: 30 [2023-02-16 00:51:55,969 INFO L226 Difference]: Without dead ends: 21 [2023-02-16 00:51:55,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:51:55,970 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:51:55,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 40 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:51:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-02-16 00:51:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2023-02-16 00:51:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 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) [2023-02-16 00:51:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2023-02-16 00:51:55,973 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2023-02-16 00:51:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:51:55,973 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2023-02-16 00:51:55,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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) [2023-02-16 00:51:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2023-02-16 00:51:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-16 00:51:55,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:51:55,974 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:51:55,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 00:51:56,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:51:56,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:51:56,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:51:56,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1718933108, now seen corresponding path program 2 times [2023-02-16 00:51:56,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:51:56,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286361402] [2023-02-16 00:51:56,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:51:56,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:51:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:51:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:51:56,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:51:56,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286361402] [2023-02-16 00:51:56,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286361402] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:51:56,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22258094] [2023-02-16 00:51:56,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:51:56,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:51:56,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:51:56,448 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) [2023-02-16 00:51:56,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:51:56,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:51:56,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:51:56,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-16 00:51:56,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:51:56,516 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:56,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:51:56,529 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2023-02-16 00:51:56,545 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 00:51:56,546 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:56,570 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:56,574 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-02-16 00:51:56,579 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:56,622 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:56,626 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 15 [2023-02-16 00:51:56,635 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:51:56,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:51:56,672 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_102 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_102) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) is different from false [2023-02-16 00:51:56,708 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:51:56,708 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:56,712 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 22 [2023-02-16 00:51:56,714 INFO L350 Elim1Store]: Elim1 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 5 treesize of output 3 [2023-02-16 00:51:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 00:51:56,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22258094] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:51:56,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:51:56,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-16 00:51:56,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392332671] [2023-02-16 00:51:56,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:51:56,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:51:56,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:51:56,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:51:56,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2023-02-16 00:51:56,728 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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) [2023-02-16 00:51:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:51:56,898 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-02-16 00:51:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 00:51:56,898 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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 18 [2023-02-16 00:51:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:51:56,899 INFO L225 Difference]: With dead ends: 27 [2023-02-16 00:51:56,899 INFO L226 Difference]: Without dead ends: 25 [2023-02-16 00:51:56,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=269, Unknown=1, NotChecked=36, Total=420 [2023-02-16 00:51:56,900 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:51:56,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2023-02-16 00:51:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-16 00:51:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2023-02-16 00:51:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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) [2023-02-16 00:51:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2023-02-16 00:51:56,904 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2023-02-16 00:51:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:51:56,904 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2023-02-16 00:51:56,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 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) [2023-02-16 00:51:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2023-02-16 00:51:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 00:51:56,905 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:51:56,905 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-16 00:51:56,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 00:51:57,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:51:57,110 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:51:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:51:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash -154052339, now seen corresponding path program 3 times [2023-02-16 00:51:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:51:57,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969077272] [2023-02-16 00:51:57,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:51:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:51:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:51:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:51:57,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:51:57,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969077272] [2023-02-16 00:51:57,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969077272] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:51:57,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528483649] [2023-02-16 00:51:57,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:51:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:51:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:51:57,505 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) [2023-02-16 00:51:57,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:51:57,574 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-16 00:51:57,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:51:57,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-16 00:51:57,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:51:57,590 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:57,604 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:57,609 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:57,630 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 00:51:57,631 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:57,665 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:51:57,668 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:51:57,672 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:57,676 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:57,768 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:51:57,772 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2023-02-16 00:51:57,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2023-02-16 00:51:57,780 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 00:51:57,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-02-16 00:51:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:51:57,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:51:57,834 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:51:57,834 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-16 00:51:57,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:51:57,841 INFO L350 Elim1Store]: Elim1 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 17 treesize of output 21 [2023-02-16 00:51:57,847 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_5 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_5) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) 0) (not (= (select v_arrayElimArr_5 .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (not (= (select v_arrayElimArr_4 .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) 0))))) is different from false [2023-02-16 00:51:57,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:51:57,917 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:57,921 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 24 [2023-02-16 00:51:57,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:51:57,927 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-16 00:51:57,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:51:57,955 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:51:57,959 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 24 [2023-02-16 00:51:57,965 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:51:57,966 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 20 [2023-02-16 00:51:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 00:51:58,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528483649] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:51:58,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:51:58,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2023-02-16 00:51:58,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055294160] [2023-02-16 00:51:58,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:51:58,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 00:51:58,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:51:58,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 00:51:58,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=145, Unknown=1, NotChecked=24, Total=210 [2023-02-16 00:51:58,059 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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) [2023-02-16 00:52:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:02,243 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2023-02-16 00:52:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 00:52:02,243 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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 21 [2023-02-16 00:52:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:02,244 INFO L225 Difference]: With dead ends: 40 [2023-02-16 00:52:02,244 INFO L226 Difference]: Without dead ends: 28 [2023-02-16 00:52:02,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=47, Invalid=166, Unknown=1, NotChecked=26, Total=240 [2023-02-16 00:52:02,245 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:02,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 1 Unknown, 18 Unchecked, 0.1s Time] [2023-02-16 00:52:02,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-16 00:52:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-02-16 00:52:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 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) [2023-02-16 00:52:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-02-16 00:52:02,249 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2023-02-16 00:52:02,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:02,249 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-02-16 00:52:02,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 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) [2023-02-16 00:52:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-02-16 00:52:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 00:52:02,250 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:02,250 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2023-02-16 00:52:02,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-16 00:52:02,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:02,451 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:02,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:02,451 INFO L85 PathProgramCache]: Analyzing trace with hash -336964282, now seen corresponding path program 4 times [2023-02-16 00:52:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:02,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921669784] [2023-02-16 00:52:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:03,148 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:52:03,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:03,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921669784] [2023-02-16 00:52:03,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921669784] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:03,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397489602] [2023-02-16 00:52:03,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:52:03,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:03,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:03,165 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) [2023-02-16 00:52:03,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:52:03,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:52:03,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:52:03,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-16 00:52:03,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:03,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:03,276 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2023-02-16 00:52:03,323 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:03,333 INFO L321 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2023-02-16 00:52:03,334 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 32 [2023-02-16 00:52:03,340 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:03,415 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:52:03,419 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:52:03,434 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 00:52:03,435 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 28 [2023-02-16 00:52:03,451 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 00:52:03,452 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 42 [2023-02-16 00:52:03,471 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-16 00:52:03,472 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 36 [2023-02-16 00:52:03,492 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:52:03,493 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:52:03,495 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 00:52:03,855 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:03,864 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2023-02-16 00:52:03,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 56 [2023-02-16 00:52:03,875 INFO L321 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2023-02-16 00:52:03,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 25 [2023-02-16 00:52:03,894 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:03,896 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:52:03,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:04,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:04,101 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 42 [2023-02-16 00:52:04,107 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:04,107 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 37 [2023-02-16 00:52:04,310 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (|ULTIMATE.start_main_~t~0#1.base| Int) (v_ArrVal_254 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~t~0#1.base| v_ArrVal_254))) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1))) 1) (not (= (select v_arrayElimArr_10 4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_11 4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= 1 (select v_ArrVal_254 0))) (not (= 1 (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) is different from false [2023-02-16 00:52:04,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:04,332 INFO L350 Elim1Store]: Elim1 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 69 treesize of output 68 [2023-02-16 00:52:04,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:04,338 INFO L350 Elim1Store]: Elim1 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 126 treesize of output 108 [2023-02-16 00:52:04,345 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:04,346 INFO L350 Elim1Store]: Elim1 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 124 treesize of output 104 [2023-02-16 00:52:04,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:04,352 INFO L350 Elim1Store]: Elim1 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 78 treesize of output 68 [2023-02-16 00:52:04,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:04,359 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 98 [2023-02-16 00:52:04,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:04,368 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 122 [2023-02-16 00:52:04,688 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2023-02-16 00:52:04,688 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 18 [2023-02-16 00:52:04,881 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_39 Int) (v_ArrVal_254 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int)) (or (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~t~0#1.base_15|) (forall ((v_ArrVal_253 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| v_arrayElimCell_39 v_ArrVal_253) |v_ULTIMATE.start_main_~t~0#1.base_15| v_ArrVal_254))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= 1 (select (select .cse0 v_arrayElimCell_39) |c_ULTIMATE.start_main_~t~0#1.offset|)))))))) (not (= 1 (select v_ArrVal_254 0))))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_254 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| v_arrayElimCell_39 v_ArrVal_253) |v_ULTIMATE.start_main_~t~0#1.base_15| v_ArrVal_254))) (let ((.cse1 (select .cse3 v_arrayElimCell_39)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|))) (or (= (select .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= (select .cse2 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~t~0#1.base_15|) (not (= 1 (select .cse1 |c_ULTIMATE.start_main_~t~0#1.offset|))) (= (select .cse2 |c_ULTIMATE.start_main_~t~0#1.offset|) 1))))) (not (= 1 (select v_ArrVal_254 0))))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_254 (Array Int Int))) (or (not (= 1 (select v_ArrVal_254 0))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int)) (or (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~t~0#1.base_15|) (forall ((v_ArrVal_253 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| v_arrayElimCell_39 v_ArrVal_253) |v_ULTIMATE.start_main_~t~0#1.base_15| v_ArrVal_254))) (let ((.cse4 (select .cse5 v_arrayElimCell_39))) (or (= (select .cse4 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= (select (select .cse5 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= 1 (select .cse4 |c_ULTIMATE.start_main_~t~0#1.offset|))))))))))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_254 (Array Int Int))) (or (not (= 1 (select v_ArrVal_254 0))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int)) (or (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~t~0#1.base_15|) (forall ((v_ArrVal_253 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| v_arrayElimCell_39 v_ArrVal_253) |v_ULTIMATE.start_main_~t~0#1.base_15| v_ArrVal_254))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~p~0#1.base|))) (or (= (select .cse6 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= 1 (select (select .cse7 v_arrayElimCell_39) |c_ULTIMATE.start_main_~t~0#1.offset|))) (= (select .cse6 |c_ULTIMATE.start_main_~t~0#1.offset|) 1))))))))) (= |c_ULTIMATE.start_main_~t~0#1.offset| 0)) is different from false [2023-02-16 00:52:04,985 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimCell_39 Int) (v_ArrVal_254 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int)) (or (forall ((v_ArrVal_253 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| v_arrayElimCell_39 v_ArrVal_253) |v_ULTIMATE.start_main_~t~0#1.base_15| v_ArrVal_254))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= 1 (select (select .cse0 v_arrayElimCell_39) 0)))))) (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~t~0#1.base_15|))) (not (= 1 (select v_ArrVal_254 0))))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_254 (Array Int Int))) (or (not (= 1 (select v_ArrVal_254 0))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int)) (or (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~t~0#1.base_15|) (forall ((v_ArrVal_253 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| v_arrayElimCell_39 v_ArrVal_253) |v_ULTIMATE.start_main_~t~0#1.base_15| v_ArrVal_254))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~p~0#1.base|))) (or (= (select .cse1 0) 1) (= (select .cse1 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= 1 (select (select .cse2 v_arrayElimCell_39) 0))))))))))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_254 (Array Int Int))) (or (not (= 1 (select v_ArrVal_254 0))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| v_arrayElimCell_39 v_ArrVal_253) |v_ULTIMATE.start_main_~t~0#1.base_15| v_ArrVal_254))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_main_~p~0#1.base|)) (.cse4 (select .cse5 v_arrayElimCell_39))) (or (= (select .cse3 0) 1) (= (select .cse4 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= (select .cse3 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~t~0#1.base_15|) (not (= 1 (select .cse4 0))))))))) (forall ((v_arrayElimCell_39 Int) (v_ArrVal_254 (Array Int Int))) (or (not (= 1 (select v_ArrVal_254 0))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_15| Int)) (or (= v_arrayElimCell_39 |v_ULTIMATE.start_main_~t~0#1.base_15|) (forall ((v_ArrVal_253 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| v_arrayElimCell_39 v_ArrVal_253) |v_ULTIMATE.start_main_~t~0#1.base_15| v_ArrVal_254))) (let ((.cse6 (select .cse7 v_arrayElimCell_39))) (or (= (select .cse6 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (= (select (select .cse7 |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= 1 (select .cse6 0)))))))))))) is different from false [2023-02-16 00:52:05,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:05,048 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 46 [2023-02-16 00:52:05,051 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:05,052 INFO L350 Elim1Store]: Elim1 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 128 treesize of output 116 [2023-02-16 00:52:05,060 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 00:52:05,060 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 53 [2023-02-16 00:52:05,063 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 100 treesize of output 90 [2023-02-16 00:52:05,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:05,071 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-16 00:52:05,071 INFO L350 Elim1Store]: Elim1 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 80 treesize of output 1 [2023-02-16 00:52:05,074 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:05,076 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-16 00:52:05,076 INFO L350 Elim1Store]: Elim1 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 80 treesize of output 1 [2023-02-16 00:52:05,080 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:05,082 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-16 00:52:05,082 INFO L350 Elim1Store]: Elim1 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 106 treesize of output 1 [2023-02-16 00:52:05,092 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 10 not checked. [2023-02-16 00:52:05,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397489602] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:52:05,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:52:05,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 34 [2023-02-16 00:52:05,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608131265] [2023-02-16 00:52:05,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:05,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-16 00:52:05,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:05,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-16 00:52:05,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=795, Unknown=15, NotChecked=180, Total=1122 [2023-02-16 00:52:05,094 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 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) [2023-02-16 00:52:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:05,903 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-02-16 00:52:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 00:52:05,903 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 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 [2023-02-16 00:52:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:05,904 INFO L225 Difference]: With dead ends: 34 [2023-02-16 00:52:05,904 INFO L226 Difference]: Without dead ends: 32 [2023-02-16 00:52:05,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=337, Invalid=1379, Unknown=18, NotChecked=246, Total=1980 [2023-02-16 00:52:05,905 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 72 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:05,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 88 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 189 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2023-02-16 00:52:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-16 00:52:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-02-16 00:52:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 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) [2023-02-16 00:52:05,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2023-02-16 00:52:05,908 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2023-02-16 00:52:05,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:05,908 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2023-02-16 00:52:05,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 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) [2023-02-16 00:52:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2023-02-16 00:52:05,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 00:52:05,909 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:05,909 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2023-02-16 00:52:05,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:06,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:06,114 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:06,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:06,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1159556869, now seen corresponding path program 5 times [2023-02-16 00:52:06,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:06,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400844795] [2023-02-16 00:52:06,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:06,911 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:52:06,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:06,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400844795] [2023-02-16 00:52:06,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400844795] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:06,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481499845] [2023-02-16 00:52:06,912 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 00:52:06,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:06,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:06,913 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) [2023-02-16 00:52:06,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 00:52:07,015 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-02-16 00:52:07,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:52:07,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-16 00:52:07,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:07,027 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:07,042 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:07,050 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:07,071 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 00:52:07,071 INFO L350 Elim1Store]: Elim1 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 14 [2023-02-16 00:52:07,117 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:52:07,120 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:52:07,132 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 00:52:07,132 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 28 [2023-02-16 00:52:07,144 INFO L321 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2023-02-16 00:52:07,144 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 32 [2023-02-16 00:52:07,219 INFO L321 Elim1Store]: treesize reduction 22, result has 40.5 percent of original size [2023-02-16 00:52:07,220 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 24 [2023-02-16 00:52:07,281 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:07,287 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:52:07,291 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:52:07,296 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-02-16 00:52:07,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2023-02-16 00:52:07,306 INFO L321 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-02-16 00:52:07,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 55 [2023-02-16 00:52:07,856 INFO L321 Elim1Store]: treesize reduction 216, result has 37.4 percent of original size [2023-02-16 00:52:07,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 220 treesize of output 247 [2023-02-16 00:52:08,033 INFO L321 Elim1Store]: treesize reduction 156, result has 47.5 percent of original size [2023-02-16 00:52:08,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 156 treesize of output 240 [2023-02-16 00:52:10,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:10,153 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 30 [2023-02-16 00:52:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:52:10,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:10,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:10,412 INFO L350 Elim1Store]: Elim1 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 186 treesize of output 164 [2023-02-16 00:52:10,418 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:10,418 INFO L350 Elim1Store]: Elim1 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 156 treesize of output 134 [2023-02-16 00:52:10,433 INFO L321 Elim1Store]: treesize reduction 4, result has 93.8 percent of original size [2023-02-16 00:52:10,433 INFO L350 Elim1Store]: Elim1 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 181 treesize of output 180 [2023-02-16 00:52:10,442 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:10,443 INFO L350 Elim1Store]: Elim1 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 84 treesize of output 88 [2023-02-16 00:52:11,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,068 INFO L350 Elim1Store]: Elim1 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 109 treesize of output 102 [2023-02-16 00:52:11,073 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,073 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 87 [2023-02-16 00:52:11,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,093 INFO L350 Elim1Store]: Elim1 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 109 treesize of output 97 [2023-02-16 00:52:11,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,098 INFO L350 Elim1Store]: Elim1 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 89 treesize of output 87 [2023-02-16 00:52:11,116 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,117 INFO L350 Elim1Store]: Elim1 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 109 treesize of output 97 [2023-02-16 00:52:11,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,122 INFO L350 Elim1Store]: Elim1 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 89 treesize of output 87 [2023-02-16 00:52:11,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,142 INFO L350 Elim1Store]: Elim1 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 109 treesize of output 102 [2023-02-16 00:52:11,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,147 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 87 [2023-02-16 00:52:11,437 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_24 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int)) (let ((.cse3 (select v_arrayElimArr_22 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse3 v_arrayElimArr_24) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_23)) (.cse4 (store (store |c_#memory_$Pointer$.base| .cse3 v_arrayElimArr_25) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_22))) (let ((.cse1 (select (select .cse4 .cse3) 4)) (.cse2 (+ (select (select .cse0 .cse3) 4) 4))) (or (= 0 (select (select .cse0 .cse1) .cse2)) (not (= 0 (select (store |c_#valid| .cse3 1) |v_ULTIMATE.start_main_~t~0#1.base_18|))) (= (select (select .cse4 .cse1) .cse2) 0) (not (= (select v_arrayElimArr_24 4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_25 4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_23 4) 0))))))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_arrayElimArr_31 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_22 4))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse5 v_arrayElimArr_31) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_23)) (.cse9 (store (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_22))) (let ((.cse7 (select (select .cse9 .cse5) 4)) (.cse8 (+ (select (select .cse6 .cse5) 4) 4))) (or (not (= 0 (select (store |c_#valid| .cse5 1) |v_ULTIMATE.start_main_~t~0#1.base_18|))) (= (select (select .cse6 .cse7) .cse8) 0) (not (= (select v_arrayElimArr_31 4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_30 4) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse5 (select (select .cse9 .cse7) .cse8)) (not (= (select v_arrayElimArr_23 4) 0))))))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int)) (let ((.cse10 (select v_arrayElimArr_22 4))) (let ((.cse11 (select (let ((.cse12 (store (store |c_#memory_$Pointer$.base| .cse10 v_arrayElimArr_26) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_22))) (select .cse12 (select (select .cse12 .cse10) 4))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse10 v_arrayElimArr_27) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_23) .cse10) 4) 4)))) (or (not (= 0 (select (store |c_#valid| .cse10 1) |v_ULTIMATE.start_main_~t~0#1.base_18|))) (= .cse10 .cse11) (not (= (select v_arrayElimArr_26 4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_27 4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= .cse11 0) (not (= (select v_arrayElimArr_23 4) 0)))))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_arrayElimArr_29 (Array Int Int))) (let ((.cse13 (select v_arrayElimArr_22 4))) (or (not (= 0 (select (store |c_#valid| .cse13 1) |v_ULTIMATE.start_main_~t~0#1.base_18|))) (not (= (select v_arrayElimArr_29 4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_28 4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= 0 (let ((.cse14 (store (store |c_#memory_$Pointer$.offset| .cse13 v_arrayElimArr_28) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_23))) (select (select .cse14 (select (select (store (store |c_#memory_$Pointer$.base| .cse13 v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_22) .cse13) 4)) (+ (select (select .cse14 .cse13) 4) 4)))) (not (= (select v_arrayElimArr_23 4) 0)))))) is different from false [2023-02-16 00:52:11,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,500 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 66 [2023-02-16 00:52:11,506 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,506 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 56 [2023-02-16 00:52:11,508 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:11,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:11,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:11,513 INFO L350 Elim1Store]: Elim1 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 396 treesize of output 346 [2023-02-16 00:52:11,520 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:11,522 INFO L350 Elim1Store]: Elim1 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 184 treesize of output 178 [2023-02-16 00:52:11,525 INFO L350 Elim1Store]: Elim1 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 180 treesize of output 150 [2023-02-16 00:52:11,531 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,532 INFO L350 Elim1Store]: Elim1 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 152 treesize of output 136 [2023-02-16 00:52:11,534 INFO L350 Elim1Store]: Elim1 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 133 treesize of output 115 [2023-02-16 00:52:11,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,542 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2023-02-16 00:52:11,645 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,645 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 143 [2023-02-16 00:52:11,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,651 INFO L350 Elim1Store]: Elim1 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 133 treesize of output 103 [2023-02-16 00:52:11,653 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:11,654 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 73 [2023-02-16 00:52:11,657 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:11,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:11,659 INFO L350 Elim1Store]: Elim1 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 189 treesize of output 163 [2023-02-16 00:52:11,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,666 INFO L350 Elim1Store]: Elim1 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 170 treesize of output 138 [2023-02-16 00:52:11,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,672 INFO L350 Elim1Store]: Elim1 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 125 treesize of output 97 [2023-02-16 00:52:11,676 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 21 [2023-02-16 00:52:11,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,803 INFO L350 Elim1Store]: Elim1 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 153 treesize of output 133 [2023-02-16 00:52:11,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,809 INFO L350 Elim1Store]: Elim1 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 123 treesize of output 103 [2023-02-16 00:52:11,812 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:11,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:11,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:11,816 INFO L350 Elim1Store]: Elim1 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 215 treesize of output 187 [2023-02-16 00:52:11,819 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:11,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:11,822 INFO L350 Elim1Store]: Elim1 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 179 treesize of output 163 [2023-02-16 00:52:11,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,830 INFO L350 Elim1Store]: Elim1 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 165 treesize of output 143 [2023-02-16 00:52:11,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,839 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 66 [2023-02-16 00:52:11,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,846 INFO L350 Elim1Store]: Elim1 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 128 treesize of output 108 [2023-02-16 00:52:11,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:11,861 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 63 [2023-02-16 00:52:12,006 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:12,006 INFO L350 Elim1Store]: Elim1 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 151 treesize of output 131 [2023-02-16 00:52:12,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:12,011 INFO L350 Elim1Store]: Elim1 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 101 [2023-02-16 00:52:12,014 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:12,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:12,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:12,019 INFO L350 Elim1Store]: Elim1 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 213 treesize of output 185 [2023-02-16 00:52:12,021 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:12,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:12,025 INFO L350 Elim1Store]: Elim1 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 279 treesize of output 253 [2023-02-16 00:52:12,032 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:12,032 INFO L350 Elim1Store]: Elim1 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 255 treesize of output 211 [2023-02-16 00:52:12,039 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:12,040 INFO L350 Elim1Store]: Elim1 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 208 treesize of output 172 [2023-02-16 00:52:12,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:12,047 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 84 [2023-02-16 00:52:12,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:12,055 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 54 [2023-02-16 00:52:12,537 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:12,539 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-16 00:52:12,541 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:12,543 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-16 00:52:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 00:52:12,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481499845] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:52:12,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:52:12,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2023-02-16 00:52:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886275524] [2023-02-16 00:52:12,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:12,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-16 00:52:12,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:12,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-16 00:52:12,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=974, Unknown=15, NotChecked=64, Total=1190 [2023-02-16 00:52:12,549 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 35 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 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) [2023-02-16 00:52:32,628 WARN L233 SmtUtils]: Spent 19.70s on a formula simplification. DAG size of input: 181 DAG size of output: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:52:43,775 WARN L233 SmtUtils]: Spent 10.85s on a formula simplification. DAG size of input: 200 DAG size of output: 179 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 00:52:44,434 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse8) 4))) (let ((.cse17 (= |c_ULTIMATE.start_main_~p~0#1.offset| 0)) (.cse6 (= (select (select |c_#memory_$Pointer$.base| .cse7) 4) 0)) (.cse0 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_arrayElimArr_22 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5) 4))) (or (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select .cse1 .cse2) .cse3)) (= (select (select .cse4 .cse2) .cse3) 0))))))) (or .cse6 (= .cse7 .cse8)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_arrayElimArr_26 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_arrayElimArr_27 (Array Int Int))) (let ((.cse9 (select (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_26) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_22))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0))) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_27) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_23) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) 4)))) (or (not (= (select v_arrayElimArr_27 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_23 4) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_26 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse9 0) (not (= (select v_arrayElimArr_22 4) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|))) (= |c_ULTIMATE.start_main_~t~0#1.base| .cse9)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_arrayElimArr_28 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_arrayElimArr_29 (Array Int Int))) (let ((.cse11 (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_28) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_23))) (select (select .cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_29) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_22) |c_ULTIMATE.start_main_~t~0#1.base|) .cse0)) (+ (select (select .cse12 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) 4))))) (or (not (= (select v_arrayElimArr_29 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_23 4) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_28 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~t~0#1.offset| .cse11) (not (= (select v_arrayElimArr_22 4) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|))) (= .cse11 0)))) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_24 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int)) (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_24) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_23)) (.cse13 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_25) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_22))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0)) (.cse15 (+ (select (select .cse16 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) 4))) (or (not (= (select v_arrayElimArr_23 4) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_22 4) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|))) (= (select (select .cse13 .cse14) .cse15) 0) (= |c_ULTIMATE.start_main_~t~0#1.offset| (select (select .cse16 .cse14) .cse15)) (not (= (select v_arrayElimArr_24 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_25 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))))) (= (select (select |c_#memory_$Pointer$.offset| .cse7) 4) 0) .cse17 (= (select (select |c_#memory_$Pointer$.offset| .cse8) 4) 0) (or (and (= 1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)) .cse17) (and (= 0 |c_ULTIMATE.start_main_~p~0#1.base|) (exists ((v_arrayElimIndex_7 Int)) (= 1 (select (select |c_#memory_int| v_arrayElimIndex_7) |c_ULTIMATE.start_main_~p~0#1.offset|))) .cse17)) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_arrayElimArr_22 (Array Int Int))) (let ((.cse18 (select (let ((.cse19 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_main_~p~0#1.base|) .cse5) 4)))) (or (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse18 0) (= |c_ULTIMATE.start_main_~p~0#1.base| .cse18)))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_arrayElimArr_22 (Array Int Int))) (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23))) (select (select .cse21 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22) |c_ULTIMATE.start_main_~p~0#1.base|) .cse5)) (+ (select (select .cse21 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5) 4))))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| .cse20) (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= .cse20 0)))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse5) 0) (or (= (select (select |c_#memory_int| .cse8) 0) 1) (= .cse8 0)) (= 0 |c_ULTIMATE.start_main_~p~0#1.offset|) (or .cse6 (= .cse7 |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| .cse7)) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_arrayElimArr_23 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_18| Int) (v_arrayElimArr_31 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_31) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_23)) (.cse22 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_30) |v_ULTIMATE.start_main_~t~0#1.base_18| v_arrayElimArr_22))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0)) (.cse24 (+ (select (select .cse25 |c_ULTIMATE.start_main_~t~0#1.base|) .cse0) 4))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| (select (select .cse22 .cse23) .cse24)) (not (= (select v_arrayElimArr_23 4) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_22 4) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= (select v_arrayElimArr_30 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_18|))) (= (select (select .cse25 .cse23) .cse24) 0) (not (= (select v_arrayElimArr_31 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) (forall ((v_arrayElimArr_23 (Array Int Int))) (or (not (= (select v_arrayElimArr_23 .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_arrayElimArr_22 (Array Int Int))) (let ((.cse26 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_23)) (.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_22))) (let ((.cse27 (select (select .cse29 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5)) (.cse28 (+ (select (select .cse26 |c_ULTIMATE.start_main_~p~0#1.base|) .cse5) 4))) (or (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select .cse26 .cse27) .cse28)) (not (= (select v_arrayElimArr_22 .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)) (= (select (select .cse29 .cse27) .cse28) 0)))))))))))) is different from false [2023-02-16 00:52:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:52:48,941 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2023-02-16 00:52:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 00:52:48,942 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 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 [2023-02-16 00:52:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:52:48,942 INFO L225 Difference]: With dead ends: 49 [2023-02-16 00:52:48,942 INFO L226 Difference]: Without dead ends: 47 [2023-02-16 00:52:48,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=237, Invalid=1604, Unknown=59, NotChecked=170, Total=2070 [2023-02-16 00:52:48,943 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 22 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:52:48,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 162 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 307 Invalid, 53 Unknown, 32 Unchecked, 2.2s Time] [2023-02-16 00:52:48,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-02-16 00:52:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2023-02-16 00:52:48,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 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) [2023-02-16 00:52:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2023-02-16 00:52:48,949 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 28 [2023-02-16 00:52:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:52:48,949 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2023-02-16 00:52:48,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.0) internal successors, (70), 35 states have internal predecessors, (70), 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) [2023-02-16 00:52:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2023-02-16 00:52:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 00:52:48,950 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:52:48,950 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2023-02-16 00:52:48,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 00:52:49,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:49,155 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:52:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:52:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash 68074790, now seen corresponding path program 6 times [2023-02-16 00:52:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:52:49,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089711452] [2023-02-16 00:52:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:52:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:52:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:52:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:52:50,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:52:50,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089711452] [2023-02-16 00:52:50,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089711452] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:52:50,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967653716] [2023-02-16 00:52:50,391 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 00:52:50,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:52:50,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:52:50,405 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) [2023-02-16 00:52:50,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 00:52:50,488 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-02-16 00:52:50,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:52:50,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-16 00:52:50,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:52:50,526 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:50,598 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:50,617 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:50,743 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:52:50,744 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:50,849 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:52:50,857 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:52:50,866 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:50,874 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:51,119 INFO L321 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2023-02-16 00:52:51,119 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 24 [2023-02-16 00:52:51,326 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:52:51,335 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:52:51,375 INFO L321 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-02-16 00:52:51,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 55 [2023-02-16 00:52:51,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-02-16 00:52:52,258 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:52,334 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2023-02-16 00:52:52,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 82 [2023-02-16 00:52:52,398 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-02-16 00:52:52,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2023-02-16 00:52:52,417 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:52:52,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:52:52,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:52,828 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:52,860 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:52,861 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:52,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:52,897 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:52,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:52,912 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:52:52,949 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (and (forall ((v_arrayElimArr_46 (Array Int Int)) (v_arrayElimArr_47 (Array Int Int))) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_46))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_47) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1) 4)) 0) (not (= (select v_arrayElimArr_46 .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_47 .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)))) (forall ((v_arrayElimArr_44 (Array Int Int)) (v_arrayElimArr_45 (Array Int Int))) (or (not (= (select v_arrayElimArr_44 .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_45 .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_45))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_44) |c_ULTIMATE.start_main_~p~0#1.base|) .cse1)) (+ (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) .cse1) 4))) 0))))) is different from false [2023-02-16 00:52:53,287 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:53,287 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 53 [2023-02-16 00:52:53,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:53,303 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 48 [2023-02-16 00:52:53,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:53,360 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 53 [2023-02-16 00:52:53,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:53,379 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 48 [2023-02-16 00:52:54,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:54,363 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 76 [2023-02-16 00:52:54,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:54,379 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 56 [2023-02-16 00:52:54,385 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:54,389 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 38 [2023-02-16 00:52:54,398 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:54,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:54,406 INFO L350 Elim1Store]: Elim1 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 96 treesize of output 80 [2023-02-16 00:52:54,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:54,438 INFO L350 Elim1Store]: Elim1 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 95 treesize of output 85 [2023-02-16 00:52:54,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:54,471 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 56 [2023-02-16 00:52:54,479 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 21 [2023-02-16 00:52:55,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:55,100 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 66 [2023-02-16 00:52:55,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:55,117 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 56 [2023-02-16 00:52:55,122 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:55,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:55,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:52:55,145 INFO L350 Elim1Store]: Elim1 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 396 treesize of output 346 [2023-02-16 00:52:55,150 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:52:55,155 INFO L350 Elim1Store]: Elim1 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 184 treesize of output 178 [2023-02-16 00:52:55,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:55,187 INFO L350 Elim1Store]: Elim1 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 180 treesize of output 164 [2023-02-16 00:52:55,195 INFO L350 Elim1Store]: Elim1 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 156 treesize of output 126 [2023-02-16 00:52:55,203 INFO L350 Elim1Store]: Elim1 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 141 treesize of output 121 [2023-02-16 00:52:55,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:52:55,230 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 74 [2023-02-16 00:52:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 13 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-02-16 00:52:56,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967653716] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:52:56,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:52:56,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-02-16 00:52:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235248631] [2023-02-16 00:52:56,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:52:56,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 00:52:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:52:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 00:52:56,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=431, Unknown=3, NotChecked=42, Total=552 [2023-02-16 00:52:56,271 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 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) [2023-02-16 00:53:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:53:01,756 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2023-02-16 00:53:01,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 00:53:01,756 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 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) Word has length 31 [2023-02-16 00:53:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:53:01,757 INFO L225 Difference]: With dead ends: 51 [2023-02-16 00:53:01,757 INFO L226 Difference]: Without dead ends: 35 [2023-02-16 00:53:01,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=85, Invalid=468, Unknown=3, NotChecked=44, Total=600 [2023-02-16 00:53:01,758 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:53:01,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 175 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 6 Unknown, 27 Unchecked, 1.0s Time] [2023-02-16 00:53:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-16 00:53:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2023-02-16 00:53:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 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) [2023-02-16 00:53:01,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2023-02-16 00:53:01,763 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2023-02-16 00:53:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:53:01,764 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2023-02-16 00:53:01,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 24 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) [2023-02-16 00:53:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2023-02-16 00:53:01,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 00:53:01,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:53:01,764 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2023-02-16 00:53:01,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 00:53:01,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:53:01,970 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:53:01,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:53:01,971 INFO L85 PathProgramCache]: Analyzing trace with hash 605622946, now seen corresponding path program 7 times [2023-02-16 00:53:01,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:53:01,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057853535] [2023-02-16 00:53:01,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:53:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:53:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:53:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:53:04,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:53:04,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057853535] [2023-02-16 00:53:04,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057853535] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:53:04,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292842134] [2023-02-16 00:53:04,646 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-16 00:53:04,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:53:04,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:53:04,647 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) [2023-02-16 00:53:04,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 00:53:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:53:04,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-16 00:53:04,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:53:04,763 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:53:04,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:53:04,811 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 17 [2023-02-16 00:53:04,921 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 00:53:04,921 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:53:05,137 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:53:05,151 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:53:05,159 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-02-16 00:53:05,465 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2023-02-16 00:53:05,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2023-02-16 00:53:05,764 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:53:05,773 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:53:05,782 INFO L350 Elim1Store]: Elim1 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 63 treesize of output 47 [2023-02-16 00:53:05,797 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 26 [2023-02-16 00:53:05,825 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 22 [2023-02-16 00:53:06,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:53:06,145 INFO L321 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2023-02-16 00:53:06,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2023-02-16 00:53:06,460 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:53:06,472 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 14 [2023-02-16 00:53:06,515 INFO L321 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-02-16 00:53:06,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 113 treesize of output 73 [2023-02-16 00:53:06,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:53:06,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:53:06,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2023-02-16 00:53:06,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 30 [2023-02-16 00:53:07,680 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:53:07,806 INFO L321 Elim1Store]: treesize reduction 79, result has 19.4 percent of original size [2023-02-16 00:53:07,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 180 treesize of output 98 [2023-02-16 00:53:07,864 INFO L321 Elim1Store]: treesize reduction 10, result has 41.2 percent of original size [2023-02-16 00:53:07,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 29 [2023-02-16 00:53:07,947 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 00:53:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:53:07,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:53:08,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:53:08,575 INFO L350 Elim1Store]: Elim1 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 94 treesize of output 88 [2023-02-16 00:53:08,588 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:53:08,588 INFO L350 Elim1Store]: Elim1 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 79 treesize of output 73 [2023-02-16 00:53:08,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_arrayElimArr_60 (Array Int Int)) (v_arrayElimArr_61 (Array Int Int))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (or (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_61)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_60)) (.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) .cse4)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~p~0#1.base|) .cse4) 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_578) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) 1) (not (= (select v_arrayElimArr_61 .cse5) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_60 .cse5) |c_ULTIMATE.start_main_~p~0#1.base|))))) is different from false [2023-02-16 00:53:08,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:53:08,866 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 109 [2023-02-16 00:53:08,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:53:08,882 INFO L350 Elim1Store]: Elim1 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 100 treesize of output 94 [2023-02-16 00:53:08,935 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_26| Int) (v_arrayElimArr_60 (Array Int Int)) (v_arrayElimArr_62 (Array Int Int)) (v_arrayElimArr_61 (Array Int Int)) (v_arrayElimArr_63 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (or (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_63) |v_ULTIMATE.start_main_~t~0#1.base_26| v_arrayElimArr_61)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_62) |v_ULTIMATE.start_main_~t~0#1.base_26| v_arrayElimArr_60))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4)) (.cse2 (+ (select (select .cse3 |c_ULTIMATE.start_main_~t~0#1.base|) .cse4) 4))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_569) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_578) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) 1) (not (= (select v_arrayElimArr_61 4) |c_ULTIMATE.start_main_~t~0#1.offset|)) (not (= (select v_arrayElimArr_62 .cse4) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= (select v_arrayElimArr_63 .cse4) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_60 4) |c_ULTIMATE.start_main_~t~0#1.base|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_26|)))))) is different from false [2023-02-16 00:53:09,041 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_569 (Array Int Int)) (v_arrayElimArr_60 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_26| Int) (v_arrayElimArr_62 (Array Int Int)) (v_arrayElimArr_61 (Array Int Int)) (v_arrayElimArr_63 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_61 4))) (let ((.cse2 (+ .cse0 4)) (.cse1 (select v_arrayElimArr_60 4))) (or (not (= 0 .cse0)) (not (= 0 (select (store |c_#valid| .cse1 1) |v_ULTIMATE.start_main_~t~0#1.base_26|))) (not (= (select v_arrayElimArr_63 .cse2) |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (= (select v_arrayElimArr_62 .cse2) |c_ULTIMATE.start_main_~p~0#1.base|)) (not (= 0 (select |c_#valid| .cse1))) (= (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse1 v_arrayElimArr_63) |v_ULTIMATE.start_main_~t~0#1.base_26| v_arrayElimArr_61)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_62) |v_ULTIMATE.start_main_~t~0#1.base_26| v_arrayElimArr_60))) (let ((.cse4 (select (select .cse3 .cse1) .cse2)) (.cse5 (+ (select (select .cse6 .cse1) .cse2) 4))) (select (select (store (store |c_#memory_int| .cse1 v_ArrVal_569) |v_ULTIMATE.start_main_~t~0#1.base_26| v_ArrVal_578) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))) 1))))) is different from false [2023-02-16 00:53:09,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:53:09,114 INFO L350 Elim1Store]: Elim1 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 178 treesize of output 159 [2023-02-16 00:53:09,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:53:09,131 INFO L350 Elim1Store]: Elim1 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 148 treesize of output 129 [2023-02-16 00:53:09,137 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:53:09,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:53:09,160 INFO L350 Elim1Store]: Elim1 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 400 treesize of output 364 [2023-02-16 00:53:09,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:53:09,190 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 379 treesize of output 319 [2023-02-16 00:53:09,196 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 00:53:09,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 00:53:09,216 INFO L350 Elim1Store]: Elim1 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 842 treesize of output 764 [2023-02-16 00:53:09,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:53:09,248 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 770 treesize of output 664 [2023-02-16 00:53:09,285 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:53:09,285 INFO L350 Elim1Store]: Elim1 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 660 treesize of output 570 [2023-02-16 00:53:09,322 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 00:53:09,322 INFO L350 Elim1Store]: Elim1 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 488 treesize of output 418