./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/dll2n_prepend_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 a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:58:13,253 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:58:13,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:58:13,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:58:13,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:58:13,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:58:13,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:58:13,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:58:13,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:58:13,393 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:58:13,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:58:13,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:58:13,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:58:13,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:58:13,396 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:58:13,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:58:13,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:58:13,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:58:13,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:58:13,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:58:13,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:58:13,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:58:13,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:58:13,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:58:13,400 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:58:13,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:58:13,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:58:13,400 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:58:13,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:58:13,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:58:13,401 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:58:13,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:58:13,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:58:13,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:58:13,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:58:13,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:58:13,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:58:13,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:58:13,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:58:13,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:58:13,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:58:13,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:58:13,405 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 -> a0a808cbaf75e35690b91e29e30a5a3e0888859a17f932e1ee324e5b23ddf983 [2024-11-08 13:58:13,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:58:13,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:58:13,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:58:13,692 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:58:13,692 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:58:13,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2024-11-08 13:58:15,111 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:58:15,393 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:58:15,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_prepend_unequal.i [2024-11-08 13:58:15,412 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcccf170d/f4941e20bb544d389eae9905ff5098fa/FLAGed6d5fdce [2024-11-08 13:58:15,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcccf170d/f4941e20bb544d389eae9905ff5098fa [2024-11-08 13:58:15,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:58:15,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:58:15,434 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:58:15,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:58:15,440 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:58:15,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:15,442 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8b250d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15, skipping insertion in model container [2024-11-08 13:58:15,442 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:15,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:58:15,844 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_prepend_unequal.i[24450,24463] [2024-11-08 13:58:15,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:58:15,861 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:58:15,906 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_prepend_unequal.i[24450,24463] [2024-11-08 13:58:15,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:58:15,936 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:58:15,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15 WrapperNode [2024-11-08 13:58:15,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:58:15,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:58:15,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:58:15,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:58:15,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:15,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:15,982 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 125 [2024-11-08 13:58:15,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:58:15,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:58:15,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:58:15,984 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:58:15,994 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:15,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:15,999 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:16,022 INFO L175 MemorySlicer]: Split 23 memory accesses to 3 slices as follows [2, 14, 7]. 61 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 10 writes are split as follows [0, 9, 1]. [2024-11-08 13:58:16,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:16,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:16,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:16,046 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:16,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:16,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:16,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:58:16,057 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:58:16,057 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:58:16,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:58:16,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (1/1) ... [2024-11-08 13:58:16,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:58:16,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:16,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:58:16,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:58:16,161 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-08 13:58:16,161 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-08 13:58:16,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:58:16,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:58:16,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:58:16,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:58:16,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:58:16,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:58:16,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:58:16,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:58:16,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:58:16,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:58:16,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:58:16,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:58:16,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:58:16,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:58:16,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:58:16,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:58:16,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:58:16,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:58:16,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:58:16,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:58:16,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:58:16,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:58:16,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:58:16,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:58:16,323 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:58:16,326 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:58:16,352 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-08 13:58:16,527 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-11-08 13:58:16,529 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:58:16,550 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:58:16,550 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-08 13:58:16,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:58:16 BoogieIcfgContainer [2024-11-08 13:58:16,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:58:16,554 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:58:16,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:58:16,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:58:16,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:58:15" (1/3) ... [2024-11-08 13:58:16,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f874a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:58:16, skipping insertion in model container [2024-11-08 13:58:16,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:58:15" (2/3) ... [2024-11-08 13:58:16,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f874a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:58:16, skipping insertion in model container [2024-11-08 13:58:16,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:58:16" (3/3) ... [2024-11-08 13:58:16,561 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_unequal.i [2024-11-08 13:58:16,577 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:58:16,578 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:58:16,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:58:16,641 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;@24ce3881, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:58:16,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:58:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 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-08 13:58:16,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 13:58:16,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:16,657 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:16,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:16,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:16,664 INFO L85 PathProgramCache]: Analyzing trace with hash -670387442, now seen corresponding path program 1 times [2024-11-08 13:58:16,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:16,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511974614] [2024-11-08 13:58:16,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:16,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:16,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:16,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511974614] [2024-11-08 13:58:16,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511974614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:16,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:58:16,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303066217] [2024-11-08 13:58:16,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:16,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:58:16,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:16,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:58:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:58:16,941 INFO L87 Difference]: Start difference. First operand has 30 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 28 states have internal predecessors, (40), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:16,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:16,959 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2024-11-08 13:58:16,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:58:16,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 13:58:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:16,969 INFO L225 Difference]: With dead ends: 52 [2024-11-08 13:58:16,969 INFO L226 Difference]: Without dead ends: 21 [2024-11-08 13:58:16,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:58:16,977 INFO L432 NwaCegarLoop]: 38 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, 38 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-08 13:58:16,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:17,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-08 13:58:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-08 13:58:17,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 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-08 13:58:17,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-11-08 13:58:17,067 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 13 [2024-11-08 13:58:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:17,068 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-08 13:58:17,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2024-11-08 13:58:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 13:58:17,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:17,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:17,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:58:17,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:17,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:17,075 INFO L85 PathProgramCache]: Analyzing trace with hash -888049989, now seen corresponding path program 1 times [2024-11-08 13:58:17,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:17,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905578229] [2024-11-08 13:58:17,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:17,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:17,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:17,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905578229] [2024-11-08 13:58:17,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905578229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:17,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:17,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:58:17,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258266031] [2024-11-08 13:58:17,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:17,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:58:17,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:17,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:58:17,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:58:17,322 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:17,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:17,343 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-11-08 13:58:17,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:58:17,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 13:58:17,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:17,344 INFO L225 Difference]: With dead ends: 40 [2024-11-08 13:58:17,345 INFO L226 Difference]: Without dead ends: 26 [2024-11-08 13:58:17,345 INFO L431 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-08 13:58:17,347 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 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-08 13:58:17,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-08 13:58:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-11-08 13:58:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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-08 13:58:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-11-08 13:58:17,356 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2024-11-08 13:58:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:17,356 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-08 13:58:17,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-11-08 13:58:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 13:58:17,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:17,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:17,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:58:17,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:17,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:17,359 INFO L85 PathProgramCache]: Analyzing trace with hash -116753941, now seen corresponding path program 1 times [2024-11-08 13:58:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:17,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931000513] [2024-11-08 13:58:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:17,474 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-08 13:58:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931000513] [2024-11-08 13:58:17,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931000513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:17,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:17,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:58:17,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338462271] [2024-11-08 13:58:17,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:17,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:58:17,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:17,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:58:17,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:58:17,477 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 13:58:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:17,503 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2024-11-08 13:58:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:58:17,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 13:58:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:17,505 INFO L225 Difference]: With dead ends: 44 [2024-11-08 13:58:17,506 INFO L226 Difference]: Without dead ends: 25 [2024-11-08 13:58:17,506 INFO L431 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-08 13:58:17,508 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 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-08 13:58:17,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-08 13:58:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-08 13:58:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 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-08 13:58:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-08 13:58:17,515 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2024-11-08 13:58:17,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:17,515 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-08 13:58:17,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 13:58:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-08 13:58:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 13:58:17,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:17,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:17,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:58:17,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:17,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash -703559955, now seen corresponding path program 1 times [2024-11-08 13:58:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:17,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43658609] [2024-11-08 13:58:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:17,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:17,644 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-08 13:58:17,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:17,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43658609] [2024-11-08 13:58:17,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43658609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:17,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961130624] [2024-11-08 13:58:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:17,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:17,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:17,647 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:17,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:58:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:17,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 13:58:17,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:17,871 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-08 13:58:17,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:17,904 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-08 13:58:17,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961130624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:17,907 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:17,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-08 13:58:17,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265815148] [2024-11-08 13:58:17,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:17,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:58:17,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:17,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:58:17,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:58:17,909 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:17,931 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-11-08 13:58:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:58:17,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-08 13:58:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:17,932 INFO L225 Difference]: With dead ends: 41 [2024-11-08 13:58:17,933 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 13:58:17,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-08 13:58:17,934 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 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-08 13:58:17,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:58:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 13:58:17,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 13:58:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 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-08 13:58:17,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-08 13:58:17,938 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 18 [2024-11-08 13:58:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:17,938 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-08 13:58:17,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 13:58:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-08 13:58:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 13:58:17,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:17,939 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:17,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 13:58:18,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:18,140 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:18,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1057796345, now seen corresponding path program 1 times [2024-11-08 13:58:18,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:18,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074723771] [2024-11-08 13:58:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:18,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:19,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:19,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074723771] [2024-11-08 13:58:19,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074723771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:19,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:19,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 13:58:19,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333867340] [2024-11-08 13:58:19,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:19,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 13:58:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:19,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 13:58:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 13:58:19,202 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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-08 13:58:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:19,378 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-08 13:58:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 13:58:19,379 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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 23 [2024-11-08 13:58:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:19,381 INFO L225 Difference]: With dead ends: 29 [2024-11-08 13:58:19,381 INFO L226 Difference]: Without dead ends: 27 [2024-11-08 13:58:19,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-08 13:58:19,383 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:19,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:58:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-08 13:58:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-08 13:58:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-08 13:58:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-08 13:58:19,390 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2024-11-08 13:58:19,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:19,392 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-08 13:58:19,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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-08 13:58:19,392 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-08 13:58:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:58:19,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:19,394 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:19,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:58:19,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:19,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:19,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1364928246, now seen corresponding path program 1 times [2024-11-08 13:58:19,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:19,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769598779] [2024-11-08 13:58:19,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:19,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:20,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:20,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769598779] [2024-11-08 13:58:20,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769598779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:20,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:20,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 13:58:20,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015520089] [2024-11-08 13:58:20,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:20,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 13:58:20,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:20,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 13:58:20,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-08 13:58:20,320 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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-08 13:58:20,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:20,523 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2024-11-08 13:58:20,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 13:58:20,524 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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-08 13:58:20,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:20,525 INFO L225 Difference]: With dead ends: 47 [2024-11-08 13:58:20,526 INFO L226 Difference]: Without dead ends: 28 [2024-11-08 13:58:20,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 13:58:20,527 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:20,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 82 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 13:58:20,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-08 13:58:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-08 13:58:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 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-08 13:58:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-08 13:58:20,534 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2024-11-08 13:58:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:20,534 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-08 13:58:20,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 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-08 13:58:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-08 13:58:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:58:20,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:20,536 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:20,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:58:20,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:20,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:20,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1364926572, now seen corresponding path program 1 times [2024-11-08 13:58:20,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:20,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171032202] [2024-11-08 13:58:20,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:20,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:21,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:21,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171032202] [2024-11-08 13:58:21,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171032202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:21,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388800781] [2024-11-08 13:58:21,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:21,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:21,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:21,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:21,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 13:58:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:22,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-11-08 13:58:22,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:22,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:58:22,241 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:22,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:58:22,324 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-08 13:58:22,379 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 16 treesize of output 11 [2024-11-08 13:58:22,635 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-08 13:58:22,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-08 13:58:22,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 13:58:22,812 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 17 treesize of output 13 [2024-11-08 13:58:22,822 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 17 treesize of output 13 [2024-11-08 13:58:22,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 13:58:22,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:22,923 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 17 [2024-11-08 13:58:22,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:22,931 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 17 [2024-11-08 13:58:22,946 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:22,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:22,948 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 51 treesize of output 15 [2024-11-08 13:58:22,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-08 13:58:22,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 33 [2024-11-08 13:58:23,036 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 68 treesize of output 48 [2024-11-08 13:58:23,042 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 52 treesize of output 36 [2024-11-08 13:58:23,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-08 13:58:23,105 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 9 treesize of output 3 [2024-11-08 13:58:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:23,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:23,389 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_558 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.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| .cse0 (store (select |c_#memory_int#1| .cse0) (+ (select .cse1 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) v_ArrVal_558)) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_560) .cse2) .cse3)) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_561) .cse2) .cse3)))))) is different from false [2024-11-08 13:58:23,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:23,404 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 137 treesize of output 138 [2024-11-08 13:58:23,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:23,420 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 274 treesize of output 273 [2024-11-08 13:58:23,432 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 122 treesize of output 106 [2024-11-08 13:58:23,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:23,443 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 214 treesize of output 200 [2024-11-08 13:58:23,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:23,465 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 372 treesize of output 341 [2024-11-08 13:58:23,474 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 71 treesize of output 55 [2024-11-08 13:58:23,854 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse11 (select .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse24 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse13 (select .cse24 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse14 (+ .cse11 8))) (let ((.cse1 (forall ((v_ArrVal_558 Int) (v_arrayElimCell_20 Int) (v_ArrVal_555 (Array Int Int)) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_555))) (store .cse25 .cse13 (store (select .cse25 .cse13) .cse14 v_ArrVal_558))) v_arrayElimCell_20) v_arrayElimCell_23)))) (.cse15 (= .cse13 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse24 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (or .cse1 (not .cse15)))) (let ((.cse4 (forall ((|v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| Int)) (= |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse23 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |v_ULTIMATE.start_dll_prepend_~new_head~1#1.offset_11|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (.cse3 (and (or (forall ((v_arrayElimCell_18 Int) (v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_555) v_arrayElimCell_18) .cse11))) .cse15) .cse9 (forall ((v_arrayElimCell_18 Int) (v_ArrVal_558 Int) (v_ArrVal_555 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_555))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse22 v_arrayElimCell_18) .cse11)) (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse22 .cse13 (store (select .cse22 .cse13) .cse14 v_ArrVal_558)) v_arrayElimCell_20) v_arrayElimCell_23)))))))) (.cse0 (= .cse13 .cse21)) (.cse2 (= |c_ULTIMATE.start_node_create_#res#1.base| .cse21)) (.cse5 (forall ((v_arrayElimCell_21 Int) (v_ArrVal_558 Int) (v_ArrVal_555 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_555))) (let ((.cse19 (store (select .cse20 .cse13) .cse14 v_ArrVal_558))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse19 v_arrayElimCell_21)) (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse20 .cse13 .cse19) v_arrayElimCell_20) v_arrayElimCell_23)))))))) (.cse8 (forall ((v_arrayElimCell_21 Int) (v_ArrVal_558 Int) (v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_555) .cse13) .cse14 v_ArrVal_558) v_arrayElimCell_21)))) (.cse6 (or .cse15 (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_21 Int) (v_ArrVal_558 Int) (v_ArrVal_555 (Array Int Int))) (= (select (select (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_555))) (store .cse18 .cse13 (store (select .cse18 .cse13) .cse14 v_ArrVal_558))) v_arrayElimCell_18) v_arrayElimCell_21) |c_ULTIMATE.start_main_~data~0#1|)))) (.cse7 (forall ((v_arrayElimCell_18 Int) (v_arrayElimCell_21 Int) (v_ArrVal_558 Int) (v_ArrVal_555 (Array Int Int))) (let ((.cse16 (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_555))) (store .cse17 .cse13 (store (select .cse17 .cse13) .cse14 v_ArrVal_558))))) (or (= (select (select .cse16 v_arrayElimCell_18) v_arrayElimCell_21) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse16 v_arrayElimCell_20) v_arrayElimCell_23)))))))) (and (or (not .cse0) .cse1) (or .cse2 .cse3) (or .cse4 (and .cse5 .cse6 .cse7 (or .cse0 .cse8) .cse9)) (or .cse4 .cse3) (forall ((v_ArrVal_558 Int) (v_ArrVal_555 (Array Int Int))) (let ((.cse12 (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_555))) (let ((.cse10 (select .cse12 .cse13))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse10 .cse11)) (forall ((v_arrayElimCell_20 Int) (v_arrayElimCell_23 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse12 .cse13 (store .cse10 .cse14 v_ArrVal_558)) v_arrayElimCell_20) v_arrayElimCell_23))))))) (or .cse0 (forall ((v_ArrVal_555 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_555) .cse13) .cse11)))) (or .cse2 (and .cse5 (or .cse15 .cse8) .cse6 .cse7 .cse9))))))))) is different from false [2024-11-08 13:58:25,183 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 134 treesize of output 98 [2024-11-08 13:58:25,188 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 102 treesize of output 82 [2024-11-08 13:58:25,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:25,215 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-08 13:58:29,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:29,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4857 treesize of output 4811 [2024-11-08 13:58:29,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:29,953 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 767 treesize of output 758 [2024-11-08 13:58:30,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:30,002 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 845 treesize of output 818 [2024-11-08 13:58:30,024 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 809 treesize of output 807 [2024-11-08 13:58:30,049 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 807 treesize of output 803 [2024-11-08 13:58:30,072 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 803 treesize of output 801 [2024-11-08 13:58:34,607 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-08 13:58:37,659 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 4206 treesize of output 4138 [2024-11-08 13:58:37,745 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 1460 treesize of output 1436 [2024-11-08 13:58:37,794 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 966 treesize of output 950 [2024-11-08 13:58:37,822 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 962 treesize of output 946 [2024-11-08 13:58:37,857 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 68 treesize of output 64 [2024-11-08 13:58:37,921 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 2362 treesize of output 2324 [2024-11-08 13:58:38,178 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 3436 treesize of output 3380 [2024-11-08 13:58:38,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 13:58:38,395 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:38,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 267 treesize of output 259 [2024-11-08 13:58:38,425 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:38,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 268 treesize of output 260 [2024-11-08 13:58:38,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:38,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 748 treesize of output 726 [2024-11-08 13:58:38,542 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 1878 treesize of output 1848 [2024-11-08 13:58:38,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4234 treesize of output 4168 [2024-11-08 13:58:39,067 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 58 treesize of output 54 [2024-11-08 13:58:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388800781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:42,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:42,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 47 [2024-11-08 13:58:42,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542322438] [2024-11-08 13:58:42,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:42,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 13:58:42,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:42,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 13:58:42,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1818, Unknown=25, NotChecked=174, Total=2162 [2024-11-08 13:58:42,413 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 47 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 47 states have internal predecessors, (69), 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-08 13:58:45,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:45,266 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-11-08 13:58:45,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 13:58:45,267 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 47 states have internal predecessors, (69), 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-08 13:58:45,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:45,267 INFO L225 Difference]: With dead ends: 36 [2024-11-08 13:58:45,267 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 13:58:45,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=320, Invalid=3321, Unknown=27, NotChecked=238, Total=3906 [2024-11-08 13:58:45,269 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 37 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:45,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 169 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 583 Invalid, 3 Unknown, 66 Unchecked, 1.5s Time] [2024-11-08 13:58:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 13:58:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2024-11-08 13:58:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 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-08 13:58:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-08 13:58:45,275 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2024-11-08 13:58:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:45,276 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-08 13:58:45,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 47 states have internal predecessors, (69), 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-08 13:58:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-08 13:58:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:58:45,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:45,277 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:45,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:58:45,477 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-08 13:58:45,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:45,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:45,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1729377051, now seen corresponding path program 1 times [2024-11-08 13:58:45,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:45,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102022279] [2024-11-08 13:58:45,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:45,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:46,636 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-08 13:58:46,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:46,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102022279] [2024-11-08 13:58:46,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102022279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:46,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994377672] [2024-11-08 13:58:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:46,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:46,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:46,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:46,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 13:58:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:46,787 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-08 13:58:46,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:46,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:58:46,863 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:46,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:58:46,912 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 14 treesize of output 15 [2024-11-08 13:58:46,956 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:58:46,956 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 49 treesize of output 44 [2024-11-08 13:58:47,098 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:58:47,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 13:58:47,195 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 60 treesize of output 37 [2024-11-08 13:58:47,258 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 17 treesize of output 13 [2024-11-08 13:58:47,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2024-11-08 13:58:47,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:47,358 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 17 [2024-11-08 13:58:47,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:47,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:47,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:47,368 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:47,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 64 [2024-11-08 13:58:47,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 82 [2024-11-08 13:58:47,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-08 13:58:47,583 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 42 treesize of output 30 [2024-11-08 13:58:47,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 13:58:47,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 13 treesize of output 3 [2024-11-08 13:58:47,753 INFO L349 Elim1Store]: treesize reduction 42, result has 6.7 percent of original size [2024-11-08 13:58:47,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 32 [2024-11-08 13:58:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:47,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:47,913 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_729 (Array Int Int))) (not (= (let ((.cse4 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_dll_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse3 (store (select |c_#memory_$Pointer$#1.base| .cse3) (+ (select .cse4 |c_ULTIMATE.start_dll_prepend_~head#1.offset|) 8) |c_ULTIMATE.start_dll_prepend_~new_head~1#1.base|)))) (select .cse0 (select (select .cse0 .cse1) .cse2))) (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_729) .cse1) .cse2))))) 0))) is different from false [2024-11-08 13:58:47,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:47,921 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 191 treesize of output 192 [2024-11-08 13:58:47,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:47,936 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 383 treesize of output 382 [2024-11-08 13:58:47,941 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 338 treesize of output 322 [2024-11-08 13:58:48,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:48,811 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2024-11-08 13:58:48,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:48,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2024-11-08 13:58:48,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:48,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 113 [2024-11-08 13:58:48,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:48,876 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2024-11-08 13:58:48,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:48,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2024-11-08 13:58:48,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:48,921 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 109 [2024-11-08 13:58:49,696 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 144 treesize of output 128 [2024-11-08 13:58:49,700 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 132 treesize of output 96 [2024-11-08 13:58:49,752 INFO L349 Elim1Store]: treesize reduction 35, result has 53.3 percent of original size [2024-11-08 13:58:49,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 93 [2024-11-08 13:58:49,770 INFO L349 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2024-11-08 13:58:49,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 70 [2024-11-08 13:58:50,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:50,545 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 35 treesize of output 41 [2024-11-08 13:58:50,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:50,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:58:50,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 43 [2024-11-08 13:58:50,557 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 39 treesize of output 27 [2024-11-08 13:58:50,560 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 8 treesize of output 4 [2024-11-08 13:58:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994377672] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:58:51,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:58:51,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 45 [2024-11-08 13:58:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899626559] [2024-11-08 13:58:51,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:51,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-08 13:58:51,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:51,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-08 13:58:51,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1747, Unknown=6, NotChecked=84, Total=1980 [2024-11-08 13:58:51,972 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 45 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 45 states have internal predecessors, (69), 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-08 13:58:56,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:56,399 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2024-11-08 13:58:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 13:58:56,402 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 45 states have internal predecessors, (69), 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-08 13:58:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:56,403 INFO L225 Difference]: With dead ends: 47 [2024-11-08 13:58:56,403 INFO L226 Difference]: Without dead ends: 44 [2024-11-08 13:58:56,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=354, Invalid=4066, Unknown=6, NotChecked=130, Total=4556 [2024-11-08 13:58:56,404 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 46 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:56,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 151 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 630 Invalid, 0 Unknown, 46 Unchecked, 2.5s Time] [2024-11-08 13:58:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-08 13:58:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2024-11-08 13:58:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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-08 13:58:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-08 13:58:56,409 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 27 [2024-11-08 13:58:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:56,410 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-08 13:58:56,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 45 states have internal predecessors, (69), 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-08 13:58:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-08 13:58:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:58:56,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:56,411 INFO L215 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-08 13:58:56,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 13:58:56,614 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-08 13:58:56,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:56,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:56,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1729375377, now seen corresponding path program 1 times [2024-11-08 13:58:56,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:56,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767287794] [2024-11-08 13:58:56,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:58,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767287794] [2024-11-08 13:58:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767287794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552665196] [2024-11-08 13:58:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:58,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:58,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:58,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:58,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 13:58:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:58,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-08 13:58:58,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:58,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:58:58,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-08 13:58:58,777 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:58,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-08 13:58:58,830 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-08 13:58:58,840 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 16 treesize of output 11 [2024-11-08 13:58:58,844 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-08 13:58:58,899 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:58:58,899 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 88 treesize of output 75 [2024-11-08 13:58:58,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-08 13:58:58,906 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 39 treesize of output 15 [2024-11-08 13:58:59,061 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:58:59,062 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-08 13:58:59,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 13:58:59,161 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-08 13:58:59,169 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-08 13:58:59,246 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 27 treesize of output 26 [2024-11-08 13:58:59,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 42 [2024-11-08 13:58:59,261 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-08 13:58:59,338 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:59,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:59,342 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 13:58:59,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 62 [2024-11-08 13:58:59,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:59,354 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 32 treesize of output 19 [2024-11-08 13:58:59,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:59,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:58:59,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:59,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-11-08 13:58:59,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 13:58:59,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 79 [2024-11-08 13:58:59,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 13:58:59,725 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2024-11-08 13:58:59,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 84 treesize of output 49 [2024-11-08 13:58:59,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 13:58:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:59,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:59:00,144 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_910 (Array Int Int)) (v_ArrVal_914 (Array Int Int))) (= (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse13 (select .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse8 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse10 (+ .cse13 8)) (.cse11 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse4 (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse11 .cse13)))) (store .cse12 .cse0 (store (select .cse12 .cse0) .cse10 |c_ULTIMATE.start_node_create_#res#1.offset|)))) (.cse1 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse11 .cse0)))) (store .cse9 .cse0 (store (select .cse9 .cse0) .cse10 |c_ULTIMATE.start_node_create_#res#1.base|)))) (.cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (let ((.cse2 (select (select .cse1 .cse5) .cse6)) (.cse3 (+ 4 (select (select .cse4 .cse5) .cse6)))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_910) .cse0 v_ArrVal_914) (select (select .cse1 .cse2) .cse3)) (select (select .cse4 .cse2) .cse3))))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2024-11-08 13:59:00,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:00,163 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 425 treesize of output 384 [2024-11-08 13:59:00,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:00,176 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 371 treesize of output 330 [2024-11-08 13:59:00,220 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_910 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_914 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base|)) (.cse9 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base|))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse2 (select .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.offset|)) (.cse1 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (or (not (= .cse0 (select v_arrayElimArr_14 .cse1))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse12 (+ .cse0 8))) (let ((.cse6 (let ((.cse13 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse13 .cse2 (store (select .cse13 .cse2) .cse12 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)))) (.cse3 (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13))) (store .cse11 .cse2 (store (select .cse11 .cse2) .cse12 |c_ULTIMATE.start_node_create_~temp~0#1.base|)))) (.cse7 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_dll_prepend_~head#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (let ((.cse4 (select (select .cse3 .cse7) .cse8)) (.cse5 (+ (select (select .cse6 .cse7) .cse8) 4))) (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_910) .cse2 v_ArrVal_914) (select (select .cse3 .cse4) .cse5)) (select (select .cse6 .cse4) .cse5)))))) (not (= .cse2 (select v_arrayElimArr_13 .cse1))))))) is different from false [2024-11-08 13:59:00,271 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 232 treesize of output 172 [2024-11-08 13:59:00,275 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 206 treesize of output 174 [2024-11-08 13:59:05,065 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_900 (Array Int Int)) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_910 (Array Int Int)) (v_ArrVal_901 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_914 (Array Int Int)) (|v_ULTIMATE.start_node_create_~temp~0#1.base_17| Int)) (let ((.cse1 (select v_arrayElimArr_13 4)) (.cse9 (select v_arrayElimArr_14 4))) (or (not (= v_ArrVal_899 (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (store (select |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse0 (select v_ArrVal_899 .cse0))))) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse7 (+ .cse9 8))) (let ((.cse5 (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_900) |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_arrayElimArr_14))) (store .cse8 .cse1 (store (select .cse8 .cse1) .cse7 0)))) (.cse2 (let ((.cse6 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_901) |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_arrayElimArr_13))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse7 |v_ULTIMATE.start_node_create_~temp~0#1.base_17|))))) (let ((.cse3 (select (select .cse2 |v_ULTIMATE.start_node_create_~temp~0#1.base_17|) 4)) (.cse4 (+ 4 (select (select .cse5 |v_ULTIMATE.start_node_create_~temp~0#1.base_17|) 4)))) (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_899) |v_ULTIMATE.start_node_create_~temp~0#1.base_17| v_ArrVal_910) .cse1 v_ArrVal_914) (select (select .cse2 .cse3) .cse4)) (select (select .cse5 .cse3) .cse4)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_17|))) (not (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) is different from false [2024-11-08 13:59:05,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:05,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 397 treesize of output 328 [2024-11-08 13:59:05,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:05,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 307 treesize of output 238 [2024-11-08 13:59:05,337 INFO L349 Elim1Store]: treesize reduction 36, result has 67.0 percent of original size [2024-11-08 13:59:05,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 11572 treesize of output 11107 [2024-11-08 13:59:05,401 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:05,402 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 7669 treesize of output 6155 [2024-11-08 13:59:05,474 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 4201 treesize of output 4157 [2024-11-08 13:59:05,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:05,541 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 307 treesize of output 307 [2024-11-08 13:59:05,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:59:05,584 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 837 treesize of output 723 [2024-11-08 13:59:05,623 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 132 treesize of output 124 [2024-11-08 13:59:05,650 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 118 treesize of output 114 [2024-11-08 13:59:05,799 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 128 treesize of output 120 [2024-11-08 13:59:06,603 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 13 treesize of output 1 [2024-11-08 13:59:06,619 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 13 treesize of output 1 [2024-11-08 13:59:06,638 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 13 treesize of output 1 [2024-11-08 13:59:06,648 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 13 treesize of output 1 [2024-11-08 13:59:07,005 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 13 treesize of output 1 [2024-11-08 13:59:07,033 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 13 treesize of output 1 [2024-11-08 13:59:07,053 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 13 treesize of output 1 [2024-11-08 13:59:07,074 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 13 treesize of output 1 [2024-11-08 13:59:07,943 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-08 13:59:08,094 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-08 13:59:08,263 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-08 13:59:09,450 WARN L214 Elim1Store]: Array PQE input equivalent to true