./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/dll2n_insert_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:37:04,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:37:04,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:37:04,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:37:04,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:37:04,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:37:04,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:37:04,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:37:04,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:37:04,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:37:04,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:37:04,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:37:04,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:37:04,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:37:04,549 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:37:04,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:37:04,550 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:37:04,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:37:04,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:37:04,551 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:37:04,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:37:04,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:37:04,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:37:04,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:37:04,553 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:37:04,553 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:37:04,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:37:04,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:37:04,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:37:04,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:37:04,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:37:04,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:37:04,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:37:04,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:37:04,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:37:04,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:37:04,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:37:04,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:37:04,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:37:04,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:37:04,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:37:04,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:37:04,556 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2024-11-11 19:37:04,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:37:04,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:37:04,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:37:04,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:37:04,798 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:37:04,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-11 19:37:06,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:37:06,275 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:37:06,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2024-11-11 19:37:06,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a725fa89/ad73cd3e2dac45d6b3047aeaceefe8ab/FLAGee2da5776 [2024-11-11 19:37:06,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a725fa89/ad73cd3e2dac45d6b3047aeaceefe8ab [2024-11-11 19:37:06,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:37:06,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:37:06,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:37:06,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:37:06,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:37:06,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:37:06" (1/1) ... [2024-11-11 19:37:06,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195fb735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:06, skipping insertion in model container [2024-11-11 19:37:06,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:37:06" (1/1) ... [2024-11-11 19:37:06,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:37:06,935 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/dll2n_insert_unequal.i[24989,25002] [2024-11-11 19:37:06,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:37:06,947 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:37:06,994 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/dll2n_insert_unequal.i[24989,25002] [2024-11-11 19:37:06,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:37:07,018 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:37:07,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07 WrapperNode [2024-11-11 19:37:07,018 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:37:07,019 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:37:07,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:37:07,020 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:37:07,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,058 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 168 [2024-11-11 19:37:07,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:37:07,059 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:37:07,059 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:37:07,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:37:07,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,087 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 21, 8]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2024-11-11 19:37:07,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:37:07,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:37:07,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:37:07,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:37:07,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (1/1) ... [2024-11-11 19:37:07,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:37:07,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:37:07,146 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-11 19:37:07,148 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-11 19:37:07,186 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-11 19:37:07,187 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 19:37:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 19:37:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-11 19:37:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 19:37:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 19:37:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-11 19:37:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 19:37:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-11 19:37:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-11 19:37:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-11 19:37:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:37:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:37:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 19:37:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:37:07,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:37:07,294 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:37:07,295 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:37:07,317 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-11 19:37:07,593 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-11-11 19:37:07,594 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:37:07,603 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:37:07,603 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-11 19:37:07,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:37:07 BoogieIcfgContainer [2024-11-11 19:37:07,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:37:07,605 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:37:07,605 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:37:07,608 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:37:07,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:37:06" (1/3) ... [2024-11-11 19:37:07,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec797ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:37:07, skipping insertion in model container [2024-11-11 19:37:07,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:37:07" (2/3) ... [2024-11-11 19:37:07,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec797ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:37:07, skipping insertion in model container [2024-11-11 19:37:07,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:37:07" (3/3) ... [2024-11-11 19:37:07,610 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2024-11-11 19:37:07,627 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:37:07,627 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:37:07,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:37:07,675 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;@1ac8588d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:37:07,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:37:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:07,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 19:37:07,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:07,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:07,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:07,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:07,691 INFO L85 PathProgramCache]: Analyzing trace with hash -504255867, now seen corresponding path program 1 times [2024-11-11 19:37:07,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:07,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759659500] [2024-11-11 19:37:07,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:07,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:07,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759659500] [2024-11-11 19:37:07,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759659500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:37:07,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:37:07,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:37:07,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066115615] [2024-11-11 19:37:07,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:37:07,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:37:07,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:07,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:37:07,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:37:07,903 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.65625) internal successors, (53), 34 states have internal predecessors, (53), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:07,915 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2024-11-11 19:37:07,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:37:07,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-11 19:37:07,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:07,922 INFO L225 Difference]: With dead ends: 64 [2024-11-11 19:37:07,922 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 19:37:07,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:37:07,926 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:07,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:37:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 19:37:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 19:37:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2024-11-11 19:37:07,952 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 15 [2024-11-11 19:37:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:07,952 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2024-11-11 19:37:07,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2024-11-11 19:37:07,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 19:37:07,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:07,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:07,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:37:07,953 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:07,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:07,954 INFO L85 PathProgramCache]: Analyzing trace with hash 775433970, now seen corresponding path program 1 times [2024-11-11 19:37:07,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:07,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484787954] [2024-11-11 19:37:07,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:08,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:08,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484787954] [2024-11-11 19:37:08,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484787954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:37:08,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:37:08,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:37:08,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771168520] [2024-11-11 19:37:08,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:37:08,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:37:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:37:08,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:37:08,084 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:08,098 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-11 19:37:08,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:37:08,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-11 19:37:08,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:08,099 INFO L225 Difference]: With dead ends: 52 [2024-11-11 19:37:08,099 INFO L226 Difference]: Without dead ends: 32 [2024-11-11 19:37:08,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:37:08,100 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:08,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:37:08,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-11 19:37:08,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-11 19:37:08,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-11-11 19:37:08,106 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2024-11-11 19:37:08,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:08,107 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-11-11 19:37:08,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-11-11 19:37:08,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 19:37:08,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:08,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:08,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:37:08,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:08,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1038406110, now seen corresponding path program 1 times [2024-11-11 19:37:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:08,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679468046] [2024-11-11 19:37:08,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:08,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:08,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:08,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679468046] [2024-11-11 19:37:08,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679468046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:37:08,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:37:08,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:37:08,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586226955] [2024-11-11 19:37:08,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:37:08,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:37:08,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:08,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:37:08,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:37:08,210 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:08,226 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2024-11-11 19:37:08,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:37:08,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-11 19:37:08,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:08,227 INFO L225 Difference]: With dead ends: 56 [2024-11-11 19:37:08,227 INFO L226 Difference]: Without dead ends: 31 [2024-11-11 19:37:08,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:37:08,228 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:08,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:37:08,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-11 19:37:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-11 19:37:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2024-11-11 19:37:08,232 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 20 [2024-11-11 19:37:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:08,232 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2024-11-11 19:37:08,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2024-11-11 19:37:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 19:37:08,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:08,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:08,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:37:08,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:08,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1976697508, now seen corresponding path program 1 times [2024-11-11 19:37:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:08,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961013632] [2024-11-11 19:37:08,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:08,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:08,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961013632] [2024-11-11 19:37:08,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961013632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:37:08,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139341874] [2024-11-11 19:37:08,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:08,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:37:08,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:37:08,353 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-11 19:37:08,354 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-11 19:37:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:08,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 19:37:08,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:37:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:08,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:37:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:08,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139341874] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:37:08,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:37:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-11 19:37:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802716775] [2024-11-11 19:37:08,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:37:08,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:37:08,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:08,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:37:08,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:37:08,559 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:08,581 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-11 19:37:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:37:08,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-11 19:37:08,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:08,583 INFO L225 Difference]: With dead ends: 53 [2024-11-11 19:37:08,584 INFO L226 Difference]: Without dead ends: 33 [2024-11-11 19:37:08,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:37:08,585 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:08,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:37:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-11 19:37:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-11 19:37:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-11 19:37:08,592 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2024-11-11 19:37:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:08,592 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-11 19:37:08,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-11 19:37:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 19:37:08,593 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:08,593 INFO L218 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-11 19:37:08,608 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-11 19:37:08,793 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-11 19:37:08,794 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:08,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:08,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1871980112, now seen corresponding path program 1 times [2024-11-11 19:37:08,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:08,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649579576] [2024-11-11 19:37:08,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:08,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:37:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:08,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649579576] [2024-11-11 19:37:08,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649579576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:37:08,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:37:08,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:37:08,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634614660] [2024-11-11 19:37:08,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:37:08,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:37:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:08,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:37:08,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:37:08,861 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:08,872 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2024-11-11 19:37:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:37:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-11 19:37:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:08,873 INFO L225 Difference]: With dead ends: 46 [2024-11-11 19:37:08,873 INFO L226 Difference]: Without dead ends: 35 [2024-11-11 19:37:08,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:37:08,874 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:08,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:37:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-11 19:37:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-11 19:37:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-11 19:37:08,877 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 25 [2024-11-11 19:37:08,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:08,877 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-11 19:37:08,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:08,878 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-11 19:37:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 19:37:08,878 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:08,878 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:08,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 19:37:08,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:08,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:08,879 INFO L85 PathProgramCache]: Analyzing trace with hash 835167343, now seen corresponding path program 1 times [2024-11-11 19:37:08,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:08,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705319001] [2024-11-11 19:37:08,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:08,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:37:09,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:09,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705319001] [2024-11-11 19:37:09,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705319001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:37:09,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:37:09,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:37:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28354618] [2024-11-11 19:37:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:37:09,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:37:09,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:09,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:37:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:37:09,019 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:09,033 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2024-11-11 19:37:09,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:37:09,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-11 19:37:09,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:09,035 INFO L225 Difference]: With dead ends: 49 [2024-11-11 19:37:09,035 INFO L226 Difference]: Without dead ends: 36 [2024-11-11 19:37:09,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:37:09,037 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:09,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 65 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:37:09,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-11 19:37:09,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-11 19:37:09,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:09,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-11 19:37:09,043 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 26 [2024-11-11 19:37:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:09,045 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-11 19:37:09,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:09,045 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-11 19:37:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 19:37:09,045 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:09,045 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:09,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 19:37:09,046 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:09,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:09,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1615339204, now seen corresponding path program 1 times [2024-11-11 19:37:09,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:09,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227644479] [2024-11-11 19:37:09,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:09,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:10,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:10,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227644479] [2024-11-11 19:37:10,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227644479] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:37:10,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890667606] [2024-11-11 19:37:10,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:10,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:37:10,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:37:10,454 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-11 19:37:10,456 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-11 19:37:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:10,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-11 19:37:10,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:37:10,820 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-11 19:37:10,923 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-11 19:37:10,924 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-11 19:37:10,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:37:11,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-11 19:37:11,064 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-11 19:37:11,065 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 50 treesize of output 45 [2024-11-11 19:37:11,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-11 19:37:11,255 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-11 19:37:11,255 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 28 treesize of output 30 [2024-11-11 19:37:11,352 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 37 treesize of output 26 [2024-11-11 19:37:11,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-11 19:37:11,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2024-11-11 19:37:11,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-11-11 19:37:11,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-11 19:37:11,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-11 19:37:11,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-11 19:37:11,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:11,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:37:12,157 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 Int) (v_ArrVal_591 (Array Int Int)) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_586 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (store (store (store |c_#memory_int#1| .cse0 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_586) .cse0) .cse1 v_ArrVal_588)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_591) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_585) .cse0) .cse1) v_ArrVal_593)) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-11 19:37:12,173 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 72 treesize of output 52 [2024-11-11 19:37:12,177 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 56 treesize of output 40 [2024-11-11 19:37:13,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:13,678 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 3 case distinctions, treesize of input 324 treesize of output 316 [2024-11-11 19:37:13,687 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 108 treesize of output 100 [2024-11-11 19:37:13,694 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 65 treesize of output 63 [2024-11-11 19:37:13,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2024-11-11 19:37:13,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:13,707 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 2 case distinctions, treesize of input 113 treesize of output 103 [2024-11-11 19:37:13,712 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 185 treesize of output 167 [2024-11-11 19:37:13,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 127 [2024-11-11 19:37:13,721 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 127 treesize of output 119 [2024-11-11 19:37:13,726 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 53 treesize of output 49 [2024-11-11 19:37:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:14,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890667606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:37:14,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:37:14,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 46 [2024-11-11 19:37:14,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278937708] [2024-11-11 19:37:14,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:37:14,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-11 19:37:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:14,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-11 19:37:14,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1770, Unknown=67, NotChecked=86, Total=2070 [2024-11-11 19:37:14,021 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:15,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:15,339 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-11 19:37:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 19:37:15,339 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-11 19:37:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:15,340 INFO L225 Difference]: With dead ends: 60 [2024-11-11 19:37:15,340 INFO L226 Difference]: Without dead ends: 58 [2024-11-11 19:37:15,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=329, Invalid=3266, Unknown=69, NotChecked=118, Total=3782 [2024-11-11 19:37:15,341 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 74 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:15,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 274 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 962 Invalid, 0 Unknown, 68 Unchecked, 0.7s Time] [2024-11-11 19:37:15,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-11 19:37:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2024-11-11 19:37:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2024-11-11 19:37:15,346 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 26 [2024-11-11 19:37:15,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:15,346 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2024-11-11 19:37:15,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 46 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2024-11-11 19:37:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 19:37:15,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:15,347 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:15,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 19:37:15,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-11 19:37:15,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:15,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:15,549 INFO L85 PathProgramCache]: Analyzing trace with hash 201100899, now seen corresponding path program 1 times [2024-11-11 19:37:15,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:15,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430090975] [2024-11-11 19:37:15,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:15,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:37:15,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430090975] [2024-11-11 19:37:15,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430090975] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:37:15,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139658936] [2024-11-11 19:37:15,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:15,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:37:15,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:37:15,645 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-11 19:37:15,646 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-11 19:37:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:15,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-11 19:37:15,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:37:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:37:15,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:37:15,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:37:15,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139658936] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:37:15,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:37:15,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-11 19:37:15,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476940690] [2024-11-11 19:37:15,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:37:15,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:37:15,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:15,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:37:15,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:37:15,857 INFO L87 Difference]: Start difference. First operand 40 states and 54 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:15,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:15,936 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2024-11-11 19:37:15,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:37:15,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-11 19:37:15,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:15,937 INFO L225 Difference]: With dead ends: 53 [2024-11-11 19:37:15,937 INFO L226 Difference]: Without dead ends: 42 [2024-11-11 19:37:15,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:37:15,938 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:15,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:37:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-11 19:37:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-11 19:37:15,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2024-11-11 19:37:15,946 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 27 [2024-11-11 19:37:15,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:15,948 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2024-11-11 19:37:15,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:15,948 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2024-11-11 19:37:15,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 19:37:15,949 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:15,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:15,963 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-11 19:37:16,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:37:16,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:16,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:16,154 INFO L85 PathProgramCache]: Analyzing trace with hash 258359201, now seen corresponding path program 1 times [2024-11-11 19:37:16,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:16,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480150643] [2024-11-11 19:37:16,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:16,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:37:16,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:16,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480150643] [2024-11-11 19:37:16,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480150643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:37:16,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499161600] [2024-11-11 19:37:16,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:16,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:37:16,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:37:16,327 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-11 19:37:16,327 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-11 19:37:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:16,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-11 19:37:16,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:37:16,476 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-11 19:37:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:37:16,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:37:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:37:16,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499161600] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:37:16,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:37:16,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2024-11-11 19:37:16,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162862488] [2024-11-11 19:37:16,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:37:16,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 19:37:16,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:16,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 19:37:16,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:37:16,516 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:16,619 INFO L93 Difference]: Finished difference Result 74 states and 102 transitions. [2024-11-11 19:37:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 19:37:16,620 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-11 19:37:16,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:16,620 INFO L225 Difference]: With dead ends: 74 [2024-11-11 19:37:16,620 INFO L226 Difference]: Without dead ends: 41 [2024-11-11 19:37:16,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-11 19:37:16,622 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:16,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 202 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:37:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-11 19:37:16,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-11 19:37:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-11 19:37:16,626 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 27 [2024-11-11 19:37:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:16,626 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-11 19:37:16,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:16,627 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-11 19:37:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 19:37:16,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:16,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:16,640 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-11 19:37:16,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:37:16,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:16,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:16,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1464037342, now seen corresponding path program 1 times [2024-11-11 19:37:16,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:16,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956525220] [2024-11-11 19:37:16,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:16,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:17,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:37:17,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:17,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956525220] [2024-11-11 19:37:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956525220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:37:17,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:37:17,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 19:37:17,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548105656] [2024-11-11 19:37:17,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:37:17,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 19:37:17,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:17,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 19:37:17,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 19:37:17,040 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:17,149 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-11 19:37:17,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 19:37:17,150 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-11 19:37:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:17,150 INFO L225 Difference]: With dead ends: 53 [2024-11-11 19:37:17,151 INFO L226 Difference]: Without dead ends: 46 [2024-11-11 19:37:17,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-11 19:37:17,152 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:17,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 139 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:37:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-11 19:37:17,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-11-11 19:37:17,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-11-11 19:37:17,159 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 27 [2024-11-11 19:37:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:17,162 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-11-11 19:37:17,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:17,162 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-11-11 19:37:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 19:37:17,163 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:17,163 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:17,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 19:37:17,163 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:17,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:17,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2045561648, now seen corresponding path program 2 times [2024-11-11 19:37:17,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:17,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649119398] [2024-11-11 19:37:17,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:17,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:37:17,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649119398] [2024-11-11 19:37:17,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649119398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:37:17,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897595208] [2024-11-11 19:37:17,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:37:17,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:37:17,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:37:17,287 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-11 19:37:17,288 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-11 19:37:17,470 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:37:17,471 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:37:17,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 19:37:17,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:37:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:37:17,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:37:17,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897595208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:37:17,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:37:17,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-11-11 19:37:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889670063] [2024-11-11 19:37:17,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:37:17,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:37:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:17,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:37:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:37:17,499 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:17,515 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-11-11 19:37:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:37:17,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-11 19:37:17,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:17,516 INFO L225 Difference]: With dead ends: 53 [2024-11-11 19:37:17,516 INFO L226 Difference]: Without dead ends: 36 [2024-11-11 19:37:17,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-11 19:37:17,517 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:17,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 59 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:37:17,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-11 19:37:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-11-11 19:37:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-11 19:37:17,521 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 27 [2024-11-11 19:37:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:17,521 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-11 19:37:17,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-11 19:37:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 19:37:17,521 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:17,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:17,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 19:37:17,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-11 19:37:17,722 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:17,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1857767657, now seen corresponding path program 1 times [2024-11-11 19:37:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889526527] [2024-11-11 19:37:17,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:17,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:37:17,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:17,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889526527] [2024-11-11 19:37:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889526527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:37:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697373256] [2024-11-11 19:37:17,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:17,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:37:17,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:37:17,901 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-11 19:37:17,902 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-11 19:37:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:18,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 19:37:18,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:37:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:37:18,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:37:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 19:37:18,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697373256] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:37:18,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:37:18,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-11 19:37:18,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827762358] [2024-11-11 19:37:18,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:37:18,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 19:37:18,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:37:18,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 19:37:18,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:37:18,116 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:37:18,178 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-11 19:37:18,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:37:18,178 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-11 19:37:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:37:18,179 INFO L225 Difference]: With dead ends: 44 [2024-11-11 19:37:18,179 INFO L226 Difference]: Without dead ends: 35 [2024-11-11 19:37:18,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-11 19:37:18,179 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:37:18,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 152 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:37:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-11 19:37:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-11-11 19:37:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-11-11 19:37:18,183 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2024-11-11 19:37:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:37:18,183 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-11-11 19:37:18,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:37:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-11-11 19:37:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 19:37:18,184 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:37:18,184 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:37:18,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 19:37:18,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:37:18,385 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:37:18,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:37:18,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1756277405, now seen corresponding path program 1 times [2024-11-11 19:37:18,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:37:18,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510581171] [2024-11-11 19:37:18,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:37:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:19,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:19,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:37:19,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510581171] [2024-11-11 19:37:19,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510581171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:37:19,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926329818] [2024-11-11 19:37:19,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:37:19,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:37:19,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:37:19,551 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:37:19,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 19:37:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:37:19,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-11 19:37:19,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:37:19,881 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-11 19:37:19,948 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-11 19:37:19,948 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-11 19:37:19,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-11 19:37:20,034 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-11 19:37:20,035 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-11 19:37:20,161 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-11 19:37:20,162 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 28 treesize of output 30 [2024-11-11 19:37:20,245 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-11 19:37:20,260 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 37 treesize of output 26 [2024-11-11 19:37:20,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:37:20,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2024-11-11 19:37:20,454 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-11 19:37:20,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 35 [2024-11-11 19:37:20,470 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-11 19:37:20,471 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 144 treesize of output 89 [2024-11-11 19:37:20,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 37 [2024-11-11 19:37:20,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 19 [2024-11-11 19:37:20,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 15 [2024-11-11 19:37:20,539 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 52 treesize of output 35 [2024-11-11 19:37:20,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-11 19:37:20,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-11 19:37:20,604 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-11 19:37:20,650 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-11 19:37:20,654 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-11 19:37:20,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-11 19:37:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:37:20,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:37:20,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1463 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse0) .cse1)) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1463) .cse0) .cse1))))) is different from false [2024-11-11 19:37:20,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:20,786 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 91 treesize of output 92 [2024-11-11 19:37:20,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:20,796 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 700 treesize of output 685 [2024-11-11 19:37:20,807 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 157 treesize of output 149 [2024-11-11 19:37:20,817 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 164 treesize of output 148 [2024-11-11 19:37:21,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse5)) (.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| 4) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse6 (+ .cse9 4)) (.cse7 (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse5))) (let ((.cse10 (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse31 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_45))))) .cse7)) (.cse11 (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse29 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_47)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_45)) (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_48))))))) (.cse22 (not .cse18)) (.cse12 (or (and (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)) v_arrayElimCell_45))) .cse7) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_45)) (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_48))))))) .cse18))) (and (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)))) (or (= (select .cse0 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 v_arrayElimCell_47)) (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 v_arrayElimCell_48)))))) (or (not .cse7) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse8 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)) v_arrayElimCell_48)))) (or (= .cse9 |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) (and .cse10 .cse11 .cse12)) (or .cse7 (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)))) (or (= (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 v_arrayElimCell_47)))))) (or (and (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse15 (select (store (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse16 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)))) (or (= (select .cse15 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse15 v_arrayElimCell_48)))))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= (select (select (store (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse17 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse7)) .cse18) (or (and (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse19 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse19 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)) v_arrayElimCell_47))) .cse7) (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse20 (select (store (let ((.cse21 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460))) (store .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 v_arrayElimCell_47)) (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse20 v_arrayElimCell_48))))))) .cse22) (or (= |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| .cse5) (and .cse10 .cse11 (or .cse22 (let ((.cse23 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse23 .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)) v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|)) .cse7) (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse24 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| v_ArrVal_1460) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse23 .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459)) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1461) (select (select (store (store .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1462) .cse5) .cse6)))) (or (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 v_arrayElimCell_48))) (= (select .cse24 v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|))))))) .cse12)))))) is different from false [2024-11-11 19:37:21,755 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse33 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base|)) (.cse34 (+ |c_ULTIMATE.start_dll_insert_~last~0#1.offset| 4))) (let ((.cse4 (select .cse33 .cse34)) (.cse17 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse23 (= |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| .cse6)) (.cse2 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 8)) (.cse3 (+ |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset| 4)) (.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~last~0#1.base| (store .cse33 .cse34 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (.cse7 (+ .cse17 4)) (.cse8 (= .cse4 .cse6))) (let ((.cse14 (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (let ((.cse31 (select (store (let ((.cse32 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse32 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 v_arrayElimCell_45)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse31 v_arrayElimCell_47))))) .cse8)) (.cse0 (not .cse23)) (.cse15 (or (and (or .cse8 (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse28 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)) v_arrayElimCell_45)))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (let ((.cse29 (select (store (let ((.cse30 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse30 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 v_arrayElimCell_45)) (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse29 v_arrayElimCell_48))))))) .cse23)) (.cse16 (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (let ((.cse26 (select (store (let ((.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse27 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_45)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_47)) (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_48)))))))) (and (or .cse0 (and (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)) v_arrayElimCell_47))) .cse8) (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 v_arrayElimCell_47)) (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 v_arrayElimCell_48)))))))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)) v_arrayElimCell_48))) (not .cse8)) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse12 (select (store (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse12 v_arrayElimCell_47))))) .cse8) (or (and .cse14 .cse15 .cse16) (= |c_ULTIMATE.start_dll_insert_~last~0#1.offset| .cse17)) (or (and .cse14 (or (let ((.cse19 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) (and (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse18 (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse19 .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459)) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)))) (or (= (select .cse18 v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|) (forall ((v_arrayElimCell_48 Int)) (= (select .cse18 v_arrayElimCell_48) |c_ULTIMATE.start_main_~uneq~0#1|))))) (or .cse8 (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store .cse19 .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459)) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)) v_arrayElimCell_47) |c_ULTIMATE.start_main_~uneq~0#1|))))) .cse0) .cse15 .cse16) (= |c_ULTIMATE.start_dll_insert_~last~0#1.base| .cse6)) (or (and (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse20 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse8) (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse21 (select (store (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse22 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse21 v_arrayElimCell_48))))))) .cse23) (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_insert_~last~0#1.base| v_ArrVal_1460))) (store .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| (store (store (select .cse25 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse4 v_ArrVal_1461) (select (select (store (store .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_1458) .cse4 v_ArrVal_1462) .cse6) .cse7)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 v_arrayElimCell_47)) (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 v_arrayElimCell_48))))))))))) is different from false [2024-11-11 19:37:26,022 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|))) (let ((.cse35 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse36 (+ .cse19 4))) (let ((.cse20 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select .cse35 .cse36)) (.cse7 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse5 .cse7)) (.cse2 (+ 8 |c_ULTIMATE.start_node_create_#res#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4)) (.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 (store .cse35 .cse36 |c_ULTIMATE.start_node_create_#res#1.base|))) (.cse8 (+ .cse20 4)) (.cse16 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse7))) (let ((.cse11 (not .cse16)) (.cse21 (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (let ((.cse33 (select (store (let ((.cse34 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse34 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse34 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_45)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse33 v_arrayElimCell_47)))))) (.cse22 (or (and (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (let ((.cse30 (select (store (let ((.cse31 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse31 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse31 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse30 v_arrayElimCell_45))))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse32 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse32 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse32 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)) v_arrayElimCell_45))) .cse0)) .cse16)) (.cse23 (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int) (v_arrayElimCell_45 Int)) (let ((.cse28 (select (store (let ((.cse29 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse29 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse29 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_45)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse28 v_arrayElimCell_47))))) .cse0))) (and (or (and (or .cse0 (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse1 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse1 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse1 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)) v_arrayElimCell_47)))) (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse9 (select (store (let ((.cse10 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse10 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse10 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse9 v_arrayElimCell_47)))))) .cse11) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_arrayElimCell_48 Int) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse12 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse12 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse12 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)) v_arrayElimCell_48))) (not .cse0)) (or (and (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse13 (select (store (let ((.cse14 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse14 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse14 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse13 |c_ULTIMATE.start_node_create_#res#1.offset|))))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (let ((.cse15 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse15 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse15 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)) |c_ULTIMATE.start_node_create_#res#1.offset|))) .cse0)) .cse16) (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse17 (select (store (let ((.cse18 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse18 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse18 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse17 v_arrayElimCell_47))))) (or (= .cse19 .cse20) (and .cse21 .cse22 .cse23)) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse24 (select (store (let ((.cse25 (store |c_#memory_int#1| .cse4 v_ArrVal_1460))) (store .cse25 |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select .cse25 |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459))) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 |c_ULTIMATE.start_node_create_#res#1.offset|)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse24 v_arrayElimCell_47))))) .cse0) (or (= .cse7 .cse4) (and (or .cse11 (let ((.cse27 (select |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base|))) (and (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (let ((.cse26 (select (store (store (store |c_#memory_int#1| .cse4 v_ArrVal_1460) |c_ULTIMATE.start_node_create_#res#1.base| (store (store .cse27 .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459)) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)))) (or (forall ((v_arrayElimCell_48 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_48))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse26 v_arrayElimCell_47))))) (or (forall ((v_ArrVal_1458 (Array Int Int)) (v_arrayElimCell_47 Int) (v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int)) (v_ArrVal_1459 Int) (v_DerPreprocessor_2 Int)) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int#1| .cse4 v_ArrVal_1460) |c_ULTIMATE.start_node_create_#res#1.base| (store (store .cse27 .cse2 v_DerPreprocessor_2) .cse3 v_ArrVal_1459)) .cse5 v_ArrVal_1461) (select (select (store (store .cse6 |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_1458) .cse5 v_ArrVal_1462) .cse7) .cse8)) v_arrayElimCell_47))) .cse0)))) .cse21 .cse22 .cse23)))))))) is different from false [2024-11-11 19:37:26,172 INFO L349 Elim1Store]: treesize reduction 139, result has 52.1 percent of original size [2024-11-11 19:37:26,173 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 2 case distinctions, treesize of input 2538 treesize of output 2524 [2024-11-11 19:37:26,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:26,192 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 1292 treesize of output 1292 [2024-11-11 19:37:26,210 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 1360 treesize of output 1350 [2024-11-11 19:37:26,226 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 1180 treesize of output 1172 [2024-11-11 19:37:26,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-11 19:37:26,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:26,491 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 448 treesize of output 452 [2024-11-11 19:37:26,706 INFO L349 Elim1Store]: treesize reduction 342, result has 40.1 percent of original size [2024-11-11 19:37:26,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5035 treesize of output 4935 [2024-11-11 19:37:26,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:26,730 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 2463 treesize of output 2395 [2024-11-11 19:37:26,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:26,752 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 2317 treesize of output 2313 [2024-11-11 19:37:26,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:26,777 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 2271 treesize of output 2263 [2024-11-11 19:37:27,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:27,324 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 495 treesize of output 499 [2024-11-11 19:37:28,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:28,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1328 treesize of output 1424 [2024-11-11 19:37:32,234 INFO L349 Elim1Store]: treesize reduction 278, result has 52.0 percent of original size [2024-11-11 19:37:32,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5075 treesize of output 5047 [2024-11-11 19:37:32,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:32,249 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 2575 treesize of output 2507 [2024-11-11 19:37:32,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:32,268 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 2579 treesize of output 2571 [2024-11-11 19:37:32,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:32,295 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 2359 treesize of output 2351 [2024-11-11 19:37:32,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:32,573 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 495 treesize of output 499 [2024-11-11 19:37:48,683 WARN L286 SmtUtils]: Spent 14.84s on a formula simplification that was a NOOP. DAG size: 1569 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-11 19:37:48,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:37:48,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 28 select indices, 28 select index equivalence classes, 0 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 378 case distinctions, treesize of input 3009 treesize of output 5953