./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.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 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 01:44:35,759 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 01:44:35,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 01:44:35,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 01:44:35,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 01:44:35,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 01:44:35,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 01:44:35,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 01:44:35,851 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 01:44:35,854 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 01:44:35,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 01:44:35,854 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 01:44:35,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 01:44:35,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 01:44:35,856 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 01:44:35,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 01:44:35,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 01:44:35,856 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 01:44:35,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 01:44:35,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 01:44:35,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 01:44:35,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 01:44:35,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 01:44:35,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 01:44:35,858 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 01:44:35,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 01:44:35,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 01:44:35,859 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 01:44:35,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 01:44:35,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 01:44:35,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 01:44:35,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 01:44:35,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:44:35,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 01:44:35,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 01:44:35,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 01:44:35,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 01:44:35,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 01:44:35,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 01:44:35,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 01:44:35,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 01:44:35,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 01:44:35,862 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 -> 0abab60f5c601fd8191c1a2aa712d4ab55460e987c7d41ca7527c2934792cc0b [2024-10-14 01:44:36,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 01:44:36,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 01:44:36,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 01:44:36,073 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 01:44:36,074 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 01:44:36,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i [2024-10-14 01:44:37,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 01:44:37,508 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 01:44:37,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i [2024-10-14 01:44:37,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/027da88c2/a9a83fbf8edf4bbfa9ae9fdcbb5fd391/FLAG7e4138b8c [2024-10-14 01:44:37,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/027da88c2/a9a83fbf8edf4bbfa9ae9fdcbb5fd391 [2024-10-14 01:44:37,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 01:44:37,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 01:44:37,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 01:44:37,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 01:44:37,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 01:44:37,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:44:37" (1/1) ... [2024-10-14 01:44:37,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8945ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:37, skipping insertion in model container [2024-10-14 01:44:37,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:44:37" (1/1) ... [2024-10-14 01:44:37,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 01:44:38,203 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i[23732,23745] [2024-10-14 01:44:38,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:44:38,216 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 01:44:38,255 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/hash_fun.i[23732,23745] [2024-10-14 01:44:38,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 01:44:38,286 INFO L204 MainTranslator]: Completed translation [2024-10-14 01:44:38,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38 WrapperNode [2024-10-14 01:44:38,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 01:44:38,288 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 01:44:38,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 01:44:38,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 01:44:38,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,324 INFO L138 Inliner]: procedures = 125, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 80 [2024-10-14 01:44:38,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 01:44:38,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 01:44:38,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 01:44:38,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 01:44:38,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,356 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 8, 5]. 53 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 4 writes are split as follows [0, 2, 2]. [2024-10-14 01:44:38,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 01:44:38,380 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 01:44:38,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 01:44:38,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 01:44:38,381 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (1/1) ... [2024-10-14 01:44:38,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 01:44:38,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:38,419 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-10-14 01:44:38,424 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-10-14 01:44:38,462 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 01:44:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 01:44:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 01:44:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 01:44:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 01:44:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 01:44:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 01:44:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 01:44:38,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 01:44:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 01:44:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 01:44:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 01:44:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 01:44:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 01:44:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 01:44:38,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 01:44:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 01:44:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 01:44:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 01:44:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 01:44:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 01:44:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 01:44:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 01:44:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 01:44:38,601 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 01:44:38,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 01:44:38,739 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-14 01:44:38,739 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 01:44:38,776 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 01:44:38,776 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 01:44:38,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:44:38 BoogieIcfgContainer [2024-10-14 01:44:38,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 01:44:38,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 01:44:38,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 01:44:38,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 01:44:38,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:44:37" (1/3) ... [2024-10-14 01:44:38,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@155c76ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:44:38, skipping insertion in model container [2024-10-14 01:44:38,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:44:38" (2/3) ... [2024-10-14 01:44:38,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@155c76ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:44:38, skipping insertion in model container [2024-10-14 01:44:38,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:44:38" (3/3) ... [2024-10-14 01:44:38,784 INFO L112 eAbstractionObserver]: Analyzing ICFG hash_fun.i [2024-10-14 01:44:38,803 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 01:44:38,804 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 01:44:38,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 01:44:38,855 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;@368e91ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 01:44:38,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 01:44:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:38,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 01:44:38,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:38,864 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:38,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:38,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 223023209, now seen corresponding path program 1 times [2024-10-14 01:44:38,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:38,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310352786] [2024-10-14 01:44:38,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:38,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:38,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:38,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310352786] [2024-10-14 01:44:38,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310352786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:39,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:39,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 01:44:39,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858795026] [2024-10-14 01:44:39,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:39,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 01:44:39,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:39,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 01:44:39,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 01:44:39,026 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:39,049 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2024-10-14 01:44:39,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 01:44:39,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 01:44:39,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:39,057 INFO L225 Difference]: With dead ends: 24 [2024-10-14 01:44:39,057 INFO L226 Difference]: Without dead ends: 13 [2024-10-14 01:44:39,059 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-10-14 01:44:39,061 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:39,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-14 01:44:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-14 01:44:39,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 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-10-14 01:44:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2024-10-14 01:44:39,101 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2024-10-14 01:44:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:39,102 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-14 01:44:39,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2024-10-14 01:44:39,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 01:44:39,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:39,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:39,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 01:44:39,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:39,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:39,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2044429669, now seen corresponding path program 1 times [2024-10-14 01:44:39,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:39,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793693776] [2024-10-14 01:44:39,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:39,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:39,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:39,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793693776] [2024-10-14 01:44:39,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793693776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 01:44:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102615317] [2024-10-14 01:44:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:39,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:44:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:44:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:44:39,260 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:39,310 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2024-10-14 01:44:39,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:44:39,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 01:44:39,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:39,311 INFO L225 Difference]: With dead ends: 27 [2024-10-14 01:44:39,311 INFO L226 Difference]: Without dead ends: 18 [2024-10-14 01:44:39,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:39,313 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:39,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:39,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-10-14 01:44:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-10-14 01:44:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 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-10-14 01:44:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2024-10-14 01:44:39,316 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 8 [2024-10-14 01:44:39,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:39,317 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2024-10-14 01:44:39,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:39,317 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2024-10-14 01:44:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 01:44:39,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:39,318 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:39,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 01:44:39,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:39,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 32114, now seen corresponding path program 1 times [2024-10-14 01:44:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695438488] [2024-10-14 01:44:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:39,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:39,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695438488] [2024-10-14 01:44:39,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695438488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:39,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:39,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:44:39,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997828278] [2024-10-14 01:44:39,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:39,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:44:39,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:39,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:44:39,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:44:39,627 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:39,687 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-10-14 01:44:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:44:39,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 01:44:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:39,688 INFO L225 Difference]: With dead ends: 28 [2024-10-14 01:44:39,688 INFO L226 Difference]: Without dead ends: 26 [2024-10-14 01:44:39,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:39,689 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:39,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 27 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-14 01:44:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-10-14 01:44:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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-10-14 01:44:39,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-14 01:44:39,696 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2024-10-14 01:44:39,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:39,696 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-14 01:44:39,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:39,696 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-10-14 01:44:39,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 01:44:39,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:39,697 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:39,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 01:44:39,697 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:39,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:39,699 INFO L85 PathProgramCache]: Analyzing trace with hash 34036, now seen corresponding path program 1 times [2024-10-14 01:44:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968972630] [2024-10-14 01:44:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:39,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:39,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:39,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968972630] [2024-10-14 01:44:39,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968972630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 01:44:39,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 01:44:39,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 01:44:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980021820] [2024-10-14 01:44:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 01:44:39,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 01:44:39,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 01:44:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 01:44:39,914 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:39,977 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-10-14 01:44:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 01:44:39,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 01:44:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:39,977 INFO L225 Difference]: With dead ends: 30 [2024-10-14 01:44:39,977 INFO L226 Difference]: Without dead ends: 23 [2024-10-14 01:44:39,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 01:44:39,979 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:39,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-14 01:44:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-10-14 01:44:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 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-10-14 01:44:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-14 01:44:39,985 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 13 [2024-10-14 01:44:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:39,985 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-14 01:44:39,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-14 01:44:39,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 01:44:39,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:39,986 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:39,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 01:44:39,986 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:39,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash -293740875, now seen corresponding path program 1 times [2024-10-14 01:44:39,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:39,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437957737] [2024-10-14 01:44:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:39,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:40,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:40,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437957737] [2024-10-14 01:44:40,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437957737] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:40,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467338729] [2024-10-14 01:44:40,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:40,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:40,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:40,382 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-10-14 01:44:40,383 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-10-14 01:44:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:40,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 01:44:40,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:40,547 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 30 treesize of output 11 [2024-10-14 01:44:40,553 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:40,562 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 30 treesize of output 11 [2024-10-14 01:44:40,568 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 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 01:44:40,633 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 0 case distinctions, treesize of input 34 treesize of output 22 [2024-10-14 01:44:40,638 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:40,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:40,717 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 18 treesize of output 16 [2024-10-14 01:44:40,723 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 18 treesize of output 16 [2024-10-14 01:44:40,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:40,733 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 1 case distinctions, treesize of input 16 treesize of output 10 [2024-10-14 01:44:40,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:40,739 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 1 case distinctions, treesize of input 16 treesize of output 10 [2024-10-14 01:44:40,742 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 22 treesize of output 18 [2024-10-14 01:44:40,744 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 24 treesize of output 20 [2024-10-14 01:44:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:40,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467338729] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:40,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:40,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-10-14 01:44:40,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755870653] [2024-10-14 01:44:40,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:40,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 01:44:40,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:40,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 01:44:40,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 01:44:40,759 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:40,824 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-10-14 01:44:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 01:44:40,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-14 01:44:40,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:40,827 INFO L225 Difference]: With dead ends: 41 [2024-10-14 01:44:40,827 INFO L226 Difference]: Without dead ends: 27 [2024-10-14 01:44:40,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 01:44:40,829 INFO L432 NwaCegarLoop]: 15 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, 60 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-10-14 01:44:40,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 60 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 01:44:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-14 01:44:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-14 01:44:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-14 01:44:40,837 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 18 [2024-10-14 01:44:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:40,837 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-14 01:44:40,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-14 01:44:40,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 01:44:40,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:40,838 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:40,860 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-10-14 01:44:41,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:41,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:41,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash 879356546, now seen corresponding path program 2 times [2024-10-14 01:44:41,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:41,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009866585] [2024-10-14 01:44:41,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:41,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:41,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:41,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009866585] [2024-10-14 01:44:41,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009866585] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:41,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397657895] [2024-10-14 01:44:41,497 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:44:41,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:41,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:41,499 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-10-14 01:44:41,500 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-10-14 01:44:41,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:44:41,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:41,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-14 01:44:41,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:41,614 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 27 treesize of output 1 [2024-10-14 01:44:41,619 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-10-14 01:44:41,624 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 10 treesize of output 9 [2024-10-14 01:44:41,629 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-10-14 01:44:41,683 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:41,689 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 30 treesize of output 11 [2024-10-14 01:44:41,700 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 34 treesize of output 15 [2024-10-14 01:44:41,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:41,710 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 30 treesize of output 17 [2024-10-14 01:44:41,714 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 0 case distinctions, treesize of input 53 treesize of output 26 [2024-10-14 01:44:41,727 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2024-10-14 01:44:41,727 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 23 treesize of output 23 [2024-10-14 01:44:41,815 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:41,820 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 0 case distinctions, treesize of input 64 treesize of output 40 [2024-10-14 01:44:41,824 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 33 treesize of output 21 [2024-10-14 01:44:41,830 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-10-14 01:44:41,855 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 25 treesize of output 17 [2024-10-14 01:44:41,859 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 17 treesize of output 9 [2024-10-14 01:44:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:41,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:41,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397657895] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:41,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:41,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-10-14 01:44:41,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099791620] [2024-10-14 01:44:41,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:41,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 01:44:41,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:41,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 01:44:41,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:44:41,987 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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-10-14 01:44:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:42,152 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-10-14 01:44:42,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:44:42,152 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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 23 [2024-10-14 01:44:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:42,153 INFO L225 Difference]: With dead ends: 38 [2024-10-14 01:44:42,153 INFO L226 Difference]: Without dead ends: 36 [2024-10-14 01:44:42,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 01:44:42,154 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:42,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 69 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-14 01:44:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2024-10-14 01:44:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-10-14 01:44:42,158 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2024-10-14 01:44:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:42,158 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-10-14 01:44:42,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 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-10-14 01:44:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-10-14 01:44:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 01:44:42,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:42,159 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 01:44:42,171 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-10-14 01:44:42,359 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,SelfDestructingSolverStorable5 [2024-10-14 01:44:42,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:42,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:42,360 INFO L85 PathProgramCache]: Analyzing trace with hash 879358468, now seen corresponding path program 1 times [2024-10-14 01:44:42,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:42,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460678548] [2024-10-14 01:44:42,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:42,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:42,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:42,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460678548] [2024-10-14 01:44:42,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460678548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:42,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088658000] [2024-10-14 01:44:42,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:42,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:42,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:42,778 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-10-14 01:44:42,780 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-10-14 01:44:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:42,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-14 01:44:42,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:42,893 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 27 treesize of output 1 [2024-10-14 01:44:42,897 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-10-14 01:44:42,900 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 10 treesize of output 9 [2024-10-14 01:44:42,904 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-10-14 01:44:42,939 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:42,945 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 34 treesize of output 15 [2024-10-14 01:44:42,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:42,952 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 30 treesize of output 17 [2024-10-14 01:44:42,959 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 0 case distinctions, treesize of input 53 treesize of output 26 [2024-10-14 01:44:42,969 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2024-10-14 01:44:42,969 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 23 treesize of output 23 [2024-10-14 01:44:42,977 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 30 treesize of output 11 [2024-10-14 01:44:43,055 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 0 case distinctions, treesize of input 64 treesize of output 40 [2024-10-14 01:44:43,058 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 33 treesize of output 21 [2024-10-14 01:44:43,064 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-10-14 01:44:43,067 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:43,088 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 25 treesize of output 17 [2024-10-14 01:44:43,092 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 17 treesize of output 9 [2024-10-14 01:44:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:43,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:43,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088658000] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:43,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:43,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-10-14 01:44:43,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578539203] [2024-10-14 01:44:43,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:43,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 01:44:43,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:43,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 01:44:43,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-14 01:44:43,199 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:43,353 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-14 01:44:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 01:44:43,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 01:44:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:43,353 INFO L225 Difference]: With dead ends: 40 [2024-10-14 01:44:43,353 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 01:44:43,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 01:44:43,354 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:43,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 79 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:43,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 01:44:43,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2024-10-14 01:44:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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-10-14 01:44:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-14 01:44:43,358 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 23 [2024-10-14 01:44:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:43,358 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-14 01:44:43,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-14 01:44:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 01:44:43,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:43,358 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-10-14 01:44:43,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 01:44:43,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:43,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:43,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash 792599461, now seen corresponding path program 3 times [2024-10-14 01:44:43,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:43,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770955677] [2024-10-14 01:44:43,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:43,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:44,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:44,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770955677] [2024-10-14 01:44:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770955677] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496561945] [2024-10-14 01:44:44,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 01:44:44,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:44,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:44,173 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-10-14 01:44:44,175 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-10-14 01:44:44,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-14 01:44:44,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:44,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-14 01:44:44,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:44,316 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 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 01:44:44,319 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 10 treesize of output 9 [2024-10-14 01:44:44,325 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 30 treesize of output 11 [2024-10-14 01:44:44,329 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 30 treesize of output 11 [2024-10-14 01:44:44,333 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:44,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:44,376 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 46 treesize of output 30 [2024-10-14 01:44:44,380 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 0 case distinctions, treesize of input 62 treesize of output 31 [2024-10-14 01:44:44,391 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-10-14 01:44:44,392 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 1 case distinctions, treesize of input 46 treesize of output 30 [2024-10-14 01:44:44,403 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2024-10-14 01:44:44,404 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 23 treesize of output 23 [2024-10-14 01:44:44,412 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:44,502 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 0 case distinctions, treesize of input 77 treesize of output 49 [2024-10-14 01:44:44,512 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:44,594 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 0 case distinctions, treesize of input 50 treesize of output 34 [2024-10-14 01:44:44,598 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:44,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:44,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:44,868 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 122 treesize of output 126 [2024-10-14 01:44:44,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:44,885 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 111 treesize of output 116 [2024-10-14 01:44:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:44,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496561945] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:44,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:44,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-14 01:44:44,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947269014] [2024-10-14 01:44:44,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:44,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 01:44:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:44,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 01:44:44,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-14 01:44:44,935 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 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-10-14 01:44:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:45,064 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-10-14 01:44:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 01:44:45,064 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-14 01:44:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:45,065 INFO L225 Difference]: With dead ends: 56 [2024-10-14 01:44:45,065 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 01:44:45,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-14 01:44:45,065 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:45,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 125 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 01:44:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 01:44:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-14 01:44:45,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 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-10-14 01:44:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-10-14 01:44:45,069 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 28 [2024-10-14 01:44:45,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:45,069 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-10-14 01:44:45,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 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-10-14 01:44:45,069 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-10-14 01:44:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 01:44:45,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:45,070 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-10-14 01:44:45,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 01:44:45,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:45,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:45,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:45,271 INFO L85 PathProgramCache]: Analyzing trace with hash 217811762, now seen corresponding path program 4 times [2024-10-14 01:44:45,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:45,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904584794] [2024-10-14 01:44:45,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:46,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:46,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904584794] [2024-10-14 01:44:46,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904584794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:46,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744435112] [2024-10-14 01:44:46,408 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 01:44:46,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:46,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:46,411 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-10-14 01:44:46,412 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-10-14 01:44:46,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 01:44:46,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:46,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-10-14 01:44:46,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:46,549 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-10-14 01:44:46,551 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 27 treesize of output 1 [2024-10-14 01:44:46,553 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 10 treesize of output 9 [2024-10-14 01:44:46,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 01:44:46,621 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 30 treesize of output 11 [2024-10-14 01:44:46,625 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:46,633 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 34 treesize of output 15 [2024-10-14 01:44:46,638 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 0 case distinctions, treesize of input 53 treesize of output 26 [2024-10-14 01:44:46,649 INFO L349 Elim1Store]: treesize reduction 37, result has 43.9 percent of original size [2024-10-14 01:44:46,650 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 34 treesize of output 37 [2024-10-14 01:44:46,655 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 5 [2024-10-14 01:44:46,673 INFO L349 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2024-10-14 01:44:46,674 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 33 treesize of output 45 [2024-10-14 01:44:46,763 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 0 case distinctions, treesize of input 116 treesize of output 73 [2024-10-14 01:44:46,773 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-10-14 01:44:46,774 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 1 case distinctions, treesize of input 46 treesize of output 30 [2024-10-14 01:44:46,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:46,782 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 101 treesize of output 42 [2024-10-14 01:44:46,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:46,791 INFO L349 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2024-10-14 01:44:46,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2024-10-14 01:44:46,797 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 38 treesize of output 25 [2024-10-14 01:44:46,806 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:46,919 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 0 case distinctions, treesize of input 111 treesize of output 75 [2024-10-14 01:44:46,931 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:47,026 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 0 case distinctions, treesize of input 50 treesize of output 34 [2024-10-14 01:44:47,028 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:47,039 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:47,039 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 72 treesize of output 39 [2024-10-14 01:44:47,045 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:44:47,061 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 25 treesize of output 17 [2024-10-14 01:44:47,065 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 17 treesize of output 9 [2024-10-14 01:44:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:47,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:47,213 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:47,214 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 57 treesize of output 55 [2024-10-14 01:44:47,219 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:47,221 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 40 treesize of output 38 [2024-10-14 01:44:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:47,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744435112] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:47,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:47,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 17 [2024-10-14 01:44:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522795487] [2024-10-14 01:44:47,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:47,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 01:44:47,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 01:44:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2024-10-14 01:44:47,334 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:47,798 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-10-14 01:44:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:44:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-14 01:44:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:47,799 INFO L225 Difference]: With dead ends: 48 [2024-10-14 01:44:47,799 INFO L226 Difference]: Without dead ends: 46 [2024-10-14 01:44:47,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=156, Invalid=493, Unknown=1, NotChecked=0, Total=650 [2024-10-14 01:44:47,800 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:47,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 117 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 01:44:47,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-14 01:44:47,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-10-14 01:44:47,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-10-14 01:44:47,807 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 33 [2024-10-14 01:44:47,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:47,807 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-10-14 01:44:47,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.764705882352941) internal successors, (81), 17 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:47,808 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-10-14 01:44:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 01:44:47,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:47,809 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 01:44:47,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 01:44:48,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:48,010 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:48,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:48,010 INFO L85 PathProgramCache]: Analyzing trace with hash 217813684, now seen corresponding path program 2 times [2024-10-14 01:44:48,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:48,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359179112] [2024-10-14 01:44:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:48,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:49,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:49,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359179112] [2024-10-14 01:44:49,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359179112] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:49,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354745076] [2024-10-14 01:44:49,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 01:44:49,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:49,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:49,034 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-10-14 01:44:49,035 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-10-14 01:44:49,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 01:44:49,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:49,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-10-14 01:44:49,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:49,177 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-10-14 01:44:49,182 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-10-14 01:44:49,185 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 27 treesize of output 1 [2024-10-14 01:44:49,187 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 10 treesize of output 9 [2024-10-14 01:44:49,217 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:49,222 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 30 treesize of output 11 [2024-10-14 01:44:49,228 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 34 treesize of output 15 [2024-10-14 01:44:49,231 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 0 case distinctions, treesize of input 53 treesize of output 26 [2024-10-14 01:44:49,246 INFO L349 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2024-10-14 01:44:49,246 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 33 treesize of output 45 [2024-10-14 01:44:49,255 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 34 treesize of output 21 [2024-10-14 01:44:49,355 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 0 case distinctions, treesize of input 116 treesize of output 73 [2024-10-14 01:44:49,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:49,363 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 101 treesize of output 42 [2024-10-14 01:44:49,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:49,375 INFO L349 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2024-10-14 01:44:49,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2024-10-14 01:44:49,379 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 38 treesize of output 25 [2024-10-14 01:44:49,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:49,387 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 46 treesize of output 30 [2024-10-14 01:44:49,392 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:49,496 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 0 case distinctions, treesize of input 111 treesize of output 75 [2024-10-14 01:44:49,508 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:49,608 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 0 case distinctions, treesize of input 50 treesize of output 34 [2024-10-14 01:44:49,615 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 01:44:49,615 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 72 treesize of output 39 [2024-10-14 01:44:49,622 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 01:44:49,627 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:49,642 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 25 treesize of output 17 [2024-10-14 01:44:49,646 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 17 treesize of output 9 [2024-10-14 01:44:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:49,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:49,827 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:49,830 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:49,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2024-10-14 01:44:49,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:49,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:49,847 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 01:44:49,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2024-10-14 01:44:49,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:49,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354745076] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 01:44:49,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 01:44:49,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2024-10-14 01:44:49,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678483914] [2024-10-14 01:44:49,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 01:44:49,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-14 01:44:49,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 01:44:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-14 01:44:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=251, Unknown=1, NotChecked=0, Total=306 [2024-10-14 01:44:49,940 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 18 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 01:44:50,343 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2024-10-14 01:44:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 01:44:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 18 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-14 01:44:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 01:44:50,344 INFO L225 Difference]: With dead ends: 50 [2024-10-14 01:44:50,344 INFO L226 Difference]: Without dead ends: 43 [2024-10-14 01:44:50,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=536, Unknown=1, NotChecked=0, Total=702 [2024-10-14 01:44:50,345 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 60 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 01:44:50,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 121 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 01:44:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-14 01:44:50,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-10-14 01:44:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 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-10-14 01:44:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-10-14 01:44:50,352 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 33 [2024-10-14 01:44:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 01:44:50,352 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-10-14 01:44:50,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 18 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 01:44:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-10-14 01:44:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-14 01:44:50,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 01:44:50,353 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2024-10-14 01:44:50,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 01:44:50,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:50,559 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 01:44:50,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 01:44:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1023764725, now seen corresponding path program 5 times [2024-10-14 01:44:50,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 01:44:50,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826963518] [2024-10-14 01:44:50,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 01:44:50,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 01:44:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 01:44:51,595 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:51,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 01:44:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826963518] [2024-10-14 01:44:51,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826963518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 01:44:51,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841925472] [2024-10-14 01:44:51,596 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 01:44:51,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 01:44:51,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 01:44:51,597 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-10-14 01:44:51,598 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-10-14 01:44:51,818 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-10-14 01:44:51,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 01:44:51,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-10-14 01:44:51,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 01:44:51,848 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 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 01:44:51,850 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:51,853 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 30 treesize of output 11 [2024-10-14 01:44:51,857 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 30 treesize of output 11 [2024-10-14 01:44:51,862 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 10 treesize of output 9 [2024-10-14 01:44:51,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:51,903 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 46 treesize of output 30 [2024-10-14 01:44:51,909 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 0 case distinctions, treesize of input 62 treesize of output 31 [2024-10-14 01:44:51,924 INFO L349 Elim1Store]: treesize reduction 49, result has 23.4 percent of original size [2024-10-14 01:44:51,924 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 1 case distinctions, treesize of input 46 treesize of output 30 [2024-10-14 01:44:51,942 INFO L349 Elim1Store]: treesize reduction 50, result has 37.5 percent of original size [2024-10-14 01:44:51,942 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 33 treesize of output 45 [2024-10-14 01:44:51,954 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 27 treesize of output 1 [2024-10-14 01:44:51,958 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:52,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:52,072 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2024-10-14 01:44:52,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 60 [2024-10-14 01:44:52,078 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 0 case distinctions, treesize of input 123 treesize of output 72 [2024-10-14 01:44:52,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:52,091 INFO L349 Elim1Store]: treesize reduction 61, result has 23.8 percent of original size [2024-10-14 01:44:52,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 52 [2024-10-14 01:44:52,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:52,100 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 34 treesize of output 21 [2024-10-14 01:44:52,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 01:44:52,112 INFO L349 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2024-10-14 01:44:52,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 30 [2024-10-14 01:44:52,122 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:52,269 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:52,272 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 0 case distinctions, treesize of input 145 treesize of output 101 [2024-10-14 01:44:52,406 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 0 case distinctions, treesize of input 50 treesize of output 34 [2024-10-14 01:44:52,408 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:52,546 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 0 case distinctions, treesize of input 54 treesize of output 38 [2024-10-14 01:44:52,556 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-10-14 01:44:52,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2024-10-14 01:44:52,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-14 01:44:52,565 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 01:44:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 01:44:52,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 01:44:53,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:53,220 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 572 treesize of output 565 [2024-10-14 01:44:53,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:44:53,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1038 treesize of output 1357 [2024-10-14 01:44:53,287 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 722 treesize of output 645 [2024-10-14 01:44:53,297 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 645 treesize of output 568 [2024-10-14 01:45:00,520 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse4 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (not (= (select |c_#valid| v_prenex_10) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (= (let ((.cse1 (store .cse4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse3 (+ 4 (select v_ArrVal_944 4)))) (select (select .cse1 (select (select (store .cse2 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse2 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse3)) (+ (select (select .cse1 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse3) 4))) 0)) (= (let ((.cse5 (store .cse4 v_prenex_10 v_prenex_8)) (.cse6 (+ (select v_prenex_8 4) 4))) (select (select .cse5 (select (select (store .cse2 v_prenex_10 (store (store (select .cse2 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse6)) (+ (select (select .cse5 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse6) 4))) 0) (not (= (store (store (select .cse4 v_prenex_10) 4 0) 0 (select v_prenex_8 0)) v_prenex_8))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse16 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse13 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse8 (let ((.cse17 (store .cse13 v_prenex_10 v_prenex_8)) (.cse18 (+ (select v_prenex_8 4) 4))) (select (select .cse17 (select (select (store .cse16 v_prenex_10 (store (store (select .cse16 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse18)) (+ (select (select .cse17 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse18) 4))))) (or (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (let ((.cse14 (store .cse13 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse10 (store .cse16 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse16 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))) (.cse15 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse11 (select (select .cse10 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse15)) (.cse12 (+ (select (select .cse14 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse15) 4))) (let ((.cse9 (select (select .cse14 .cse11) .cse12))) (or (= .cse8 .cse9) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (= .cse9 0) (= (select (select .cse10 .cse11) .cse12) 0) (not (= v_ArrVal_944 (store (store (select .cse13 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0))))))))) (= .cse8 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse24 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse25 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int)) (or (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| 1) |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|))) (forall ((v_ArrVal_944 (Array Int Int))) (or (forall ((v_ArrVal_941 Int)) (let ((.cse19 (store .cse25 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse22 (store .cse24 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse24 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))) (.cse23 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse20 (select (select .cse22 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse23)) (.cse21 (+ (select (select .cse19 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse23) 4))) (or (= (select (select .cse19 .cse20) .cse21) 0) (= (select (select .cse22 .cse20) .cse21) 0))))) (not (= v_ArrVal_944 (store (store (select .cse25 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0)))))))) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (let ((.cse27 (+ (select v_prenex_8 4) 4))) (select (let ((.cse26 (store .cse24 v_prenex_10 (store (store (select .cse24 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)))) (select .cse26 (select (select .cse26 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse27))) (+ (select (select (store .cse25 v_prenex_10 v_prenex_8) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse27) 4))))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_944 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int)) (let ((.cse40 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse36 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse38 (store .cse36 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse32 (store .cse40 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse40 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))) (.cse39 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse28 (store .cse36 v_prenex_10 v_prenex_8)) (.cse35 (store .cse40 v_prenex_10 (store (store (select .cse40 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11))) (.cse37 (+ (select v_prenex_8 4) 4)) (.cse33 (select (select .cse32 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse39)) (.cse34 (+ (select (select .cse38 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse39) 4))) (let ((.cse31 (select (select .cse38 .cse33) .cse34)) (.cse29 (select (select .cse35 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse37)) (.cse30 (+ (select (select .cse28 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse37) 4))) (or (= (select (select .cse28 .cse29) .cse30) .cse31) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (= .cse31 0) (= (select (select .cse32 .cse33) .cse34) 0) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (select (select .cse35 .cse29) .cse30)) (not (= v_ArrVal_944 (store (store (select .cse36 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0)))))))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)) (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse42 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse44 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (= (let ((.cse41 (store .cse44 v_prenex_10 v_prenex_8)) (.cse43 (+ (select v_prenex_8 4) 4))) (select (select .cse41 (select (select (store .cse42 v_prenex_10 (store (store (select .cse42 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse43)) (+ (select (select .cse41 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse43) 4))) 0) (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (let ((.cse45 (store .cse44 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse48 (store .cse42 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse42 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))) (.cse49 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse46 (select (select .cse48 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse49)) (.cse47 (+ (select (select .cse45 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse49) 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (= (select (select .cse45 .cse46) .cse47) 0) (= (select (select .cse48 .cse46) .cse47) 0) (not (= v_ArrVal_944 (store (store (select .cse44 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0))))))))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse55 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse56 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse57 (store .cse56 v_prenex_10 v_prenex_8)) (.cse50 (store .cse55 v_prenex_10 (store (store (select .cse55 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11))) (.cse58 (+ (select v_prenex_8 4) 4))) (let ((.cse51 (select (select .cse50 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse58)) (.cse52 (+ (select (select .cse57 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse58) 4))) (or (not (= (select |c_#valid| v_prenex_10) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (= (select (select .cse50 .cse51) .cse52) (let ((.cse54 (+ 4 (select v_ArrVal_944 4)))) (select (let ((.cse53 (store .cse55 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse55 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)))) (select .cse53 (select (select .cse53 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse54))) (+ (select (select (store .cse56 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse54) 4))))) (= (select (select .cse57 .cse51) .cse52) 0) (not (= (store (store (select .cse56 v_prenex_10) 4 0) 0 (select v_prenex_8 0)) v_prenex_8))))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_931 Int)) (let ((.cse62 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_941 Int)) (let ((.cse60 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937))) (let ((.cse63 (store .cse62 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse67 (store .cse60 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse60 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))) (.cse68 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse64 (select (select .cse67 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse68)) (.cse65 (+ (select (select .cse63 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse68) 4))) (let ((.cse66 (select (select .cse67 .cse64) .cse65))) (or (= (let ((.cse59 (store .cse62 v_prenex_10 v_prenex_8)) (.cse61 (+ (select v_prenex_8 4) 4))) (select (select .cse59 (select (select (store .cse60 v_prenex_10 (store (store (select .cse60 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse61)) (+ (select (select .cse59 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse61) 4))) (select (select .cse63 .cse64) .cse65)) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| .cse66) (= .cse66 0))))))) (not (= v_ArrVal_944 (store (store (select .cse62 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0))))))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse77 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse74 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse69 (let ((.cse78 (store .cse74 v_prenex_10 v_prenex_8)) (.cse79 (+ (select v_prenex_8 4) 4))) (select (select .cse78 (select (select (store .cse77 v_prenex_10 (store (store (select .cse77 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse79)) (+ (select (select .cse78 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse79) 4))))) (or (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (let ((.cse70 (store .cse74 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse75 (store .cse77 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse77 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))) (.cse76 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse71 (select (select .cse75 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse76)) (.cse72 (+ (select (select .cse70 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse76) 4))) (let ((.cse73 (select (select .cse75 .cse71) .cse72))) (or (= .cse69 (select (select .cse70 .cse71) .cse72)) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| .cse73) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (= .cse73 0) (not (= v_ArrVal_944 (store (store (select .cse74 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0))))))))) (= .cse69 0))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse82 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse83 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (let ((.cse81 (+ (select v_prenex_8 4) 4))) (select (let ((.cse80 (store .cse82 v_prenex_10 (store (store (select .cse82 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)))) (select .cse80 (select (select .cse80 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse81))) (+ (select (select (store .cse83 v_prenex_10 v_prenex_8) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse81) 4)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int)) (or (not (= 0 (select (store |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| 1) |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|))) (forall ((v_ArrVal_944 (Array Int Int))) (or (forall ((v_ArrVal_941 Int)) (let ((.cse84 (let ((.cse86 (+ 4 (select v_ArrVal_944 4)))) (select (let ((.cse85 (store .cse82 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse82 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)))) (select .cse85 (select (select .cse85 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse86))) (+ (select (select (store .cse83 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse86) 4))))) (or (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| .cse84) (= .cse84 0)))) (not (= v_ArrVal_944 (store (store (select .cse83 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0))))))))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse92 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse87 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse89 (let ((.cse94 (+ (select v_prenex_8 4) 4))) (select (let ((.cse93 (store .cse92 v_prenex_10 (store (store (select .cse92 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)))) (select .cse93 (select (select .cse93 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse94))) (+ (select (select (store .cse87 v_prenex_10 v_prenex_8) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse94) 4))))) (or (forall ((v_ArrVal_944 (Array Int Int))) (or (not (= v_ArrVal_944 (store (store (select .cse87 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0)))) (forall ((v_ArrVal_941 Int)) (let ((.cse88 (let ((.cse91 (+ 4 (select v_ArrVal_944 4)))) (select (let ((.cse90 (store .cse92 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse92 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)))) (select .cse90 (select (select .cse90 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse91))) (+ (select (select (store .cse87 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse91) 4))))) (or (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| .cse88) (= .cse88 0) (= .cse89 .cse88)))))) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| .cse89))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse102 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse96 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse103 (store .cse96 v_prenex_10 v_prenex_8)) (.cse97 (store .cse102 v_prenex_10 (store (store (select .cse102 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11))) (.cse104 (+ (select v_prenex_8 4) 4))) (let ((.cse98 (select (select .cse97 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse104)) (.cse99 (+ (select (select .cse103 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse104) 4))) (or (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (let ((.cse95 (let ((.cse101 (+ 4 (select v_ArrVal_944 4)))) (select (let ((.cse100 (store .cse102 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse102 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)))) (select .cse100 (select (select .cse100 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse101))) (+ (select (select (store .cse96 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse101) 4))))) (or (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| .cse95) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (= .cse95 0) (not (= v_ArrVal_944 (store (store (select .cse96 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0)))) (= (select (select .cse97 .cse98) .cse99) .cse95)))) (= (select (select .cse103 .cse98) .cse99) 0)))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse109 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse106 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (let ((.cse105 (let ((.cse108 (+ 4 (select v_ArrVal_944 4)))) (select (let ((.cse107 (store .cse109 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse109 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)))) (select .cse107 (select (select .cse107 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse108))) (+ (select (select (store .cse106 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse108) 4))))) (or (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| .cse105) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (= .cse105 0) (not (= v_ArrVal_944 (store (store (select .cse106 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0))))))) (= (let ((.cse110 (store .cse106 v_prenex_10 v_prenex_8)) (.cse111 (+ (select v_prenex_8 4) 4))) (select (select .cse110 (select (select (store .cse109 v_prenex_10 (store (store (select .cse109 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse111)) (+ (select (select .cse110 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse111) 4))) 0)))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)) (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_931 Int)) (let ((.cse115 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_941 Int)) (let ((.cse113 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937))) (let ((.cse120 (store .cse115 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse117 (store .cse113 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse113 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))) (.cse121 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse118 (select (select .cse117 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse121)) (.cse119 (+ (select (select .cse120 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse121) 4))) (let ((.cse116 (select (select .cse120 .cse118) .cse119))) (or (= (let ((.cse112 (store .cse115 v_prenex_10 v_prenex_8)) (.cse114 (+ (select v_prenex_8 4) 4))) (select (select .cse112 (select (select (store .cse113 v_prenex_10 (store (store (select .cse113 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse114)) (+ (select (select .cse112 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse114) 4))) .cse116) (= .cse116 0) (= (select (select .cse117 .cse118) .cse119) 0))))))) (not (= v_ArrVal_944 (store (store (select .cse115 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0))))))))))))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int)) (let ((.cse123 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse122 (let ((.cse125 (+ 4 (select v_ArrVal_944 4)))) (select (let ((.cse124 (let ((.cse126 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937))) (store .cse126 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse126 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))))) (select .cse124 (select (select .cse124 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse125))) (+ (select (select (store .cse123 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse125) 4))))) (or (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| .cse122) (not (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| .cse122)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (= .cse122 0) (not (= v_ArrVal_944 (store (store (select .cse123 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0)))))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int)) (let ((.cse131 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse128 (store .cse131 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse132 (let ((.cse134 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937))) (store .cse134 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse134 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)))) (.cse133 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse129 (select (select .cse132 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse133)) (.cse130 (+ (select (select .cse128 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse133) 4))) (let ((.cse127 (select (select .cse132 .cse129) .cse130))) (or (not (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| .cse127)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (= (select (select .cse128 .cse129) .cse130) 0) (= .cse127 0) (not (= v_ArrVal_944 (store (store (select .cse131 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int)) (let ((.cse141 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse139 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse138 (store .cse139 v_prenex_10 v_prenex_8)) (.cse135 (store .cse141 v_prenex_10 (store (store (select .cse141 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11))) (.cse140 (+ (select v_prenex_8 4) 4))) (let ((.cse136 (select (select .cse135 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse140)) (.cse137 (+ (select (select .cse138 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse140) 4))) (or (not (= v_prenex_10 (select (select .cse135 .cse136) .cse137))) (not (= (select |c_#valid| v_prenex_10) 0)) (= (select (select .cse138 .cse136) .cse137) 0) (not (= (store (store (select .cse139 v_prenex_10) 4 0) 0 (select v_prenex_8 0)) v_prenex_8)))))) (= (let ((.cse142 (store .cse139 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse143 (+ 4 (select v_ArrVal_944 4)))) (select (select .cse142 (select (select (store .cse141 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse141 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse143)) (+ (select (select .cse142 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse143) 4))) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse146 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse147 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (let ((.cse145 (+ 4 (select v_ArrVal_944 4)))) (select (let ((.cse144 (store .cse146 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse146 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)))) (select .cse144 (select (select .cse144 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse145))) (+ (select (select (store .cse147 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse145) 4))))) (not (= (select |c_#valid| v_prenex_10) 0)) (= (let ((.cse148 (store .cse147 v_prenex_10 v_prenex_8)) (.cse149 (+ (select v_prenex_8 4) 4))) (select (select .cse148 (select (select (store .cse146 v_prenex_10 (store (store (select .cse146 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse149)) (+ (select (select .cse148 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse149) 4))) 0) (not (= (store (store (select .cse147 v_prenex_10) 4 0) 0 (select v_prenex_8 0)) v_prenex_8))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse160 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse154 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse161 (store .cse154 v_prenex_10 v_prenex_8)) (.cse155 (store .cse160 v_prenex_10 (store (store (select .cse160 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11))) (.cse162 (+ (select v_prenex_8 4) 4))) (let ((.cse156 (select (select .cse155 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse162)) (.cse157 (+ (select (select .cse161 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse162) 4))) (or (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (let ((.cse150 (store .cse154 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse158 (store .cse160 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse160 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))) (.cse159 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse151 (select (select .cse158 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse159)) (.cse152 (+ (select (select .cse150 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse159) 4))) (let ((.cse153 (select (select .cse158 .cse151) .cse152))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (= (select (select .cse150 .cse151) .cse152) 0) (= .cse153 0) (not (= v_ArrVal_944 (store (store (select .cse154 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0)))) (= (select (select .cse155 .cse156) .cse157) .cse153)))))) (= (select (select .cse161 .cse156) .cse157) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((v_prenex_10 Int)) (or (not (= (select |c_#valid| v_prenex_10) 0)) (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_931 Int)) (let ((.cse169 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((v_prenex_11 Int)) (let ((.cse166 (store .cse169 v_prenex_10 v_prenex_8)) (.cse163 (let ((.cse168 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937))) (store .cse168 v_prenex_10 (store (store (select .cse168 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)))) (.cse167 (+ (select v_prenex_8 4) 4))) (let ((.cse164 (select (select .cse163 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse167)) (.cse165 (+ (select (select .cse166 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse167) 4))) (or (not (= v_prenex_10 (select (select .cse163 .cse164) .cse165))) (= (select (select .cse166 .cse164) .cse165) 0))))) (not (= (store (store (select .cse169 v_prenex_10) 4 0) 0 (select v_prenex_8 0)) v_prenex_8))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse177 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse178 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse174 (let ((.cse180 (+ (select v_prenex_8 4) 4))) (select (let ((.cse179 (store .cse177 v_prenex_10 (store (store (select .cse177 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)))) (select .cse179 (select (select .cse179 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse180))) (+ (select (select (store .cse178 v_prenex_10 v_prenex_8) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse180) 4))))) (or (forall ((v_ArrVal_944 (Array Int Int))) (or (forall ((v_ArrVal_941 Int)) (let ((.cse170 (store .cse178 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse175 (store .cse177 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse177 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))) (.cse176 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse171 (select (select .cse175 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse176)) (.cse172 (+ (select (select .cse170 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse176) 4))) (let ((.cse173 (select (select .cse175 .cse171) .cse172))) (or (= (select (select .cse170 .cse171) .cse172) 0) (= .cse173 0) (= .cse174 .cse173)))))) (not (= v_ArrVal_944 (store (store (select .cse178 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0)))))) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| .cse174))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_931 Int)) (let ((.cse183 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse185 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (let ((.cse181 (let ((.cse186 (store .cse185 v_prenex_10 v_prenex_8)) (.cse187 (+ (select v_prenex_8 4) 4))) (select (select .cse186 (select (select (store .cse183 v_prenex_10 (store (store (select .cse183 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse187)) (+ (select (select .cse186 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse187) 4))))) (or (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (= .cse181 (let ((.cse182 (store .cse185 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse184 (+ 4 (select v_ArrVal_944 4)))) (select (select .cse182 (select (select (store .cse183 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse183 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse184)) (+ (select (select .cse182 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse184) 4))))) (not (= (select |c_#valid| v_prenex_10) 0)) (= .cse181 0) (not (= (store (store (select .cse185 v_prenex_10) 4 0) 0 (select v_prenex_8 0)) v_prenex_8)))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_931 Int)) (let ((.cse195 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_941 Int)) (let ((.cse194 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937))) (let ((.cse188 (store .cse195 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse196 (store .cse194 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse194 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941))) (.cse197 (+ 4 (select v_ArrVal_944 4)))) (let ((.cse189 (select (select .cse196 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse197)) (.cse190 (+ (select (select .cse188 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse197) 4))) (let ((.cse191 (select (select .cse196 .cse189) .cse190))) (or (= (select (select .cse188 .cse189) .cse190) 0) (= .cse191 0) (= (let ((.cse193 (+ (select v_prenex_8 4) 4))) (select (let ((.cse192 (store .cse194 v_prenex_10 (store (store (select .cse194 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)))) (select .cse192 (select (select .cse192 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse193))) (+ (select (select (store .cse195 v_prenex_10 v_prenex_8) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse193) 4))) .cse191))))))) (not (= v_ArrVal_944 (store (store (select .cse195 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_931 Int)) (let ((.cse202 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int) (v_ArrVal_941 Int)) (let ((.cse201 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937))) (let ((.cse198 (let ((.cse204 (+ 4 (select v_ArrVal_944 4)))) (select (let ((.cse203 (store .cse201 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse201 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)))) (select .cse203 (select (select .cse203 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse204))) (+ (select (select (store .cse202 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse204) 4))))) (or (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| .cse198) (= .cse198 0) (= (let ((.cse200 (+ (select v_prenex_8 4) 4))) (select (let ((.cse199 (store .cse201 v_prenex_10 (store (store (select .cse201 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11)))) (select .cse199 (select (select .cse199 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse200))) (+ (select (select (store .cse202 v_prenex_10 v_prenex_8) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse200) 4))) .cse198))))) (not (= v_ArrVal_944 (store (store (select .cse202 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 0) 0 (select v_ArrVal_944 0))))))))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (forall ((v_prenex_10 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_931 Int)) (let ((.cse207 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse208 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (let ((.cse206 (+ 4 (select v_ArrVal_944 4)))) (select (let ((.cse205 (store .cse207 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse207 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)))) (select .cse205 (select (select .cse205 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse206))) (+ (select (select (store .cse208 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse206) 4))))) (forall ((v_prenex_11 Int)) (let ((.cse209 (store .cse208 v_prenex_10 v_prenex_8)) (.cse212 (store .cse207 v_prenex_10 (store (store (select .cse207 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11))) (.cse213 (+ (select v_prenex_8 4) 4))) (let ((.cse210 (select (select .cse212 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse213)) (.cse211 (+ (select (select .cse209 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse213) 4))) (or (= (select (select .cse209 .cse210) .cse211) 0) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (select (select .cse212 .cse210) .cse211)))))) (not (= (store (store (select .cse208 v_prenex_10) 4 0) 0 (select v_prenex_8 0)) v_prenex_8))))) (not (= (select |c_#valid| v_prenex_10) 0)))) (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((v_prenex_10 Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_ArrVal_931 Int)) (let ((.cse219 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse220 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (forall ((v_prenex_11 Int)) (let ((.cse214 (store .cse220 v_prenex_10 v_prenex_8)) (.cse217 (store .cse219 v_prenex_10 (store (store (select .cse219 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11))) (.cse218 (+ (select v_prenex_8 4) 4))) (let ((.cse215 (select (select .cse217 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse218)) (.cse216 (+ (select (select .cse214 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse218) 4))) (or (= (select (select .cse214 .cse215) .cse216) 0) (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (select (select .cse217 .cse215) .cse216)))))) (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_941 Int)) (= (let ((.cse221 (store .cse220 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944)) (.cse222 (+ 4 (select v_ArrVal_944 4)))) (select (select .cse221 (select (select (store .cse219 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse219 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse222)) (+ (select (select .cse221 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse222) 4))) 0)) (not (= (store (store (select .cse220 v_prenex_10) 4 0) 0 (select v_prenex_8 0)) v_prenex_8))))) (not (= (select |c_#valid| v_prenex_10) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))) (forall ((|v_ULTIMATE.start_append_to_list_~node~0#1.base_70| Int)) (or (forall ((v_ArrVal_937 (Array Int Int))) (or (not (= v_ArrVal_937 (store (store (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse0) 0 (select v_ArrVal_937 0)))) (forall ((v_ArrVal_944 (Array Int Int)) (|v_ULTIMATE.start_append_to_list_~node~0#1.base_71| Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int)) (let ((.cse225 (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| v_ArrVal_937)) (.cse226 (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (store (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 4 .cse7) 0 v_ArrVal_931)))) (or (= |v_ULTIMATE.start_append_to_list_~node~0#1.base_70| (let ((.cse224 (+ 4 (select v_ArrVal_944 4)))) (select (let ((.cse223 (store .cse225 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| (store (store (select .cse225 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71|) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_ArrVal_941)))) (select .cse223 (select (select .cse223 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse224))) (+ (select (select (store .cse226 |v_ULTIMATE.start_append_to_list_~node~0#1.base_71| v_ArrVal_944) |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse224) 4)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse230 (store .cse226 v_prenex_10 v_prenex_8)) (.cse227 (store .cse225 v_prenex_10 (store (store (select .cse225 v_prenex_10) 4 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0 v_prenex_11))) (.cse231 (+ (select v_prenex_8 4) 4))) (let ((.cse228 (select (select .cse227 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse231)) (.cse229 (+ (select (select .cse230 |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) .cse231) 4))) (or (not (= v_prenex_10 (select (select .cse227 .cse228) .cse229))) (not (= (select |c_#valid| v_prenex_10) 0)) (= (select (select .cse230 .cse228) .cse229) 0) (not (= (store (store (select .cse226 v_prenex_10) 4 0) 0 (select v_prenex_8 0)) v_prenex_8))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_to_list_~node~0#1.base_70|) 0)))))) is different from true [2024-10-14 01:45:31,475 WARN L286 SmtUtils]: Spent 24.40s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-10-14 01:45:31,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 01:45:31,477 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 2 case distinctions, treesize of input 13901 treesize of output 9122