./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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/list-simple/sll2c_insert_unequal.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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 23:45:35,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 23:45:35,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 23:45:35,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 23:45:35,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 23:45:36,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 23:45:36,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 23:45:36,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 23:45:36,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 23:45:36,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 23:45:36,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 23:45:36,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 23:45:36,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 23:45:36,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 23:45:36,029 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 23:45:36,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 23:45:36,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 23:45:36,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 23:45:36,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 23:45:36,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 23:45:36,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 23:45:36,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 23:45:36,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 23:45:36,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 23:45:36,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 23:45:36,036 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 23:45:36,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 23:45:36,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 23:45:36,037 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 23:45:36,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 23:45:36,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 23:45:36,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 23:45:36,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:45:36,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 23:45:36,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 23:45:36,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 23:45:36,039 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 23:45:36,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 23:45:36,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 23:45:36,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 23:45:36,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 23:45:36,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 23:45:36,042 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 -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2024-10-23 23:45:36,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 23:45:36,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 23:45:36,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 23:45:36,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 23:45:36,335 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 23:45:36,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-10-23 23:45:37,763 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 23:45:38,017 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 23:45:38,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2024-10-23 23:45:38,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816b70ec9/e28d89a39e1a41a3ab86f47ef6589e25/FLAG5b7ceaaed [2024-10-23 23:45:38,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/816b70ec9/e28d89a39e1a41a3ab86f47ef6589e25 [2024-10-23 23:45:38,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 23:45:38,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 23:45:38,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 23:45:38,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 23:45:38,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 23:45:38,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45438b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38, skipping insertion in model container [2024-10-23 23:45:38,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 23:45:38,410 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/list-simple/sll2c_insert_unequal.i[24872,24885] [2024-10-23 23:45:38,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:45:38,422 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 23:45:38,503 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/list-simple/sll2c_insert_unequal.i[24872,24885] [2024-10-23 23:45:38,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 23:45:38,551 INFO L204 MainTranslator]: Completed translation [2024-10-23 23:45:38,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38 WrapperNode [2024-10-23 23:45:38,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 23:45:38,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 23:45:38,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 23:45:38,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 23:45:38,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,603 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 174 [2024-10-23 23:45:38,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 23:45:38,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 23:45:38,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 23:45:38,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 23:45:38,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,649 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 18, 10]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-10-23 23:45:38,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 23:45:38,679 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 23:45:38,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 23:45:38,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 23:45:38,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (1/1) ... [2024-10-23 23:45:38,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 23:45:38,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:38,715 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-23 23:45:38,717 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-23 23:45:38,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-23 23:45:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-23 23:45:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-23 23:45:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-23 23:45:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-23 23:45:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-23 23:45:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-23 23:45:38,758 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-23 23:45:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-23 23:45:38,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 23:45:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-23 23:45:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-23 23:45:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-23 23:45:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-23 23:45:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-23 23:45:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-23 23:45:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-23 23:45:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-23 23:45:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-23 23:45:38,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-23 23:45:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-23 23:45:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 23:45:38,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-23 23:45:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-23 23:45:38,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 23:45:38,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 23:45:38,900 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 23:45:38,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 23:45:39,229 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-10-23 23:45:39,229 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 23:45:39,273 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 23:45:39,274 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-23 23:45:39,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:45:39 BoogieIcfgContainer [2024-10-23 23:45:39,274 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 23:45:39,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 23:45:39,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 23:45:39,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 23:45:39,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 11:45:38" (1/3) ... [2024-10-23 23:45:39,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b145782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:45:39, skipping insertion in model container [2024-10-23 23:45:39,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 11:45:38" (2/3) ... [2024-10-23 23:45:39,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b145782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 11:45:39, skipping insertion in model container [2024-10-23 23:45:39,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 11:45:39" (3/3) ... [2024-10-23 23:45:39,285 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2024-10-23 23:45:39,302 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 23:45:39,303 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 23:45:39,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 23:45:39,374 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;@13f7d884, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 23:45:39,375 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 23:45:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-23 23:45:39,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:39,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:39,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:39,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:39,396 INFO L85 PathProgramCache]: Analyzing trace with hash -143673426, now seen corresponding path program 1 times [2024-10-23 23:45:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006758024] [2024-10-23 23:45:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:45:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:39,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:39,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006758024] [2024-10-23 23:45:39,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006758024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:39,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:39,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 23:45:39,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995051453] [2024-10-23 23:45:39,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:39,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 23:45:39,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:39,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 23:45:39,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 23:45:39,782 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:45:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:39,860 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2024-10-23 23:45:39,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 23:45:39,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-10-23 23:45:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:39,870 INFO L225 Difference]: With dead ends: 64 [2024-10-23 23:45:39,871 INFO L226 Difference]: Without dead ends: 28 [2024-10-23 23:45:39,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 23:45:39,876 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:39,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:45:39,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-23 23:45:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-23 23:45:39,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:39,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-10-23 23:45:39,905 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 19 [2024-10-23 23:45:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:39,906 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-10-23 23:45:39,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:45:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-10-23 23:45:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-23 23:45:39,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:39,908 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:39,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 23:45:39,908 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:39,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:39,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1502228012, now seen corresponding path program 1 times [2024-10-23 23:45:39,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:39,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113872951] [2024-10-23 23:45:39,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:39,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-23 23:45:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:40,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:40,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113872951] [2024-10-23 23:45:40,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113872951] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:40,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:40,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 23:45:40,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570028414] [2024-10-23 23:45:40,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:40,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 23:45:40,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:40,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 23:45:40,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:45:40,130 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:45:40,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:40,194 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2024-10-23 23:45:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 23:45:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2024-10-23 23:45:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:40,196 INFO L225 Difference]: With dead ends: 51 [2024-10-23 23:45:40,196 INFO L226 Difference]: Without dead ends: 29 [2024-10-23 23:45:40,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:45:40,198 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:40,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:45:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-23 23:45:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-23 23:45:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2024-10-23 23:45:40,208 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2024-10-23 23:45:40,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:40,208 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2024-10-23 23:45:40,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-23 23:45:40,209 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2024-10-23 23:45:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-23 23:45:40,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:40,211 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:40,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 23:45:40,211 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:40,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1969454644, now seen corresponding path program 1 times [2024-10-23 23:45:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:40,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28468841] [2024-10-23 23:45:40,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:45:40,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28468841] [2024-10-23 23:45:40,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28468841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:40,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:40,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-23 23:45:40,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627785353] [2024-10-23 23:45:40,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:40,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 23:45:40,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:40,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 23:45:40,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:45:40,385 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-23 23:45:40,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:40,445 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2024-10-23 23:45:40,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 23:45:40,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-23 23:45:40,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:40,447 INFO L225 Difference]: With dead ends: 43 [2024-10-23 23:45:40,447 INFO L226 Difference]: Without dead ends: 31 [2024-10-23 23:45:40,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-23 23:45:40,448 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:40,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:45:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-23 23:45:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-23 23:45:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2024-10-23 23:45:40,459 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 25 [2024-10-23 23:45:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:40,459 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2024-10-23 23:45:40,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-23 23:45:40,460 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2024-10-23 23:45:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-23 23:45:40,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:40,461 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:40,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 23:45:40,461 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:40,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:40,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1835723964, now seen corresponding path program 1 times [2024-10-23 23:45:40,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:40,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517424942] [2024-10-23 23:45:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:41,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:42,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:45:42,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:42,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517424942] [2024-10-23 23:45:42,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517424942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:42,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508185586] [2024-10-23 23:45:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:42,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:42,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:42,334 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-23 23:45:42,335 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-23 23:45:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:42,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-23 23:45:42,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:45:42,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-23 23:45:42,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 11 treesize of output 7 [2024-10-23 23:45:43,044 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-23 23:45:43,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-10-23 23:45:43,113 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 23 treesize of output 11 [2024-10-23 23:45:43,221 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 20 treesize of output 15 [2024-10-23 23:45:43,342 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 11 treesize of output 3 [2024-10-23 23:45:43,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-23 23:45:43,612 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-23 23:45:43,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-23 23:45:43,631 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 20 treesize of output 15 [2024-10-23 23:45:43,936 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-10-23 23:45:43,942 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 20 treesize of output 15 [2024-10-23 23:45:44,021 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 19 treesize of output 11 [2024-10-23 23:45:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 23:45:44,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:45:45,759 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (v_ArrVal_405 Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int)) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_405)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_404) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-10-23 23:45:47,588 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_404 (Array Int Int)) (v_ArrVal_405 Int) (|ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_405)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_404) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2024-10-23 23:45:47,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508185586] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:47,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-23 23:45:47,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 41 [2024-10-23 23:45:47,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034150062] [2024-10-23 23:45:47,723 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-23 23:45:47,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-23 23:45:47,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:47,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-23 23:45:47,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1823, Unknown=15, NotChecked=174, Total=2162 [2024-10-23 23:45:47,726 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:45:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:50,897 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2024-10-23 23:45:50,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-23 23:45:50,898 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2024-10-23 23:45:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:50,899 INFO L225 Difference]: With dead ends: 56 [2024-10-23 23:45:50,900 INFO L226 Difference]: Without dead ends: 54 [2024-10-23 23:45:50,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=284, Invalid=3248, Unknown=16, NotChecked=234, Total=3782 [2024-10-23 23:45:50,903 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 62 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:50,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 434 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-23 23:45:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-23 23:45:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2024-10-23 23:45:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:50,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-10-23 23:45:50,912 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 26 [2024-10-23 23:45:50,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:50,912 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-10-23 23:45:50,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-23 23:45:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-10-23 23:45:50,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-23 23:45:50,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:50,914 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:50,930 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-23 23:45:51,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:51,115 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:51,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:51,116 INFO L85 PathProgramCache]: Analyzing trace with hash 462823476, now seen corresponding path program 2 times [2024-10-23 23:45:51,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:51,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976021500] [2024-10-23 23:45:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:45:51,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:51,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976021500] [2024-10-23 23:45:51,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976021500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:51,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:51,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-23 23:45:51,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142415232] [2024-10-23 23:45:51,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:51,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-23 23:45:51,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:51,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-23 23:45:51,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:45:51,271 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-23 23:45:51,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:51,348 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-10-23 23:45:51,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-23 23:45:51,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-10-23 23:45:51,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:51,349 INFO L225 Difference]: With dead ends: 55 [2024-10-23 23:45:51,349 INFO L226 Difference]: Without dead ends: 39 [2024-10-23 23:45:51,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-23 23:45:51,350 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:51,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 104 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:45:51,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-23 23:45:51,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-23 23:45:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-10-23 23:45:51,364 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 27 [2024-10-23 23:45:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:51,365 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-10-23 23:45:51,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-23 23:45:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-10-23 23:45:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-23 23:45:51,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:51,366 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:51,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 23:45:51,367 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:51,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash 162755610, now seen corresponding path program 1 times [2024-10-23 23:45:51,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:51,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019769176] [2024-10-23 23:45:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:45:51,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:51,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019769176] [2024-10-23 23:45:51,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019769176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 23:45:51,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 23:45:51,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-23 23:45:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715389577] [2024-10-23 23:45:51,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 23:45:51,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-23 23:45:51,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:51,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-23 23:45:51,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 23:45:51,514 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-23 23:45:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:51,568 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-10-23 23:45:51,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-23 23:45:51,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-10-23 23:45:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:51,569 INFO L225 Difference]: With dead ends: 53 [2024-10-23 23:45:51,569 INFO L226 Difference]: Without dead ends: 38 [2024-10-23 23:45:51,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-23 23:45:51,570 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:51,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 79 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 23:45:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-23 23:45:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-23 23:45:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-23 23:45:51,578 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 27 [2024-10-23 23:45:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:51,578 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-23 23:45:51,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-23 23:45:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-23 23:45:51,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-23 23:45:51,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:51,579 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:51,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 23:45:51,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:51,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:51,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1596717782, now seen corresponding path program 1 times [2024-10-23 23:45:51,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:51,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525584528] [2024-10-23 23:45:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:51,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:51,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:45:51,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:51,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525584528] [2024-10-23 23:45:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525584528] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106123395] [2024-10-23 23:45:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:51,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:51,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:51,726 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-23 23:45:51,727 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-23 23:45:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:51,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-23 23:45:51,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:45:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:45:51,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:45:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:45:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106123395] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 23:45:51,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 23:45:51,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-10-23 23:45:51,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829062607] [2024-10-23 23:45:51,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 23:45:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-23 23:45:51,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:51,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-23 23:45:51,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-23 23:45:51,999 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-23 23:45:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:45:52,122 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-10-23 23:45:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-23 23:45:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-10-23 23:45:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:45:52,124 INFO L225 Difference]: With dead ends: 49 [2024-10-23 23:45:52,124 INFO L226 Difference]: Without dead ends: 36 [2024-10-23 23:45:52,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-23 23:45:52,125 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:45:52,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 139 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:45:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-23 23:45:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-23 23:45:52,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:45:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-10-23 23:45:52,132 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 28 [2024-10-23 23:45:52,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:45:52,133 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-10-23 23:45:52,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-23 23:45:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-10-23 23:45:52,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-23 23:45:52,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:45:52,134 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:45:52,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 23:45:52,338 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,SelfDestructingSolverStorable6 [2024-10-23 23:45:52,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:45:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:45:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1539459480, now seen corresponding path program 1 times [2024-10-23 23:45:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:45:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373640271] [2024-10-23 23:45:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:52,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:45:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:52,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:45:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:45:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:45:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:52,611 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-23 23:45:52,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:45:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373640271] [2024-10-23 23:45:52,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373640271] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:45:52,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793277092] [2024-10-23 23:45:52,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:45:52,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:45:52,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:45:52,614 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-23 23:45:52,623 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-23 23:45:52,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:45:52,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-23 23:45:52,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:45:52,889 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 16 treesize of output 8 [2024-10-23 23:45:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 23:45:52,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:45:52,965 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-23 23:45:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793277092] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 23:45:52,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 23:45:52,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 14 [2024-10-23 23:45:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973605614] [2024-10-23 23:45:52,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 23:45:52,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-23 23:45:52,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:45:52,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-23 23:45:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-10-23 23:45:52,967 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-23 23:45:56,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:46:00,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:46:05,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:46:09,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:46:13,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-23 23:46:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:13,203 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-10-23 23:46:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-23 23:46:13,205 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 28 [2024-10-23 23:46:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:13,206 INFO L225 Difference]: With dead ends: 49 [2024-10-23 23:46:13,206 INFO L226 Difference]: Without dead ends: 35 [2024-10-23 23:46:13,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2024-10-23 23:46:13,207 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:13,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 265 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2024-10-23 23:46:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-23 23:46:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-23 23:46:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:46:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-10-23 23:46:13,219 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 28 [2024-10-23 23:46:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:13,220 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-10-23 23:46:13,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-23 23:46:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-10-23 23:46:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-23 23:46:13,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:13,222 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:13,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-23 23:46:13,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:13,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:13,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash -152500382, now seen corresponding path program 1 times [2024-10-23 23:46:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:13,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782105711] [2024-10-23 23:46:13,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:13,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:46:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:46:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:46:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:46:13,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:13,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782105711] [2024-10-23 23:46:13,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782105711] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:13,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081622804] [2024-10-23 23:46:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:13,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:13,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:13,690 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-23 23:46:13,692 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-23 23:46:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:13,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-23 23:46:13,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:46:13,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-23 23:46:13,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081622804] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-23 23:46:13,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-23 23:46:13,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2024-10-23 23:46:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502701087] [2024-10-23 23:46:13,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-23 23:46:13,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-23 23:46:13,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 23:46:13,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-23 23:46:13,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-23 23:46:13,978 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-23 23:46:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 23:46:14,062 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-10-23 23:46:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-23 23:46:14,063 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2024-10-23 23:46:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 23:46:14,064 INFO L225 Difference]: With dead ends: 42 [2024-10-23 23:46:14,064 INFO L226 Difference]: Without dead ends: 31 [2024-10-23 23:46:14,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-23 23:46:14,065 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-23 23:46:14,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-23 23:46:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-23 23:46:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-23 23:46:14,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-23 23:46:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-10-23 23:46:14,075 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 29 [2024-10-23 23:46:14,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 23:46:14,075 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-10-23 23:46:14,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-23 23:46:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-10-23 23:46:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-23 23:46:14,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 23:46:14,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 23:46:14,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-23 23:46:14,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:14,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 23:46:14,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 23:46:14,278 INFO L85 PathProgramCache]: Analyzing trace with hash -152544092, now seen corresponding path program 1 times [2024-10-23 23:46:14,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 23:46:14,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729209838] [2024-10-23 23:46:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:14,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 23:46:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:15,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-23 23:46:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:15,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-23 23:46:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:15,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-23 23:46:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:15,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-23 23:46:15,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 23:46:15,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729209838] [2024-10-23 23:46:15,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729209838] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 23:46:15,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942343297] [2024-10-23 23:46:15,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 23:46:15,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 23:46:15,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 23:46:15,520 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-23 23:46:15,521 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-23 23:46:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 23:46:15,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-23 23:46:15,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 23:46:15,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-23 23:46:16,104 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 9 treesize of output 3 [2024-10-23 23:46:16,201 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-23 23:46:16,280 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-23 23:46:16,280 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 15 treesize of output 15 [2024-10-23 23:46:16,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-23 23:46:16,537 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 27 [2024-10-23 23:46:16,543 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 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-23 23:46:16,550 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 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-23 23:46:16,566 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-10-23 23:46:16,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 62 [2024-10-23 23:46:16,572 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 36 treesize of output 15 [2024-10-23 23:46:16,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 [2024-10-23 23:46:16,660 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 50 treesize of output 30 [2024-10-23 23:46:16,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-10-23 23:46:16,736 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-23 23:46:16,745 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 15 treesize of output 7 [2024-10-23 23:46:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-23 23:46:16,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-23 23:46:16,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:16,863 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 69 treesize of output 70 [2024-10-23 23:46:16,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:16,878 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 136 treesize of output 139 [2024-10-23 23:46:16,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:16,886 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 116 treesize of output 108 [2024-10-23 23:46:16,892 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 52 treesize of output 46 [2024-10-23 23:46:16,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:16,911 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 190 treesize of output 181 [2024-10-23 23:46:16,925 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 37 treesize of output 31 [2024-10-23 23:46:17,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse2 (= .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse15)) (.cse1 (and (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (let ((.cse10 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse10 (+ 4 v_arrayElimCell_31))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse10) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))) (or .cse2 (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) v_arrayElimCell_28) (+ 4 v_arrayElimCell_31))))) (or .cse2 (forall ((v_ArrVal_1271 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271) (+ 4 v_arrayElimCell_31))))) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse13 (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_28) (+ 4 v_arrayElimCell_31))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse13 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))))))) (.cse4 (and (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse9 v_arrayElimCell_28) .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)))))) (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275) v_arrayElimCell_28) .cse3))) .cse2))) (.cse6 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|))) (and (or .cse0 .cse1) (or .cse2 (forall ((v_ArrVal_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse3)))) (or .cse0 .cse4) (or (not .cse2) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (store .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))) (or .cse6 .cse1) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1275))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse7 .cse3)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse8 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))) (or .cse4 .cse6))))) is different from false [2024-10-23 23:46:17,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (= .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse8 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) (let ((.cse4 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse1 (and (or (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275) v_arrayElimCell_28) .cse8))) .cse3) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (or (= (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse15 v_arrayElimCell_28) .cse8))))))) (.cse0 (= .cse14 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse5 (and (or .cse3 (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= (select (select (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) v_arrayElimCell_28) (+ 4 v_arrayElimCell_31)) |c_ULTIMATE.start_main_~uneq~0#1|))) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (let ((.cse11 (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) (or (= (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| .cse11) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse11 (+ 4 v_arrayElimCell_31))))))) (or .cse3 (forall ((v_ArrVal_1271 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271) (+ 4 v_arrayElimCell_31))))) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (store .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))))) (or (= (select (select .cse12 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select (select .cse12 v_arrayElimCell_28) (+ 4 v_arrayElimCell_31)) |c_ULTIMATE.start_main_~uneq~0#1|))))))) (and (or .cse0 .cse1) (or (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (= (select (select (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (store .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)) |c_ULTIMATE.start_main_~uneq~0#1|)) (not .cse3)) (or .cse4 .cse5) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse6 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (or (= (select (select (store .cse6 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32)) |c_ULTIMATE.start_main_~uneq~0#1|) (= (select .cse7 .cse8) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse4 .cse1) (or .cse0 .cse5) (or .cse3 (forall ((v_ArrVal_1275 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse8) |c_ULTIMATE.start_main_~uneq~0#1|))))))) is different from false [2024-10-23 23:46:17,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4)) (.cse8 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse16)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (let ((.cse0 (= .cse7 .cse16)) (.cse1 (and (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse11 (let ((.cse12 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (store .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse12 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271))))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse11 v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= (select (select .cse11 v_arrayElimCell_28) (+ 4 v_arrayElimCell_31)) |c_ULTIMATE.start_main_~uneq~0#1|)))) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int) (v_arrayElimCell_31 Int)) (let ((.cse13 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (let ((.cse14 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse14) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse14 (+ 4 v_arrayElimCell_31))))))) (or (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= (select (select (let ((.cse15 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271))) v_arrayElimCell_28) (+ 4 v_arrayElimCell_31)) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse8) (or .cse8 (forall ((v_ArrVal_1271 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_31 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (store (select (store |c_#memory_int#1| .cse7 v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271) (+ 4 v_arrayElimCell_31))))))) (.cse3 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse2 (and (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse10 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse10 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select .cse10 v_arrayElimCell_28) .cse6))))) (or .cse8 (forall ((v_arrayElimCell_28 Int) (v_ArrVal_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_1275) v_arrayElimCell_28) .cse6))))))) (and (or .cse0 .cse1) (or .cse0 .cse2) (or .cse3 .cse1) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (let ((.cse4 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store .cse5 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271)) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse5 .cse6)))))) (or (forall ((v_ArrVal_1275 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store |c_#memory_int#1| .cse7 v_ArrVal_1275) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse6))) .cse8) (or .cse3 .cse2) (or (not .cse8) (forall ((v_ArrVal_1271 Int) (v_arrayElimCell_29 Int) (v_ArrVal_1275 (Array Int Int)) (v_arrayElimCell_32 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (let ((.cse9 (store |c_#memory_int#1| .cse7 v_ArrVal_1275))) (store .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1271))) v_arrayElimCell_29) (+ 4 v_arrayElimCell_32))))))))) is different from false [2024-10-23 23:46:20,924 INFO L349 Elim1Store]: treesize reduction 204, result has 82.7 percent of original size [2024-10-23 23:46:20,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 13 new quantified variables, introduced 79 case distinctions, treesize of input 2453 treesize of output 2952 [2024-10-23 23:46:23,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:23,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 2276 treesize of output 3270 [2024-10-23 23:46:23,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:23,897 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 2015 treesize of output 2000 [2024-10-23 23:46:24,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:24,606 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 2033 treesize of output 2026 [2024-10-23 23:46:25,275 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 2045 treesize of output 2033 [2024-10-23 23:46:25,783 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 2047 treesize of output 2043 [2024-10-23 23:46:26,291 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 2043 treesize of output 2041 [2024-10-23 23:46:26,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:26,779 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 2069 treesize of output 2064 [2024-10-23 23:46:27,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:27,245 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 2083 treesize of output 2078 [2024-10-23 23:46:27,682 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 2097 treesize of output 2085 [2024-10-23 23:46:28,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:28,194 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 2141 treesize of output 2126 [2024-10-23 23:46:28,621 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 2131 treesize of output 2127 [2024-10-23 23:46:29,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:29,074 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 2169 treesize of output 2162 [2024-10-23 23:46:29,514 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 2181 treesize of output 2169 [2024-10-23 23:46:29,961 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 2169 treesize of output 2167 [2024-10-23 23:46:30,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-23 23:46:30,445 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 2195 treesize of output 2190 [2024-10-23 23:46:30,882 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 2181 treesize of output 2179