./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-ext2-properties/simple_and_skiplist_2lvl-2.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 --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 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:59:22,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:59:22,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 21:59:22,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:59:22,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:59:22,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:59:22,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:59:22,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:59:22,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:59:22,577 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:59:22,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:59:22,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:59:22,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:59:22,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:59:22,580 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:59:22,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:59:22,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:59:22,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:59:22,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 21:59:22,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:59:22,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:59:22,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:59:22,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:59:22,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:59:22,587 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:59:22,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:59:22,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:59:22,587 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:59:22,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:59:22,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:59:22,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:59:22,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:59:22,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:59:22,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:59:22,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:59:22,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:59:22,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 21:59:22,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 21:59:22,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:59:22,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:59:22,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:59:22,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:59:22,611 INFO L153 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 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 -> 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 [2024-11-09 21:59:22,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:59:22,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:59:22,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:59:22,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:59:22,830 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:59:22,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2024-11-09 21:59:24,186 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:59:24,378 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:59:24,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2024-11-09 21:59:24,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbbd04cdb/c7c238a69ae7423f86caf3e1f6f85d3a/FLAG224fa1a27 [2024-11-09 21:59:24,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbbd04cdb/c7c238a69ae7423f86caf3e1f6f85d3a [2024-11-09 21:59:24,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:59:24,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:59:24,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:59:24,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:59:24,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:59:24,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6745eb56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24, skipping insertion in model container [2024-11-09 21:59:24,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:59:24,716 WARN L250 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-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-11-09 21:59:24,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:59:24,733 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 21:59:24,766 WARN L250 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-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-11-09 21:59:24,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:59:24,796 INFO L204 MainTranslator]: Completed translation [2024-11-09 21:59:24,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24 WrapperNode [2024-11-09 21:59:24,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 21:59:24,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 21:59:24,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 21:59:24,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 21:59:24,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,836 INFO L138 Inliner]: procedures = 126, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2024-11-09 21:59:24,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 21:59:24,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 21:59:24,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 21:59:24,837 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 21:59:24,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,848 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,862 INFO L175 MemorySlicer]: Split 38 memory accesses to 4 slices as follows [2, 16, 7, 13]. 42 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 15 writes are split as follows [0, 8, 4, 3]. [2024-11-09 21:59:24,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,897 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 21:59:24,906 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 21:59:24,906 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 21:59:24,906 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 21:59:24,906 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (1/1) ... [2024-11-09 21:59:24,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:59:24,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:24,944 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 21:59:24,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 21:59:25,007 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-09 21:59:25,007 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-09 21:59:25,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 21:59:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 21:59:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 21:59:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 21:59:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 21:59:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 21:59:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 21:59:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 21:59:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 21:59:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 21:59:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 21:59:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 21:59:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 21:59:25,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 21:59:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 21:59:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 21:59:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 21:59:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 21:59:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 21:59:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 21:59:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 21:59:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 21:59:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 21:59:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 21:59:25,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 21:59:25,113 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 21:59:25,114 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 21:59:25,145 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-09 21:59:25,304 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-11-09 21:59:25,305 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 21:59:25,315 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 21:59:25,315 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 21:59:25,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:59:25 BoogieIcfgContainer [2024-11-09 21:59:25,315 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 21:59:25,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 21:59:25,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 21:59:25,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 21:59:25,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:59:24" (1/3) ... [2024-11-09 21:59:25,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fdec49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:59:25, skipping insertion in model container [2024-11-09 21:59:25,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:24" (2/3) ... [2024-11-09 21:59:25,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61fdec49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:59:25, skipping insertion in model container [2024-11-09 21:59:25,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:59:25" (3/3) ... [2024-11-09 21:59:25,322 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2024-11-09 21:59:25,335 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 21:59:25,335 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 21:59:25,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 21:59:25,388 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3ce664e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 21:59:25,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 21:59:25,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 41 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 21:59:25,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:25,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:25,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:25,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash -520185057, now seen corresponding path program 1 times [2024-11-09 21:59:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496523339] [2024-11-09 21:59:25,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:25,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:25,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:25,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496523339] [2024-11-09 21:59:25,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496523339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:25,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:25,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 21:59:25,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993599678] [2024-11-09 21:59:25,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:25,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 21:59:25,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:25,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 21:59:25,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 21:59:25,567 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.4871794871794872) internal successors, (58), 41 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2024-11-09 21:59:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:25,585 INFO L93 Difference]: Finished difference Result 73 states and 103 transitions. [2024-11-09 21:59:25,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 21:59:25,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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 [2024-11-09 21:59:25,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:25,591 INFO L225 Difference]: With dead ends: 73 [2024-11-09 21:59:25,591 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 21:59:25,594 INFO L431 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 [2024-11-09 21:59:25,597 INFO L432 NwaCegarLoop]: 52 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, 52 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 [2024-11-09 21:59:25,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:59:25,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 21:59:25,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 21:59:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:25,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-09 21:59:25,624 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2024-11-09 21:59:25,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:25,625 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-09 21:59:25,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2024-11-09 21:59:25,626 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-09 21:59:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 21:59:25,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:25,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:25,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 21:59:25,627 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:25,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash 399708690, now seen corresponding path program 1 times [2024-11-09 21:59:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:25,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350222410] [2024-11-09 21:59:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:25,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:25,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:25,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350222410] [2024-11-09 21:59:25,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350222410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:25,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:25,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 21:59:25,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540933844] [2024-11-09 21:59:25,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:25,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 21:59:25,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:25,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 21:59:25,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:59:25,815 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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) [2024-11-09 21:59:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:25,858 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-09 21:59:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 21:59:25,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 21:59:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:25,859 INFO L225 Difference]: With dead ends: 28 [2024-11-09 21:59:25,859 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 21:59:25,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:59:25,860 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:25,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 37 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:59:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 21:59:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-11-09 21:59:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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) [2024-11-09 21:59:25,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-11-09 21:59:25,864 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 12 [2024-11-09 21:59:25,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:25,864 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-11-09 21:59:25,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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) [2024-11-09 21:59:25,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-11-09 21:59:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 21:59:25,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:25,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:25,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 21:59:25,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:25,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:25,866 INFO L85 PathProgramCache]: Analyzing trace with hash 596971545, now seen corresponding path program 1 times [2024-11-09 21:59:25,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:25,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272676809] [2024-11-09 21:59:25,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:25,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:26,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272676809] [2024-11-09 21:59:26,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272676809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:26,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118819881] [2024-11-09 21:59:26,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:26,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:26,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:26,196 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) [2024-11-09 21:59:26,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 21:59:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:26,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 21:59:26,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:26,336 INFO L378 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 11 treesize of output 7 [2024-11-09 21:59:26,343 INFO L378 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 11 treesize of output 7 [2024-11-09 21:59:26,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:26,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:26,450 INFO L378 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 21 [2024-11-09 21:59:26,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 21:59:26,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 21:59:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:26,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118819881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:26,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:26,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 5] total 8 [2024-11-09 21:59:26,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081494070] [2024-11-09 21:59:26,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:26,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 21:59:26,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:26,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 21:59:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 21:59:26,478 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2024-11-09 21:59:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:26,515 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-11-09 21:59:26,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 21:59:26,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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 16 [2024-11-09 21:59:26,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:26,517 INFO L225 Difference]: With dead ends: 34 [2024-11-09 21:59:26,517 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 21:59:26,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 21:59:26,518 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:26,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:59:26,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 21:59:26,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-09 21:59:26,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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) [2024-11-09 21:59:26,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-09 21:59:26,525 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2024-11-09 21:59:26,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:26,525 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-09 21:59:26,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2024-11-09 21:59:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-09 21:59:26,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 21:59:26,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:26,525 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:26,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 21:59:26,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:26,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:26,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2143265774, now seen corresponding path program 1 times [2024-11-09 21:59:26,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:26,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578220602] [2024-11-09 21:59:26,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:26,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:26,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578220602] [2024-11-09 21:59:26,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578220602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:26,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203488160] [2024-11-09 21:59:26,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:26,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:26,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:26,994 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) [2024-11-09 21:59:26,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 21:59:27,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:27,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 21:59:27,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:27,099 INFO L378 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 [2024-11-09 21:59:27,162 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:27,162 INFO L378 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 [2024-11-09 21:59:27,169 INFO L378 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 11 treesize of output 7 [2024-11-09 21:59:27,223 INFO L378 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 23 treesize of output 11 [2024-11-09 21:59:27,272 INFO L378 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 16 treesize of output 11 [2024-11-09 21:59:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:27,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:27,357 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_115 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_113) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_115) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= v_ArrVal_113 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_113 .cse0))))))) is different from false [2024-11-09 21:59:27,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:27,385 INFO L378 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 70 treesize of output 74 [2024-11-09 21:59:27,392 INFO L378 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 50 treesize of output 46 [2024-11-09 21:59:27,447 INFO L378 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 143 treesize of output 137 [2024-11-09 21:59:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:27,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203488160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:27,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:27,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-09 21:59:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117413482] [2024-11-09 21:59:27,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:27,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 21:59:27,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:27,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 21:59:27,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=187, Unknown=6, NotChecked=28, Total=272 [2024-11-09 21:59:27,560 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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) [2024-11-09 21:59:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:27,678 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-11-09 21:59:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 21:59:27,678 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 21:59:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:27,679 INFO L225 Difference]: With dead ends: 32 [2024-11-09 21:59:27,679 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 21:59:27,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=323, Unknown=7, NotChecked=38, Total=462 [2024-11-09 21:59:27,680 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:27,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 64 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2024-11-09 21:59:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 21:59:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2024-11-09 21:59:27,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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) [2024-11-09 21:59:27,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-11-09 21:59:27,683 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2024-11-09 21:59:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:27,684 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-11-09 21:59:27,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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) [2024-11-09 21:59:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-11-09 21:59:27,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 21:59:27,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:27,684 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:27,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 21:59:27,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-09 21:59:27,889 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:27,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:27,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1125297163, now seen corresponding path program 1 times [2024-11-09 21:59:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415742304] [2024-11-09 21:59:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:28,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:28,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415742304] [2024-11-09 21:59:28,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415742304] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:28,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324767797] [2024-11-09 21:59:28,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:28,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:28,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:28,215 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) [2024-11-09 21:59:28,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 21:59:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:28,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 21:59:28,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:28,306 INFO L378 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 [2024-11-09 21:59:28,330 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:28,331 INFO L378 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 [2024-11-09 21:59:28,363 INFO L378 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 15 treesize of output 1 [2024-11-09 21:59:28,369 INFO L378 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 15 treesize of output 1 [2024-11-09 21:59:28,426 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 21:59:28,427 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 78 [2024-11-09 21:59:28,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 15 [2024-11-09 21:59:28,434 INFO L378 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 32 treesize of output 19 [2024-11-09 21:59:28,472 INFO L378 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 31 treesize of output 19 [2024-11-09 21:59:28,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-09 21:59:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:28,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:28,521 INFO L378 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 452 treesize of output 408 [2024-11-09 21:59:28,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:28,583 INFO L378 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 [2024-11-09 21:59:28,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:28,591 INFO L378 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 38 treesize of output 31 [2024-11-09 21:59:28,594 INFO L378 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 11 treesize of output 7 [2024-11-09 21:59:28,610 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-09 21:59:28,610 INFO L378 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 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-09 21:59:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:28,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324767797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:28,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:28,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-09 21:59:28,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285915446] [2024-11-09 21:59:28,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:28,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 21:59:28,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:28,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 21:59:28,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=255, Unknown=4, NotChecked=0, Total=306 [2024-11-09 21:59:28,705 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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) [2024-11-09 21:59:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:28,868 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-11-09 21:59:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 21:59:28,869 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 21:59:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:28,869 INFO L225 Difference]: With dead ends: 36 [2024-11-09 21:59:28,869 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 21:59:28,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=456, Unknown=4, NotChecked=0, Total=552 [2024-11-09 21:59:28,870 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:28,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 90 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:59:28,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 21:59:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2024-11-09 21:59:28,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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) [2024-11-09 21:59:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-09 21:59:28,877 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 20 [2024-11-09 21:59:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:28,877 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-09 21:59:28,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 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) [2024-11-09 21:59:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-09 21:59:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 21:59:28,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:28,878 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:28,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 21:59:29,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:29,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:29,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash 420997066, now seen corresponding path program 2 times [2024-11-09 21:59:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:29,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605840190] [2024-11-09 21:59:29,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:29,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605840190] [2024-11-09 21:59:29,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605840190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:29,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354641624] [2024-11-09 21:59:29,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:59:29,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:29,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:29,430 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) [2024-11-09 21:59:29,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 21:59:29,529 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 21:59:29,529 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:59:29,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 21:59:29,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:29,537 INFO L378 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 [2024-11-09 21:59:29,563 INFO L378 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 11 treesize of output 7 [2024-11-09 21:59:29,586 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 21:59:29,586 INFO L378 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 [2024-11-09 21:59:29,648 INFO L378 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 23 treesize of output 11 [2024-11-09 21:59:29,698 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 21:59:29,698 INFO L378 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 16 treesize of output 18 [2024-11-09 21:59:29,703 INFO L378 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 16 treesize of output 11 [2024-11-09 21:59:29,744 INFO L378 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 16 treesize of output 11 [2024-11-09 21:59:29,763 INFO L378 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 16 treesize of output 11 [2024-11-09 21:59:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:29,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:29,798 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array Int Int))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2024-11-09 21:59:29,870 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_269 (Array Int Int))) (or (not (= v_ArrVal_265 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_265 .cse0))))) (= (select (select (store (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_265) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_269) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_270) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)))) is different from false [2024-11-09 21:59:29,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:29,895 INFO L378 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 984 treesize of output 974 [2024-11-09 21:59:29,914 INFO L378 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 63 treesize of output 59 [2024-11-09 21:59:29,922 INFO L378 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 54 treesize of output 46 [2024-11-09 21:59:29,962 INFO L378 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 117 treesize of output 111 [2024-11-09 21:59:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 21:59:31,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354641624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:31,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:31,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-11-09 21:59:31,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434959385] [2024-11-09 21:59:31,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:31,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 21:59:31,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:31,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 21:59:31,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=239, Unknown=10, NotChecked=66, Total=380 [2024-11-09 21:59:31,209 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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) [2024-11-09 21:59:31,374 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (and (not .cse0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (forall ((v_ArrVal_270 (Array Int Int))) (= (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (forall ((v_ArrVal_270 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_269 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_269) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_270) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2024-11-09 21:59:31,426 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) (or (and (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) .cse0) (and (not .cse0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (forall ((v_ArrVal_270 (Array Int Int)) (v_ArrVal_269 (Array Int Int))) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (forall ((v_ArrVal_270 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_19| Int) (v_ArrVal_269 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_269) |v_ULTIMATE.start_main_~t~0#1.base_19| v_ArrVal_270) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_19|) 0))))) is different from false [2024-11-09 21:59:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:31,462 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-11-09 21:59:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 21:59:31,462 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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 20 [2024-11-09 21:59:31,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:31,464 INFO L225 Difference]: With dead ends: 58 [2024-11-09 21:59:31,464 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 21:59:31,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=121, Invalid=433, Unknown=14, NotChecked=188, Total=756 [2024-11-09 21:59:31,465 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 14 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:31,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 117 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 134 Invalid, 10 Unknown, 177 Unchecked, 0.1s Time] [2024-11-09 21:59:31,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 21:59:31,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2024-11-09 21:59:31,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-09 21:59:31,470 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 20 [2024-11-09 21:59:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:31,470 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-09 21:59:31,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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) [2024-11-09 21:59:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-09 21:59:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 21:59:31,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:31,471 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:31,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 21:59:31,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:31,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1277536380, now seen corresponding path program 2 times [2024-11-09 21:59:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676335735] [2024-11-09 21:59:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:31,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676335735] [2024-11-09 21:59:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676335735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296535034] [2024-11-09 21:59:32,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:59:32,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:32,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:32,061 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) [2024-11-09 21:59:32,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 21:59:32,156 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 21:59:32,156 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:59:32,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 21:59:32,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:32,170 INFO L378 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 [2024-11-09 21:59:32,195 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:32,195 INFO L378 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 [2024-11-09 21:59:32,220 INFO L378 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 15 treesize of output 1 [2024-11-09 21:59:32,227 INFO L378 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 11 treesize of output 7 [2024-11-09 21:59:32,260 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2024-11-09 21:59:32,260 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-09 21:59:32,262 INFO L378 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 21 treesize of output 23 [2024-11-09 21:59:32,267 INFO L378 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 12 treesize of output 11 [2024-11-09 21:59:32,271 INFO L378 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 12 treesize of output 11 [2024-11-09 21:59:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:32,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:32,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:32,451 INFO L378 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 [2024-11-09 21:59:32,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:32,454 INFO L378 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 [2024-11-09 21:59:32,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:32,467 INFO L378 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 [2024-11-09 21:59:32,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:32,474 INFO L378 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 [2024-11-09 21:59:32,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:32,554 INFO L378 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 60 treesize of output 61 [2024-11-09 21:59:32,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:32,558 INFO L378 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 50 treesize of output 41 [2024-11-09 21:59:32,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:32,566 INFO L378 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 72 treesize of output 71 [2024-11-09 21:59:32,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:32,577 INFO L378 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 38 treesize of output 38 [2024-11-09 21:59:32,745 INFO L349 Elim1Store]: treesize reduction 34, result has 83.2 percent of original size [2024-11-09 21:59:32,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 184 treesize of output 295 [2024-11-09 21:59:32,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:32,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 166 [2024-11-09 21:59:36,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:36,395 INFO L378 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 60 treesize of output 61 [2024-11-09 21:59:36,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:36,404 INFO L378 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 50 treesize of output 41 [2024-11-09 21:59:36,446 INFO L349 Elim1Store]: treesize reduction 84, result has 25.0 percent of original size [2024-11-09 21:59:36,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 111 [2024-11-09 21:59:36,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 21:59:36,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2024-11-09 21:59:36,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 21:59:36,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 21:59:36,492 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2024-11-09 21:59:36,497 INFO L378 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 8 treesize of output 4 [2024-11-09 21:59:36,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:36,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296535034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:36,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:36,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-09 21:59:36,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368222153] [2024-11-09 21:59:36,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:36,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 21:59:36,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:36,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 21:59:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=220, Unknown=8, NotChecked=0, Total=272 [2024-11-09 21:59:36,698 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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) [2024-11-09 21:59:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:36,847 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-11-09 21:59:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 21:59:36,848 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 21:59:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:36,849 INFO L225 Difference]: With dead ends: 56 [2024-11-09 21:59:36,849 INFO L226 Difference]: Without dead ends: 38 [2024-11-09 21:59:36,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=276, Unknown=8, NotChecked=0, Total=342 [2024-11-09 21:59:36,850 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:36,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:59:36,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-09 21:59:36,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 21:59:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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) [2024-11-09 21:59:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-09 21:59:36,855 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 24 [2024-11-09 21:59:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:36,855 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 21:59:36,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 states have internal predecessors, (51), 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) [2024-11-09 21:59:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-09 21:59:36,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 21:59:36,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:36,856 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:36,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 21:59:37,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:37,057 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:37,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:37,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1501017647, now seen corresponding path program 3 times [2024-11-09 21:59:37,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:37,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18804265] [2024-11-09 21:59:37,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:37,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18804265] [2024-11-09 21:59:37,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18804265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:37,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403768430] [2024-11-09 21:59:37,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 21:59:37,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:37,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:37,643 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) [2024-11-09 21:59:37,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 21:59:37,734 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 21:59:37,734 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:59:37,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 21:59:37,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:37,741 INFO L378 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 [2024-11-09 21:59:37,770 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 21:59:37,770 INFO L378 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 [2024-11-09 21:59:37,800 INFO L378 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 15 treesize of output 1 [2024-11-09 21:59:37,805 INFO L378 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 11 treesize of output 7 [2024-11-09 21:59:37,832 INFO L378 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 11 treesize of output 7 [2024-11-09 21:59:37,836 INFO L378 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 16 treesize of output 11 [2024-11-09 21:59:37,849 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 21:59:37,849 INFO L378 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 16 treesize of output 18 [2024-11-09 21:59:37,855 INFO L378 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 16 treesize of output 11 [2024-11-09 21:59:37,884 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-11-09 21:59:37,884 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 79 [2024-11-09 21:59:37,888 INFO L378 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 24 treesize of output 11 [2024-11-09 21:59:37,893 INFO L378 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 39 treesize of output 15 [2024-11-09 21:59:37,953 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 21:59:37,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 77 [2024-11-09 21:59:37,958 INFO L378 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 36 treesize of output 15 [2024-11-09 21:59:37,962 INFO L378 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 32 treesize of output 11 [2024-11-09 21:59:38,008 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:38,008 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2024-11-09 21:59:38,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 21:59:38,017 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:38,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:38,050 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_428 (Array Int Int)) (v_ArrVal_430 (Array Int Int)) (v_ArrVal_432 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_432) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_428) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2024-11-09 21:59:38,064 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_427 (Array Int Int)) (v_ArrVal_426 (Array Int Int)) (v_ArrVal_428 (Array Int Int)) (v_ArrVal_430 (Array Int Int)) (v_ArrVal_432 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (not (= v_ArrVal_427 (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_427 .cse0)))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_427) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_432) (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_430) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_426) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_428) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)))) is different from false [2024-11-09 21:59:38,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:38,079 INFO L378 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 42 treesize of output 46 [2024-11-09 21:59:38,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:38,087 INFO L378 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 540 treesize of output 526 [2024-11-09 21:59:38,098 INFO L378 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 108 treesize of output 72 [2024-11-09 21:59:38,134 INFO L378 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 21 treesize of output 3 [2024-11-09 21:59:38,138 INFO L378 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 379 treesize of output 325 [2024-11-09 21:59:38,146 INFO L378 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 358 treesize of output 322 [2024-11-09 21:59:38,173 INFO L378 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 30 treesize of output 22 [2024-11-09 21:59:38,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:38,232 INFO L378 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 34 treesize of output 35 [2024-11-09 21:59:38,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:38,239 INFO L378 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 107 treesize of output 106 [2024-11-09 21:59:38,243 INFO L378 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 90 treesize of output 82 [2024-11-09 21:59:38,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:38,250 INFO L378 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 93 treesize of output 61 [2024-11-09 21:59:38,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:38,298 INFO L378 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 29 treesize of output 30 [2024-11-09 21:59:38,301 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 21:59:38,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:38,307 INFO L378 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 36 treesize of output 35 [2024-11-09 21:59:38,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:38,317 INFO L378 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 22 treesize of output 22 [2024-11-09 21:59:38,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:38,325 INFO L378 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 25 treesize of output 26 [2024-11-09 21:59:38,327 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 21:59:38,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:38,333 INFO L378 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 36 treesize of output 35 [2024-11-09 21:59:38,338 INFO L378 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 7 treesize of output 3 [2024-11-09 21:59:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 21:59:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403768430] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:38,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:38,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-11-09 21:59:38,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929082755] [2024-11-09 21:59:38,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:38,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 21:59:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 21:59:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=286, Unknown=3, NotChecked=70, Total=420 [2024-11-09 21:59:38,654 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 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) [2024-11-09 21:59:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:38,892 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-11-09 21:59:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 21:59:38,893 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 21:59:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:38,893 INFO L225 Difference]: With dead ends: 50 [2024-11-09 21:59:38,894 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 21:59:38,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=498, Unknown=3, NotChecked=94, Total=702 [2024-11-09 21:59:38,896 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:38,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 121 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 162 Invalid, 0 Unknown, 61 Unchecked, 0.1s Time] [2024-11-09 21:59:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 21:59:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2024-11-09 21:59:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 21:59:38,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-11-09 21:59:38,899 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2024-11-09 21:59:38,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:38,899 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-09 21:59:38,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 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) [2024-11-09 21:59:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-11-09 21:59:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 21:59:38,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:38,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:38,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 21:59:39,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:39,101 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:39,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1633308760, now seen corresponding path program 4 times [2024-11-09 21:59:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:39,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701880153] [2024-11-09 21:59:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:39,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701880153] [2024-11-09 21:59:39,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701880153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:39,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202794289] [2024-11-09 21:59:39,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 21:59:39,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:39,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:39,655 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) [2024-11-09 21:59:39,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 21:59:39,761 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 21:59:39,761 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:59:39,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 21:59:39,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:39,770 INFO L378 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 [2024-11-09 21:59:39,812 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 21:59:39,813 INFO L378 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 [2024-11-09 21:59:39,890 INFO L378 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 15 treesize of output 1 [2024-11-09 21:59:39,896 INFO L378 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 15 treesize of output 1 [2024-11-09 21:59:39,974 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 21:59:39,974 INFO L378 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 16 treesize of output 15 [2024-11-09 21:59:39,976 INFO L378 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 [2024-11-09 21:59:39,991 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 21:59:39,991 INFO L378 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 33 treesize of output 24 [2024-11-09 21:59:40,016 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 21:59:40,016 INFO L378 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 20 treesize of output 22 [2024-11-09 21:59:40,102 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-11-09 21:59:40,102 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 119 [2024-11-09 21:59:40,105 INFO L378 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 92 [2024-11-09 21:59:40,230 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-11-09 21:59:40,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 180 [2024-11-09 21:59:40,253 INFO L349 Elim1Store]: treesize reduction 68, result has 18.1 percent of original size [2024-11-09 21:59:40,254 INFO L378 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 183 treesize of output 161 [2024-11-09 21:59:40,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 35 [2024-11-09 21:59:40,416 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 21:59:40,416 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 49 [2024-11-09 21:59:40,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-11-09 21:59:40,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:40,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:40,483 INFO L378 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 451 treesize of output 393 [2024-11-09 21:59:40,493 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_525 (Array Int Int)) (v_ArrVal_529 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_525 (Array Int Int)) (v_ArrVal_529 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_525))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_529) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))) is different from false [2024-11-09 21:59:40,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse4 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_525 (Array Int Int)) (v_ArrVal_529 (Array Int Int)) (|ULTIMATE.start_main_~t~0#1.offset| Int)) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_525))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_529) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))) (forall ((v_ArrVal_525 (Array Int Int)) (v_ArrVal_529 (Array Int Int)) (|ULTIMATE.start_main_~t~0#1.offset| Int)) (= |ULTIMATE.start_main_~t~0#1.offset| (let ((.cse5 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse3 .cse4 |ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_529))) (select (select .cse5 (select (select (store .cse2 |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_525) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4)))))))) is different from false [2024-11-09 21:59:40,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:40,527 INFO L378 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 103 [2024-11-09 21:59:40,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:40,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 137 [2024-11-09 21:59:40,566 INFO L378 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 21:59:40,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:40,651 INFO L378 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 85 treesize of output 86 [2024-11-09 21:59:40,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:40,658 INFO L378 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 99 treesize of output 90 [2024-11-09 21:59:40,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:40,668 INFO L378 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 638 treesize of output 451 [2024-11-09 21:59:41,244 INFO L349 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2024-11-09 21:59:41,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 2880 treesize of output 3063 [2024-11-09 21:59:41,357 INFO L378 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 418 treesize of output 358 [2024-11-09 21:59:41,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:41,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 660 treesize of output 576 [2024-11-09 21:59:41,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:41,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 562 treesize of output 422 [2024-11-09 21:59:41,519 INFO L378 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 247 treesize of output 171