./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_equal.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 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:59:33,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:59:33,080 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:59:33,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:59:33,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:59:33,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:59:33,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:59:33,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:59:33,116 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:59:33,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:59:33,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:59:33,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:59:33,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:59:33,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:59:33,118 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:59:33,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:59:33,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:59:33,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:59:33,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:59:33,120 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:59:33,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:59:33,122 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:59:33,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:59:33,122 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:59:33,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:59:33,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:59:33,123 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:59:33,123 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:59:33,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:59:33,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:59:33,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:59:33,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:59:33,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:59:33,124 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:59:33,124 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:59:33,124 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:59:33,124 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:59:33,124 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:59:33,125 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:59:33,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:59:33,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:59:33,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:59:33,127 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2024-11-08 13:59:33,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:59:33,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:59:33,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:59:33,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:59:33,361 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:59:33,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-11-08 13:59:34,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:59:34,829 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:59:34,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2024-11-08 13:59:34,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0596547ea/61606caa7ad44f5594eb28aa24b6cfcd/FLAGee6e41bb2 [2024-11-08 13:59:35,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0596547ea/61606caa7ad44f5594eb28aa24b6cfcd [2024-11-08 13:59:35,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:59:35,161 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:59:35,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:59:35,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:59:35,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:59:35,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7577f78f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35, skipping insertion in model container [2024-11-08 13:59:35,170 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,210 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:59:35,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2024-11-08 13:59:35,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:59:35,484 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:59:35,531 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2024-11-08 13:59:35,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:59:35,555 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:59:35,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35 WrapperNode [2024-11-08 13:59:35,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:59:35,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:59:35,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:59:35,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:59:35,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,591 INFO L138 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 121 [2024-11-08 13:59:35,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:59:35,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:59:35,594 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:59:35,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:59:35,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,617 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 9, 5]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-11-08 13:59:35,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,623 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,625 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:59:35,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:59:35,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:59:35,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:59:35,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (1/1) ... [2024-11-08 13:59:35,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:59:35,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:35,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:59:35,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:59:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:59:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:59:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:59:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:59:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:59:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:59:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 13:59:35,706 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 13:59:35,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:59:35,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:59:35,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:59:35,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:59:35,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:59:35,798 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:59:35,799 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:59:35,930 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-08 13:59:35,931 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:59:35,939 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:59:35,939 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-08 13:59:35,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:59:35 BoogieIcfgContainer [2024-11-08 13:59:35,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:59:35,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:59:35,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:59:35,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:59:35,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:59:35" (1/3) ... [2024-11-08 13:59:35,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55eb9af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:59:35, skipping insertion in model container [2024-11-08 13:59:35,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:59:35" (2/3) ... [2024-11-08 13:59:35,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55eb9af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:59:35, skipping insertion in model container [2024-11-08 13:59:35,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:59:35" (3/3) ... [2024-11-08 13:59:35,946 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2024-11-08 13:59:35,958 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:59:35,958 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:59:35,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:59:35,999 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;@1b069afd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:59:35,999 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:59:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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-11-08 13:59:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:59:36,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:36,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:36,008 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:36,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:36,011 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2024-11-08 13:59:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:36,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67441077] [2024-11-08 13:59:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:59:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:36,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:59:36,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:36,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67441077] [2024-11-08 13:59:36,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67441077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:36,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:36,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:59:36,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920718590] [2024-11-08 13:59:36,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:36,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:59:36,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:36,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:59:36,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:59:36,271 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:59:36,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:36,317 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2024-11-08 13:59:36,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:59:36,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-08 13:59:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:36,327 INFO L225 Difference]: With dead ends: 54 [2024-11-08 13:59:36,327 INFO L226 Difference]: Without dead ends: 24 [2024-11-08 13:59:36,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-08 13:59:36,332 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:36,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-08 13:59:36,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-08 13:59:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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-11-08 13:59:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-08 13:59:36,363 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2024-11-08 13:59:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:36,364 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-08 13:59:36,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:59:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-11-08 13:59:36,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:59:36,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:36,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:36,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:59:36,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:36,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:36,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2024-11-08 13:59:36,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:36,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227517309] [2024-11-08 13:59:36,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:36,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:36,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:59:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:59:36,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:36,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227517309] [2024-11-08 13:59:36,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227517309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:36,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:36,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:59:36,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391805960] [2024-11-08 13:59:36,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:36,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:59:36,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:36,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:59:36,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:59:36,585 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:59:36,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:36,629 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-11-08 13:59:36,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:59:36,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-08 13:59:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:36,630 INFO L225 Difference]: With dead ends: 46 [2024-11-08 13:59:36,630 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 13:59:36,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-11-08 13:59:36,632 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:36,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 65 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 13:59:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-11-08 13:59:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-11-08 13:59:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-08 13:59:36,644 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2024-11-08 13:59:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:36,644 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-08 13:59:36,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 13:59:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-08 13:59:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 13:59:36,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:36,646 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:36,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:59:36,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:36,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:36,648 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2024-11-08 13:59:36,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803358069] [2024-11-08 13:59:36,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:36,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:36,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:36,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 13:59:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:59:36,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:36,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803358069] [2024-11-08 13:59:36,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803358069] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:36,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383714702] [2024-11-08 13:59:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:36,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:36,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:36,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:59:36,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:59:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:36,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 13:59:36,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:59:36,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:59:36,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383714702] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:59:36,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:59:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-08 13:59:36,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251135881] [2024-11-08 13:59:36,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:59:36,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:59:36,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:36,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:59:36,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:59:36,970 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 13:59:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:37,000 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-11-08 13:59:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:59:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2024-11-08 13:59:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:37,001 INFO L225 Difference]: With dead ends: 47 [2024-11-08 13:59:37,001 INFO L226 Difference]: Without dead ends: 29 [2024-11-08 13:59:37,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:59:37,002 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:37,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 85 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-08 13:59:37,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-08 13:59:37,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-11-08 13:59:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-08 13:59:37,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2024-11-08 13:59:37,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:37,006 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-08 13:59:37,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 13:59:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-08 13:59:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:59:37,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:37,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:37,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 13:59:37,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:37,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:37,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash -941011836, now seen corresponding path program 2 times [2024-11-08 13:59:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:37,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045168928] [2024-11-08 13:59:37,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:37,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:59:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:59:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 13:59:37,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:37,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045168928] [2024-11-08 13:59:37,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045168928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:37,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:37,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:59:37,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231288125] [2024-11-08 13:59:37,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:37,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:59:37,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:37,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:59:37,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:59:37,315 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 13:59:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:37,337 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-11-08 13:59:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:59:37,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-08 13:59:37,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:37,338 INFO L225 Difference]: With dead ends: 38 [2024-11-08 13:59:37,338 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 13:59:37,338 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-11-08 13:59:37,338 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:37,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:37,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 13:59:37,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-08 13:59:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 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-11-08 13:59:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-08 13:59:37,342 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 37 [2024-11-08 13:59:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:37,343 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-08 13:59:37,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 13:59:37,343 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-08 13:59:37,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:59:37,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:37,344 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:37,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:59:37,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:37,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:37,344 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 1 times [2024-11-08 13:59:37,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:37,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263305770] [2024-11-08 13:59:37,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:37,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:59:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:59:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,486 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 13:59:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263305770] [2024-11-08 13:59:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263305770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:59:37,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:59:37,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:59:37,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407810162] [2024-11-08 13:59:37,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:59:37,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:59:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:37,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:59:37,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:59:37,489 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-08 13:59:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:37,516 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-08 13:59:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:59:37,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 37 [2024-11-08 13:59:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:37,516 INFO L225 Difference]: With dead ends: 40 [2024-11-08 13:59:37,517 INFO L226 Difference]: Without dead ends: 32 [2024-11-08 13:59:37,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:59:37,517 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:37,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:59:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-08 13:59:37,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-11-08 13:59:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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-11-08 13:59:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-08 13:59:37,521 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 37 [2024-11-08 13:59:37,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:37,522 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-08 13:59:37,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-11-08 13:59:37,522 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-08 13:59:37,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:59:37,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:37,523 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:37,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:59:37,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:37,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2024-11-08 13:59:37,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:37,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369435861] [2024-11-08 13:59:37,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:37,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:59:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:59:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 13:59:37,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:37,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369435861] [2024-11-08 13:59:37,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369435861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279767112] [2024-11-08 13:59:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:37,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:37,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:37,747 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:59:37,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:59:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:37,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 13:59:37,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:37,972 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-11-08 13:59:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 13:59:37,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 13:59:38,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279767112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:59:38,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:59:38,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 11 [2024-11-08 13:59:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459570547] [2024-11-08 13:59:38,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:59:38,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 13:59:38,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:59:38,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 13:59:38,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:59:38,035 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 13:59:42,055 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-11-08 13:59:46,098 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-11-08 13:59:50,113 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-11-08 13:59:54,155 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-11-08 13:59:58,320 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-11-08 13:59:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:59:58,350 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-08 13:59:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 13:59:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-08 13:59:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:59:58,351 INFO L225 Difference]: With dead ends: 46 [2024-11-08 13:59:58,351 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 13:59:58,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-08 13:59:58,351 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 17 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:59:58,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 188 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-11-08 13:59:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 13:59:58,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2024-11-08 13:59:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 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-11-08 13:59:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-08 13:59:58,356 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 38 [2024-11-08 13:59:58,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:59:58,356 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-08 13:59:58,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 13:59:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-08 13:59:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:59:58,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:59:58,357 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:59:58,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:59:58,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 13:59:58,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:59:58,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:59:58,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1457379225, now seen corresponding path program 1 times [2024-11-08 13:59:58,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:59:58,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116991206] [2024-11-08 13:59:58,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:58,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:59:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:59,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:59:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:59:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 13:59:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:59:59,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:59:59,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116991206] [2024-11-08 13:59:59,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116991206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:59:59,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632325998] [2024-11-08 13:59:59,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:59:59,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:59:59,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:59:59,549 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:59:59,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 13:59:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:59:59,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-08 13:59:59,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:59:59,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:59:59,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:59:59,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-08 13:59:59,985 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-11-08 13:59:59,988 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 11 treesize of output 3 [2024-11-08 14:00:00,126 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 14:00:00,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-08 14:00:00,150 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 14:00:00,151 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-11-08 14:00:00,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:00,348 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 43 treesize of output 15 [2024-11-08 14:00:00,419 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-11-08 14:00:00,467 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-11-08 14:00:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:00,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:00,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_713) (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|)))) is different from false [2024-11-08 14:00:02,552 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_711 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) v_ArrVal_711)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_713) (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|)))) is different from false [2024-11-08 14:00:02,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632325998] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:02,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:02,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 34 [2024-11-08 14:00:02,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876670189] [2024-11-08 14:00:02,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:02,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 14:00:02,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 14:00:02,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1193, Unknown=32, NotChecked=142, Total=1482 [2024-11-08 14:00:02,961 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 14:00:03,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:03,651 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2024-11-08 14:00:03,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 14:00:03,654 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2024-11-08 14:00:03,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:03,655 INFO L225 Difference]: With dead ends: 51 [2024-11-08 14:00:03,655 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 14:00:03,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=178, Invalid=2054, Unknown=32, NotChecked=186, Total=2450 [2024-11-08 14:00:03,656 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 25 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:03,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 321 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 14:00:03,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 14:00:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2024-11-08 14:00:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 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-11-08 14:00:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-08 14:00:03,662 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 38 [2024-11-08 14:00:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:03,663 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-08 14:00:03,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.6875) internal successors, (54), 28 states have internal predecessors, (54), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 14:00:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-08 14:00:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 14:00:03,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:03,664 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:03,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 14:00:03,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:03,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:03,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1514635853, now seen corresponding path program 1 times [2024-11-08 14:00:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444092609] [2024-11-08 14:00:03,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:04,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 14:00:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444092609] [2024-11-08 14:00:04,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444092609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249469852] [2024-11-08 14:00:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:04,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:04,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:04,322 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:00:04,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 14:00:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:04,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 14:00:04,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:04,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 14:00:04,476 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-11-08 14:00:04,503 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 14:00:04,504 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-11-08 14:00:04,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-08 14:00:04,571 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-11-08 14:00:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:04,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249469852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:04,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 19 [2024-11-08 14:00:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546753943] [2024-11-08 14:00:04,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:04,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 14:00:04,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:04,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 14:00:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2024-11-08 14:00:04,701 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 14:00:04,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:04,890 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-08 14:00:04,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 14:00:04,890 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2024-11-08 14:00:04,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:04,891 INFO L225 Difference]: With dead ends: 55 [2024-11-08 14:00:04,891 INFO L226 Difference]: Without dead ends: 52 [2024-11-08 14:00:04,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2024-11-08 14:00:04,892 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:04,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 338 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:00:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-08 14:00:04,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2024-11-08 14:00:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 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-11-08 14:00:04,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-11-08 14:00:04,898 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 38 [2024-11-08 14:00:04,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:04,899 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-11-08 14:00:04,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 14:00:04,899 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-11-08 14:00:04,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 14:00:04,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:04,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:04,913 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-11-08 14:00:05,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:05,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:05,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1514637527, now seen corresponding path program 1 times [2024-11-08 14:00:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717998778] [2024-11-08 14:00:05,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:05,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:05,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:05,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 14:00:05,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:05,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717998778] [2024-11-08 14:00:05,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717998778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:05,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693243492] [2024-11-08 14:00:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:05,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:05,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:05,316 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:00:05,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 14:00:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:05,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 14:00:05,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:05,512 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-11-08 14:00:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:05,535 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 14:00:05,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693243492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:05,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:00:05,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 15 [2024-11-08 14:00:05,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758232821] [2024-11-08 14:00:05,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:05,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 14:00:05,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:05,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 14:00:05,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:00:05,568 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 14:00:09,579 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-11-08 14:00:13,594 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-11-08 14:00:17,609 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-11-08 14:00:21,637 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-11-08 14:00:25,769 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-11-08 14:00:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:25,787 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2024-11-08 14:00:25,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 14:00:25,787 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2024-11-08 14:00:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:25,788 INFO L225 Difference]: With dead ends: 57 [2024-11-08 14:00:25,788 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 14:00:25,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-08 14:00:25,789 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:25,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 247 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2024-11-08 14:00:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 14:00:25,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2024-11-08 14:00:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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-11-08 14:00:25,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-11-08 14:00:25,798 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 38 [2024-11-08 14:00:25,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:25,798 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-11-08 14:00:25,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 13 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 14:00:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-11-08 14:00:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 14:00:25,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:25,799 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:25,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 14:00:25,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:26,000 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:26,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:26,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1501961106, now seen corresponding path program 2 times [2024-11-08 14:00:26,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:26,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102223531] [2024-11-08 14:00:26,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:26,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:26,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:26,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:26,146 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 14:00:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102223531] [2024-11-08 14:00:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102223531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 14:00:26,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178102538] [2024-11-08 14:00:26,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:26,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 14:00:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:26,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 14:00:26,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:00:26,147 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-11-08 14:00:26,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:26,183 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2024-11-08 14:00:26,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:00:26,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 39 [2024-11-08 14:00:26,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:26,184 INFO L225 Difference]: With dead ends: 51 [2024-11-08 14:00:26,184 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 14:00:26,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-11-08 14:00:26,186 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:26,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 68 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 14:00:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-08 14:00:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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-11-08 14:00:26,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-08 14:00:26,193 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 39 [2024-11-08 14:00:26,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:26,194 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-08 14:00:26,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-11-08 14:00:26,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-08 14:00:26,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 14:00:26,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:26,195 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:26,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 14:00:26,196 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:26,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:26,197 INFO L85 PathProgramCache]: Analyzing trace with hash 382129514, now seen corresponding path program 1 times [2024-11-08 14:00:26,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:26,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172351226] [2024-11-08 14:00:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:26,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:26,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:26,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 14:00:26,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:26,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172351226] [2024-11-08 14:00:26,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172351226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:26,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118867841] [2024-11-08 14:00:26,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:26,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:26,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:27,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:00:27,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 14:00:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:27,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 14:00:27,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:27,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 14:00:27,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-08 14:00:27,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2024-11-08 14:00:27,386 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-11-08 14:00:27,493 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 14:00:27,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 30 [2024-11-08 14:00:27,500 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 12 treesize of output 4 [2024-11-08 14:00:27,512 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 14:00:27,513 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-08 14:00:27,624 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2024-11-08 14:00:27,625 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 1 case distinctions, treesize of input 32 treesize of output 47 [2024-11-08 14:00:27,712 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2024-11-08 14:00:27,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 51 [2024-11-08 14:00:27,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 14:00:27,811 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 26 treesize of output 18 [2024-11-08 14:00:27,813 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 22 treesize of output 14 [2024-11-08 14:00:27,818 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 20 treesize of output 8 [2024-11-08 14:00:27,821 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 14:00:27,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:27,832 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1303 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1303) (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)) 0))) is different from false [2024-11-08 14:00:28,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118867841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:28,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 14:00:28,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22] total 36 [2024-11-08 14:00:28,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126684758] [2024-11-08 14:00:28,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:28,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-08 14:00:28,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:28,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 14:00:28,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1298, Unknown=16, NotChecked=72, Total=1482 [2024-11-08 14:00:28,084 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 36 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 29 states have internal predecessors, (59), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 14:00:28,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:28,746 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-08 14:00:28,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 14:00:28,747 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 29 states have internal predecessors, (59), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2024-11-08 14:00:28,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:28,749 INFO L225 Difference]: With dead ends: 42 [2024-11-08 14:00:28,749 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 14:00:28,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=187, Invalid=2557, Unknown=16, NotChecked=102, Total=2862 [2024-11-08 14:00:28,750 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:28,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 404 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 14:00:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 14:00:28,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-11-08 14:00:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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-11-08 14:00:28,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-08 14:00:28,755 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 40 [2024-11-08 14:00:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:28,756 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-08 14:00:28,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 29 states have internal predecessors, (59), 4 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 14:00:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-08 14:00:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 14:00:28,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:28,757 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:28,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 14:00:28,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:28,961 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:28,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash 382131188, now seen corresponding path program 1 times [2024-11-08 14:00:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690935602] [2024-11-08 14:00:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:29,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 14:00:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 14:00:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 14:00:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690935602] [2024-11-08 14:00:30,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690935602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:30,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896143103] [2024-11-08 14:00:30,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:30,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:30,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:30,194 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:00:30,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 14:00:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:30,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-08 14:00:30,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:30,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 14:00:30,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 14:00:30,689 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-11-08 14:00:30,695 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 11 treesize of output 3 [2024-11-08 14:00:30,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 14:00:30,884 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 14:00:30,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-08 14:00:30,899 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 14:00:30,900 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-11-08 14:00:31,138 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 31 treesize of output 15 [2024-11-08 14:00:31,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 14:00:31,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-08 14:00:31,244 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-08 14:00:31,244 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 119 treesize of output 76 [2024-11-08 14:00:31,253 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-11-08 14:00:31,262 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 55 treesize of output 19 [2024-11-08 14:00:31,330 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-11-08 14:00:31,387 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-11-08 14:00:31,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-08 14:00:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:00:31,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:31,631 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1476 (Array Int Int)) (v_ArrVal_1475 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1476) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse0) .cse1)))) (not (= (let ((.cse2 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse2 (select v_ArrVal_1477 .cse2))) v_ArrVal_1477)))) is different from false [2024-11-08 14:00:31,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:31,640 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 67 treesize of output 68 [2024-11-08 14:00:31,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:31,652 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 130 treesize of output 129 [2024-11-08 14:00:31,658 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 56 treesize of output 48 [2024-11-08 14:00:35,819 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (.cse5 (+ .cse9 4)) (.cse1 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4)) (.cse8 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse4))) (let ((.cse6 (not .cse8)) (.cse10 (forall ((v_ArrVal_1477 (Array Int Int)) (v_arrayElimCell_43 Int) (v_ArrVal_1471 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1471))) (or (forall ((v_ArrVal_1475 (Array Int Int))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477)) (.cse14 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_43) .cse14)) (forall ((v_arrayElimCell_45 Int)) (= (select (select .cse13 v_arrayElimCell_45) .cse14) |c_ULTIMATE.start_main_~data~0#1|))))) (not (= v_ArrVal_1477 (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1477 .cse1)))))))) (.cse11 (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1471))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477) v_arrayElimCell_43) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5))) (not (= v_ArrVal_1477 (store (select .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1477 .cse1))))))) .cse8))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1471))) (or (not (= v_ArrVal_1477 (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1477 .cse1)))) (forall ((v_ArrVal_1475 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1477 .cse2)) (forall ((v_arrayElimCell_45 Int)) (= (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477) v_arrayElimCell_45) .cse2) |c_ULTIMATE.start_main_~data~0#1|)))))))) (or .cse6 (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_arrayElimCell_45 Int)) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1471))) (or (not (= v_ArrVal_1477 (store (select .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1477 .cse1)))) (= (select (select (store .cse7 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477) v_arrayElimCell_45) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5)) |c_ULTIMATE.start_main_~data~0#1|))))) (or (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_1) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5)))) .cse8) (or (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| .cse9) (and .cse10 .cse11)) (or (= |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| .cse4) (and (or .cse6 (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_arrayElimCell_45 Int)) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1477 .cse1)) v_ArrVal_1477)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477) v_arrayElimCell_45) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5)) |c_ULTIMATE.start_main_~data~0#1|)))) .cse10 .cse11)))))) is different from false [2024-11-08 14:00:36,021 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (= |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| .cse4)) (.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_insert_~last~0#1.offset| 4) |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset|))) (.cse5 (+ .cse9 4)) (.cse1 (+ |c_ULTIMATE.start_sll_insert_~new_node~0#1.offset| 4))) (let ((.cse6 (forall ((v_ArrVal_1477 (Array Int Int)) (v_arrayElimCell_43 Int) (v_ArrVal_1471 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1471))) (or (forall ((v_ArrVal_1475 (Array Int Int))) (let ((.cse13 (store .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477)) (.cse14 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5))) (or (forall ((v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_45) .cse14))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse13 v_arrayElimCell_43) .cse14))))) (not (= v_ArrVal_1477 (store (select .cse15 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1477 .cse1)))))))) (.cse7 (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1471))) (or (not (= v_ArrVal_1477 (store (select .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1477 .cse1)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477) v_arrayElimCell_43) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5)))))) .cse10)) (.cse8 (not .cse10))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1471))) (or (not (= v_ArrVal_1477 (store (select .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1477 .cse1)))) (forall ((v_ArrVal_1475 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1477 .cse2)) (forall ((v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477) v_arrayElimCell_45) .cse2))))))))) (or (= |c_ULTIMATE.start_sll_insert_~last~0#1.base| .cse4) (and .cse6 .cse7 (or .cse8 (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_arrayElimCell_45 Int)) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1477 .cse1)) v_ArrVal_1477)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477) v_arrayElimCell_45) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5)))))))) (or (and .cse6 .cse7) (= |c_ULTIMATE.start_sll_insert_~last~0#1.offset| .cse9)) (or (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 v_DerPreprocessor_1) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5)) |c_ULTIMATE.start_main_~data~0#1|)) .cse10) (or .cse8 (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_arrayElimCell_45 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_1471))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1477) v_arrayElimCell_45) (select (select (store .cse3 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_1475) .cse4) .cse5))) (not (= v_ArrVal_1477 (store (select .cse11 |c_ULTIMATE.start_sll_insert_~new_node~0#1.base|) .cse1 (select v_ArrVal_1477 .cse1)))))))))))) is different from false [2024-11-08 14:00:36,134 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) (.cse13 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| .cse6 (store (select |c_#memory_$Pointer$#1.offset| .cse6) (+ 4 .cse13) |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|))) (.cse4 (+ .cse12 4)) (.cse5 (+ 4 |c_ULTIMATE.start_sll_insert_#t~ret7#1.offset|)) (.cse10 (= |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| .cse3))) (let ((.cse9 (not .cse10)) (.cse7 (forall ((v_ArrVal_1477 (Array Int Int)) (v_arrayElimCell_43 Int) (v_ArrVal_1471 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| .cse6 v_ArrVal_1471))) (or (forall ((v_ArrVal_1475 (Array Int Int))) (let ((.cse15 (store .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1477)) (.cse16 (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1475) .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_43) .cse16)) (forall ((v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse15 v_arrayElimCell_45) .cse16)))))) (not (= v_ArrVal_1477 (store (select .cse17 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 (select v_ArrVal_1477 .cse5)))))))) (.cse8 (or .cse10 (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_arrayElimCell_43 Int)) (let ((.cse14 (store |c_#memory_int#1| .cse6 v_ArrVal_1471))) (or (not (= v_ArrVal_1477 (store (select .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 (select v_ArrVal_1477 .cse5)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1477) v_arrayElimCell_43) (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1475) .cse3) .cse4))))))))) (and (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| .cse6 v_ArrVal_1471))) (or (forall ((v_ArrVal_1475 (Array Int Int))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1475) .cse3) .cse4))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1477 .cse0)) (forall ((v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1477) v_arrayElimCell_45) .cse0)))))) (not (= v_ArrVal_1477 (store (select .cse1 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 (select v_ArrVal_1477 .cse5))))))) (or (= .cse6 .cse3) (and .cse7 .cse8 (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_arrayElimCell_45 Int)) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 (select v_ArrVal_1477 .cse5)) v_ArrVal_1477)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse6 v_ArrVal_1471) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1477) v_arrayElimCell_45) (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1475) .cse3) .cse4))))) .cse9))) (or .cse10 (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse6 v_ArrVal_1471) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 v_DerPreprocessor_1) (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1475) .cse3) .cse4))))) (or (forall ((v_ArrVal_1477 (Array Int Int)) (v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1471 (Array Int Int)) (v_arrayElimCell_45 Int)) (let ((.cse11 (store |c_#memory_int#1| .cse6 v_ArrVal_1471))) (or (not (= v_ArrVal_1477 (store (select .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base|) .cse5 (select v_ArrVal_1477 .cse5)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1477) v_arrayElimCell_45) (select (select (store .cse2 |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_1475) .cse3) .cse4)))))) .cse9) (or (= .cse12 .cse13) (and .cse7 .cse8)))))) is different from false [2024-11-08 14:00:36,740 INFO L349 Elim1Store]: treesize reduction 405, result has 30.9 percent of original size [2024-11-08 14:00:36,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 56 case distinctions, treesize of input 2907 treesize of output 3008 [2024-11-08 14:00:37,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:37,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 2522 treesize of output 2848 [2024-11-08 14:00:37,248 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-08 14:00:37,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2420 treesize of output 2431 [2024-11-08 14:00:37,497 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-08 14:00:37,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2327 treesize of output 2382 [2024-11-08 14:00:37,691 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 2278 treesize of output 2234 [2024-11-08 14:00:37,924 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-08 14:00:37,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2234 treesize of output 2245 [2024-11-08 14:00:38,046 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 2235 treesize of output 2191 [2024-11-08 14:00:38,301 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-08 14:00:38,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2191 treesize of output 2246 [2024-11-08 14:00:38,560 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-08 14:00:38,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2142 treesize of output 2197 [2024-11-08 14:00:38,777 INFO L349 Elim1Store]: treesize reduction 96, result has 52.0 percent of original size [2024-11-08 14:00:38,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2093 treesize of output 2148