./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_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/sll2c_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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:58:32,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:58:32,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:58:32,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:58:32,172 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:58:32,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:58:32,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:58:32,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:58:32,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:58:32,188 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:58:32,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:58:32,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:58:32,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:58:32,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:58:32,191 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:58:32,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:58:32,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:58:32,192 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:58:32,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:58:32,192 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:58:32,192 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:58:32,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:58:32,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:58:32,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:58:32,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:58:32,195 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:58:32,195 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:58:32,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:58:32,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:58:32,196 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:58:32,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:58:32,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:58:32,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:58:32,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:58:32,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:58:32,197 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:58:32,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:58:32,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:58:32,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:58:32,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:58:32,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:58:32,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:58:32,198 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2024-11-08 13:58:32,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:58:32,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:58:32,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:58:32,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:58:32,405 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:58:32,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2024-11-08 13:58:33,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:58:33,770 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:58:33,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2024-11-08 13:58:33,783 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3523e1ab7/01a8a38e84ad44dcae15365f1d5f30a4/FLAGdc852fc47 [2024-11-08 13:58:34,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3523e1ab7/01a8a38e84ad44dcae15365f1d5f30a4 [2024-11-08 13:58:34,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:58:34,163 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:58:34,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:58:34,166 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:58:34,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:58:34,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@713fa278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34, skipping insertion in model container [2024-11-08 13:58:34,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:58:34,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/sll2c_insert_equal.i[24601,24614] [2024-11-08 13:58:34,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:58:34,480 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:58:34,511 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/sll2c_insert_equal.i[24601,24614] [2024-11-08 13:58:34,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:58:34,536 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:58:34,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34 WrapperNode [2024-11-08 13:58:34,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:58:34,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:58:34,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:58:34,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:58:34,546 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:58:34" (1/1) ... [2024-11-08 13:58:34,560 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:58:34" (1/1) ... [2024-11-08 13:58:34,582 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 143 [2024-11-08 13:58:34,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:58:34,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:58:34,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:58:34,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:58:34,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,609 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 14, 9]. 56 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-11-08 13:58:34,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,620 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:58:34,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:58:34,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:58:34,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:58:34,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (1/1) ... [2024-11-08 13:58:34,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:58:34,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:34,655 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:58:34,658 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:58:34,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:58:34,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:58:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:58:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:58:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:58:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:58:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 13:58:34,696 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 13:58:34,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:58:34,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:58:34,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:58:34,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:58:34,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:58:34,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:58:34,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:58:34,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:58:34,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:58:34,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:58:34,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:58:34,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:58:34,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:58:34,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:58:34,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:58:34,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:58:34,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:58:34,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:58:34,828 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:58:34,830 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:58:35,034 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-08 13:58:35,035 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:58:35,048 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:58:35,048 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-08 13:58:35,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:58:35 BoogieIcfgContainer [2024-11-08 13:58:35,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:58:35,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:58:35,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:58:35,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:58:35,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:58:34" (1/3) ... [2024-11-08 13:58:35,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6a047a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:58:35, skipping insertion in model container [2024-11-08 13:58:35,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:34" (2/3) ... [2024-11-08 13:58:35,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6a047a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:58:35, skipping insertion in model container [2024-11-08 13:58:35,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:58:35" (3/3) ... [2024-11-08 13:58:35,057 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2024-11-08 13:58:35,068 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:58:35,069 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:58:35,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:58:35,114 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;@7764dbd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:58:35,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:58:35,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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:58:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:58:35,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:35,123 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] [2024-11-08 13:58:35,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:35,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:35,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1369192097, now seen corresponding path program 1 times [2024-11-08 13:58:35,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:35,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913592875] [2024-11-08 13:58:35,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:35,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:58:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:58:35,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:35,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913592875] [2024-11-08 13:58:35,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913592875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:35,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:35,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:58:35,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043694146] [2024-11-08 13:58:35,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:35,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:58:35,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:35,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:58:35,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:58:35,488 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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:58:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:35,528 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2024-11-08 13:58:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:58:35,530 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), 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 25 [2024-11-08 13:58:35,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:35,537 INFO L225 Difference]: With dead ends: 65 [2024-11-08 13:58:35,537 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 13:58:35,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:58:35,543 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:35,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 13:58:35,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 13:58:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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:58:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-08 13:58:35,566 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 25 [2024-11-08 13:58:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:35,567 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-08 13:58:35,568 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), 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:58:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-08 13:58:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:58:35,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:35,569 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] [2024-11-08 13:58:35,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:58:35,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:35,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1579482442, now seen corresponding path program 1 times [2024-11-08 13:58:35,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:35,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150703047] [2024-11-08 13:58:35,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:35,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:35,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:35,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 13:58:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:58:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:35,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150703047] [2024-11-08 13:58:35,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150703047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:35,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:35,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:58:35,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076292670] [2024-11-08 13:58:35,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:35,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:58:35,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:35,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:58:35,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:58:35,764 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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:58:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:35,808 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-11-08 13:58:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:58:35,809 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), 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 25 [2024-11-08 13:58:35,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:35,809 INFO L225 Difference]: With dead ends: 52 [2024-11-08 13:58:35,810 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 13:58:35,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:58:35,811 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:35,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:35,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 13:58:35,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-11-08 13:58:35,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 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:58:35,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-08 13:58:35,819 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 25 [2024-11-08 13:58:35,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:35,819 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-08 13:58:35,820 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), 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:58:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-08 13:58:35,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 13:58:35,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:35,821 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:35,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:58:35,822 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:35,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:35,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1638915570, now seen corresponding path program 1 times [2024-11-08 13:58:35,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:35,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742933339] [2024-11-08 13:58:35,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:35,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:35,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:35,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:58:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:35,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:58:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 13:58:35,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:35,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742933339] [2024-11-08 13:58:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742933339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:35,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:58:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259825022] [2024-11-08 13:58:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:35,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:58:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:35,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:58:35,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:58:35,949 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 13:58:35,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:35,988 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2024-11-08 13:58:35,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:58:35,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2024-11-08 13:58:35,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:35,990 INFO L225 Difference]: With dead ends: 39 [2024-11-08 13:58:35,990 INFO L226 Difference]: Without dead ends: 31 [2024-11-08 13:58:35,990 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:58:35,991 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:35,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-08 13:58:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-08 13:58:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:35,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-08 13:58:35,999 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 33 [2024-11-08 13:58:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:36,000 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-08 13:58:36,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 13:58:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-08 13:58:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:58:36,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:36,001 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:36,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:58:36,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:36,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:36,002 INFO L85 PathProgramCache]: Analyzing trace with hash 802467380, now seen corresponding path program 1 times [2024-11-08 13:58:36,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:36,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583942896] [2024-11-08 13:58:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:37,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:58:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:37,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:58:37,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:58:37,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:37,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583942896] [2024-11-08 13:58:37,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583942896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:37,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533964253] [2024-11-08 13:58:37,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:37,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:37,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:37,637 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:58:37,639 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:58:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:37,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-08 13:58:37,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:37,914 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:58:38,122 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 13 treesize of output 9 [2024-11-08 13:58:38,191 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:38,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:58:38,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 25 treesize of output 13 [2024-11-08 13:58:38,313 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 18 treesize of output 13 [2024-11-08 13:58:38,493 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 17 treesize of output 3 [2024-11-08 13:58:38,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:58:38,595 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-08 13:58:38,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-08 13:58:38,788 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 65 treesize of output 32 [2024-11-08 13:58:38,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:38,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2024-11-08 13:58:38,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-08 13:58:38,851 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 21 treesize of output 13 [2024-11-08 13:58:38,923 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:38,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:39,012 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_406) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_405) (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))) (not (= v_ArrVal_406 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| (select v_ArrVal_406 |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|)))))) is different from false [2024-11-08 13:58:39,036 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9| Int)) (or (not (= v_ArrVal_406 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9| (select v_ArrVal_406 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_406) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_405) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (< |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9|))) is different from false [2024-11-08 13:58:39,052 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_406 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9|) (not (= v_ArrVal_406 (store (select |c_#memory_int#1| .cse0) |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9| (select v_ArrVal_406 |v_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset_9|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse0 v_ArrVal_406) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_405) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) is different from false [2024-11-08 13:58:39,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533964253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:39,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:58:39,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 41 [2024-11-08 13:58:39,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705586011] [2024-11-08 13:58:39,180 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:39,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-08 13:58:39,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:39,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-08 13:58:39,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1768, Unknown=3, NotChecked=258, Total=2162 [2024-11-08 13:58:39,182 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 32 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:58:40,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:40,198 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-08 13:58:40,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 13:58:40,199 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 32 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2024-11-08 13:58:40,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:40,199 INFO L225 Difference]: With dead ends: 49 [2024-11-08 13:58:40,200 INFO L226 Difference]: Without dead ends: 47 [2024-11-08 13:58:40,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=258, Invalid=3057, Unknown=3, NotChecked=342, Total=3660 [2024-11-08 13:58:40,201 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 67 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:40,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 391 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 13:58:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-08 13:58:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2024-11-08 13:58:40,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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:58:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-11-08 13:58:40,206 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 34 [2024-11-08 13:58:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:40,207 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-11-08 13:58:40,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 32 states have internal predecessors, (51), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:58:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-11-08 13:58:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 13:58:40,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:40,208 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:40,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 13:58:40,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:40,408 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:40,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:40,409 INFO L85 PathProgramCache]: Analyzing trace with hash 642377266, now seen corresponding path program 2 times [2024-11-08 13:58:40,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:40,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750867523] [2024-11-08 13:58:40,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:40,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:40,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:40,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:58:40,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:58:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 13:58:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:40,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750867523] [2024-11-08 13:58:40,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750867523] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:40,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506899979] [2024-11-08 13:58:40,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:58:40,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:40,562 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:58:40,563 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:58:40,685 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:58:40,685 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:58:40,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 13:58:40,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 13:58:40,711 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:58:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506899979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:40,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:58:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-11-08 13:58:40,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659672630] [2024-11-08 13:58:40,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:40,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:58:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:40,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:58:40,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:58:40,712 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:58:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:40,738 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-11-08 13:58:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:58:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-08 13:58:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:40,739 INFO L225 Difference]: With dead ends: 48 [2024-11-08 13:58:40,739 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 13:58:40,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:58:40,740 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:40,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 69 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 13:58:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-08 13:58:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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:58:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-08 13:58:40,748 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 35 [2024-11-08 13:58:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:40,750 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-08 13:58:40,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:58:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-08 13:58:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 13:58:40,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:40,751 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:40,765 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:58:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:40,952 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash 342309400, now seen corresponding path program 1 times [2024-11-08 13:58:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164770166] [2024-11-08 13:58:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:58:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:58:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 13:58:41,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:41,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164770166] [2024-11-08 13:58:41,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164770166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:41,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:41,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:58:41,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492236649] [2024-11-08 13:58:41,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:41,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:58:41,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:41,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:58:41,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:58:41,037 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:58:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:41,068 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-08 13:58:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:58:41,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-08 13:58:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:41,069 INFO L225 Difference]: With dead ends: 46 [2024-11-08 13:58:41,069 INFO L226 Difference]: Without dead ends: 35 [2024-11-08 13:58:41,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:58:41,070 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 84 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 13:58:41,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-08 13:58:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-08 13:58:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-08 13:58:41,074 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 35 [2024-11-08 13:58:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:41,074 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-08 13:58:41,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:58:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-08 13:58:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 13:58:41,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:41,075 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:41,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:58:41,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:41,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:41,076 INFO L85 PathProgramCache]: Analyzing trace with hash -325516838, now seen corresponding path program 1 times [2024-11-08 13:58:41,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:41,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213582160] [2024-11-08 13:58:41,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:41,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:58:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:58:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,179 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 13:58:41,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213582160] [2024-11-08 13:58:41,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213582160] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:41,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877633059] [2024-11-08 13:58:41,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:41,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:41,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:41,182 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:58:41,184 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:58:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 13:58:41,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 13:58:41,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 13:58:41,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877633059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:41,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:41,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-11-08 13:58:41,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574923745] [2024-11-08 13:58:41,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:41,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 13:58:41,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:41,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 13:58:41,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 13:58:41,385 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 13:58:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:41,460 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-11-08 13:58:41,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:58:41,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-08 13:58:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:41,462 INFO L225 Difference]: With dead ends: 42 [2024-11-08 13:58:41,462 INFO L226 Difference]: Without dead ends: 33 [2024-11-08 13:58:41,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:58:41,463 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:41,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 142 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-08 13:58:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-08 13:58:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 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:58:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-08 13:58:41,471 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 36 [2024-11-08 13:58:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:41,473 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-08 13:58:41,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 13:58:41,473 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-08 13:58:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 13:58:41,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:41,474 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:41,486 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 13:58:41,674 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 13:58:41,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:41,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:41,675 INFO L85 PathProgramCache]: Analyzing trace with hash -268258536, now seen corresponding path program 1 times [2024-11-08 13:58:41,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:41,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581806941] [2024-11-08 13:58:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:41,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:58:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:58:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 13:58:41,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:41,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581806941] [2024-11-08 13:58:41,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581806941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:41,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567122007] [2024-11-08 13:58:41,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:41,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:41,889 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 13:58:41,890 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 13:58:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:42,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-08 13:58:42,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:42,076 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 13 treesize of output 9 [2024-11-08 13:58:42,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-08 13:58:42,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 13:58:42,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 13:58:42,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-08 13:58:42,198 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 21 treesize of output 13 [2024-11-08 13:58:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 13:58:42,237 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 13:58:42,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567122007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:42,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 13:58:42,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 20 [2024-11-08 13:58:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522508450] [2024-11-08 13:58:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:42,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 13:58:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 13:58:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-11-08 13:58:42,238 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:58:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:42,397 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-11-08 13:58:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 13:58:42,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-08 13:58:42,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:42,398 INFO L225 Difference]: With dead ends: 46 [2024-11-08 13:58:42,398 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 13:58:42,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2024-11-08 13:58:42,399 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:42,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 164 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:58:42,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 13:58:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2024-11-08 13:58:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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:58:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-11-08 13:58:42,403 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 36 [2024-11-08 13:58:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:42,403 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-11-08 13:58:42,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 13:58:42,404 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-11-08 13:58:42,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:58:42,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:42,404 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:42,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 13:58:42,604 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 13:58:42,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:42,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:42,605 INFO L85 PathProgramCache]: Analyzing trace with hash 518615240, now seen corresponding path program 1 times [2024-11-08 13:58:42,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:42,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448926874] [2024-11-08 13:58:42,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:42,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:42,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:42,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:58:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:43,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:58:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:58:43,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:43,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448926874] [2024-11-08 13:58:43,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448926874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:43,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482706529] [2024-11-08 13:58:43,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:43,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:43,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:43,064 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 13:58:43,065 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 13:58:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:43,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-08 13:58:43,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:43,205 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:58:43,323 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:43,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:58:43,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:58:43,399 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:58:43,399 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 34 treesize of output 33 [2024-11-08 13:58:43,462 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 38 treesize of output 14 [2024-11-08 13:58:43,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:58:43,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:43,555 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 46 treesize of output 35 [2024-11-08 13:58:43,572 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-08 13:58:43,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-08 13:58:43,724 INFO L349 Elim1Store]: treesize reduction 37, result has 48.6 percent of original size [2024-11-08 13:58:43,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 67 [2024-11-08 13:58:43,742 INFO L349 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2024-11-08 13:58:43,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 86 [2024-11-08 13:58:43,792 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 38 treesize of output 32 [2024-11-08 13:58:43,828 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 28 treesize of output 20 [2024-11-08 13:58:43,866 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 28 treesize of output 12 [2024-11-08 13:58:43,869 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:58:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:43,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:44,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482706529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:44,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:58:44,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23] total 34 [2024-11-08 13:58:44,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296588771] [2024-11-08 13:58:44,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:44,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 13:58:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:44,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 13:58:44,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1222, Unknown=15, NotChecked=0, Total=1332 [2024-11-08 13:58:44,105 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 34 states, 32 states have (on average 1.65625) internal successors, (53), 26 states have internal predecessors, (53), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 13:58:44,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:44,666 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-11-08 13:58:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 13:58:44,666 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 1.65625) internal successors, (53), 26 states have internal predecessors, (53), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2024-11-08 13:58:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:44,667 INFO L225 Difference]: With dead ends: 64 [2024-11-08 13:58:44,667 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 13:58:44,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=193, Invalid=2443, Unknown=16, NotChecked=0, Total=2652 [2024-11-08 13:58:44,668 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:44,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 344 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 13:58:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 13:58:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 37. [2024-11-08 13:58:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-08 13:58:44,673 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 37 [2024-11-08 13:58:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:44,673 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-08 13:58:44,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 1.65625) internal successors, (53), 26 states have internal predecessors, (53), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-08 13:58:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-08 13:58:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 13:58:44,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:44,674 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:44,687 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 13:58:44,874 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 13:58:44,874 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:44,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:44,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1102755574, now seen corresponding path program 1 times [2024-11-08 13:58:44,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:44,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987428450] [2024-11-08 13:58:44,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:44,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:45,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:58:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:45,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 13:58:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:45,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 13:58:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:58:45,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:45,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987428450] [2024-11-08 13:58:45,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987428450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:45,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047828495] [2024-11-08 13:58:45,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:45,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:45,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:45,592 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 13:58:45,593 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 13:58:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:45,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 107 conjuncts are in the unsatisfiable core [2024-11-08 13:58:45,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:45,981 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2024-11-08 13:58:46,160 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:58:46,234 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:58:46,291 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-08 13:58:46,292 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 13:58:46,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:46,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2024-11-08 13:58:46,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-08 13:58:46,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-08 13:58:46,483 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-08 13:58:46,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 62 [2024-11-08 13:58:46,488 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 13:58:46,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 19 [2024-11-08 13:58:46,555 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 13:58:46,641 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 13:58:46,645 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 13:58:46,755 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:46,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:46,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:46,832 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 61 treesize of output 62 [2024-11-08 13:58:46,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:46,843 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 120 treesize of output 123 [2024-11-08 13:58:46,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:46,848 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 100 treesize of output 92 [2024-11-08 13:58:46,853 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 44 treesize of output 38 [2024-11-08 13:58:46,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:46,863 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 158 treesize of output 149 [2024-11-08 13:58:46,871 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 29 treesize of output 23 [2024-11-08 13:58:47,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (= .cse19 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse10 (not .cse1)) (.cse13 (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (or (not (= v_ArrVal_1348 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))))))) (let ((.cse2 (or .cse10 .cse13)) (.cse3 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347))) (or (= (select v_ArrVal_1348 (+ 4 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))) (not (= v_ArrVal_1348 (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))))))) (.cse5 (or .cse1 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int)) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_47) (+ 4 v_arrayElimCell_50)))))))) (.cse0 (= |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| .cse19)) (.cse6 (or .cse1 (forall ((v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_47) .cse4)) (not (= v_ArrVal_1348 (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (.cse7 (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_47) .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))) (not (= v_ArrVal_1348 (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))))) (.cse8 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347))) (let ((.cse14 (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))) (not (= v_ArrVal_1348 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse14 v_arrayElimCell_47) (+ 4 v_arrayElimCell_50)))))))) (.cse12 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset|))) (and (or .cse0 (and (or .cse1 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1347 (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_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_1) (+ 4 v_arrayElimCell_50))))) .cse2 .cse3)) (or .cse1 (forall ((v_ArrVal_1347 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse4)))) (or .cse0 (and .cse5 .cse6 .cse7 .cse8 .cse2)) (or (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))) (not (= v_ArrVal_1348 (store (select .cse9 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) .cse10) (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1348 .cse4)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))) (not (= v_ArrVal_1348 (store (select .cse11 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))))))) (or (and (or .cse1 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3) (+ 4 v_arrayElimCell_50))))) .cse3) .cse12) (or (and .cse5 (or .cse0 .cse10 .cse13) .cse6 .cse7 .cse8) .cse12)))))) is different from false [2024-11-08 13:58:47,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse20 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (= .cse20 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) (let ((.cse1 (+ 4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) (.cse13 (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (or (not (= v_ArrVal_1348 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51)))))) (.cse3 (not .cse2))) (let ((.cse6 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= (select v_ArrVal_1348 (+ 4 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse21 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))))))) (.cse8 (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse5 (= .cse20 |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|)) (.cse9 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1347))) (let ((.cse19 (store .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348))) (or (not (= v_ArrVal_1348 (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_47) (+ 4 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse19 v_arrayElimCell_48) (+ 4 v_arrayElimCell_51)))))))) (.cse7 (or .cse13 .cse3)) (.cse10 (or .cse2 (forall ((v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= (select (select (store .cse17 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_47) .cse1) |c_ULTIMATE.start_main_~data~0#1|)))))) (.cse11 (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1347))) (let ((.cse16 (store .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348))) (or (not (= v_ArrVal_1348 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= (select (select .cse16 v_arrayElimCell_47) .cse1) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_48) (+ 4 v_arrayElimCell_51)))))))) (.cse12 (or (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int)) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_47) (+ 4 v_arrayElimCell_50)))))) .cse2))) (and (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1348 .cse1)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51)))))) (or .cse2 (forall ((v_ArrVal_1347 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) .cse1)))) (or .cse3 (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse4 (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))))))) (or .cse5 (and .cse6 (or .cse2 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1347 (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_circular_insert_~last~1#1.base| v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_1) (+ 4 v_arrayElimCell_50))))) .cse7)) (or .cse8 (and .cse6 (or .cse2 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_3 Int)) (= (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_DerPreprocessor_3) (+ 4 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~data~0#1|))))) (or .cse8 (and .cse9 .cse10 .cse11 .cse12 (or .cse13 .cse3 .cse5))) (or .cse5 (and .cse9 .cse7 .cse10 .cse11 .cse12))))))) is different from false [2024-11-08 13:58:47,626 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse7 (= |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| .cse19))) (let ((.cse12 (+ |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| 4)) (.cse10 (not .cse7)) (.cse11 (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (or (not (= (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) v_ArrVal_1348)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| .cse8 v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))))))) (let ((.cse3 (or .cse10 .cse11)) (.cse1 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse21 (store |c_#memory_int#1| .cse8 v_ArrVal_1347))) (let ((.cse22 (store .cse21 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1348))) (or (not (= v_ArrVal_1348 (store (select .cse21 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_arrayElimCell_47) (+ 4 v_arrayElimCell_50))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_arrayElimCell_48) (+ 4 v_arrayElimCell_51)))))))) (.cse2 (or .cse7 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int)) (let ((.cse20 (store |c_#memory_int#1| .cse8 v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse20 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1348) v_arrayElimCell_47) (+ 4 v_arrayElimCell_50)))))))) (.cse0 (= .cse8 .cse19)) (.cse4 (or .cse7 (forall ((v_ArrVal_1348 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int)) (let ((.cse18 (store |c_#memory_int#1| .cse8 v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse18 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse18 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1348) v_arrayElimCell_47) .cse12))))))) (.cse5 (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_47 Int) (v_arrayElimCell_48 Int)) (let ((.cse16 (store |c_#memory_int#1| .cse8 v_ArrVal_1347))) (let ((.cse17 (store .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1348))) (or (not (= v_ArrVal_1348 (store (select .cse16 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_47) .cse12)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse17 v_arrayElimCell_48) (+ 4 v_arrayElimCell_51)))))))) (.cse9 (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse15 (store |c_#memory_int#1| .cse8 v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= (select v_ArrVal_1348 (+ 4 v_arrayElimCell_50)) |c_ULTIMATE.start_main_~data~0#1|) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse15 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51)))))))) (and (or .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5)) (or .cse0 (and .cse3 .cse6 (or .cse7 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_1 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse8 v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_1) (+ 4 v_arrayElimCell_50))))))) (or .cse9 (and .cse1 .cse2 (or .cse10 .cse0 .cse11) .cse4 .cse5)) (or .cse9 (and .cse6 (or .cse7 (forall ((v_arrayElimCell_50 Int) (v_ArrVal_1347 (Array Int Int)) (v_DerPreprocessor_3 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| .cse8 v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_DerPreprocessor_3) (+ 4 v_arrayElimCell_50))))))) (or .cse7 (forall ((v_ArrVal_1347 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| .cse8 v_ArrVal_1347) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) .cse12)))) (or .cse10 (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse13 (store |c_#memory_int#1| .cse8 v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse13 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))))))) (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_51 Int) (v_ArrVal_1347 (Array Int Int)) (v_arrayElimCell_48 Int)) (let ((.cse14 (store |c_#memory_int#1| .cse8 v_ArrVal_1347))) (or (not (= v_ArrVal_1348 (store (select .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| (select v_ArrVal_1348 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select v_ArrVal_1348 .cse12)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1348) v_arrayElimCell_48) (+ 4 v_arrayElimCell_51))))))))))) is different from false [2024-11-08 13:58:49,797 INFO L349 Elim1Store]: treesize reduction 1615, result has 18.7 percent of original size [2024-11-08 13:58:49,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 21 new quantified variables, introduced 211 case distinctions, treesize of input 2495 treesize of output 2688 [2024-11-08 13:58:49,884 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 1745 treesize of output 1741 [2024-11-08 13:58:50,098 INFO L224 Elim1Store]: Index analysis took 113 ms [2024-11-08 13:58:51,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:51,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 2255 treesize of output 3705 [2024-11-08 13:58:52,875 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-08 13:58:52,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2046 treesize of output 2080 [2024-11-08 13:58:53,376 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2024-11-08 13:58:53,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2033 treesize of output 2052 [2024-11-08 13:58:54,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:54,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2024 treesize of output 2032 [2024-11-08 13:58:55,278 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-08 13:58:55,279 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 2019 treesize of output 2034 [2024-11-08 13:58:55,796 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 2010 treesize of output 2006 [2024-11-08 13:58:56,359 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-08 13:58:56,359 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 2006 treesize of output 2021 [2024-11-08 13:58:56,927 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-08 13:58:56,928 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 1997 treesize of output 2012 [2024-11-08 13:58:57,445 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 1988 treesize of output 1986 [2024-11-08 13:58:57,972 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 2000 treesize of output 1996 [2024-11-08 13:58:58,548 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-08 13:58:58,548 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 1996 treesize of output 2011 [2024-11-08 13:58:59,155 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-08 13:58:59,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1987 treesize of output 2021 [2024-11-08 13:58:59,753 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-08 13:58:59,753 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 1974 treesize of output 1989 [2024-11-08 13:59:00,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:00,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1965 treesize of output 1973 [2024-11-08 13:59:01,582 INFO L349 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2024-11-08 13:59:01,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1960 treesize of output 1979 [2024-11-08 13:59:02,753 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 1951 treesize of output 1947 [2024-11-08 13:59:03,517 INFO L349 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2024-11-08 13:59:03,518 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 1947 treesize of output 1962 [2024-11-08 13:59:04,109 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 1952 treesize of output 1948