./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.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 b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:14:51,208 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:14:51,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-30 10:14:51,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:14:51,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:14:51,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:14:51,283 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:14:51,283 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:14:51,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:14:51,284 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:14:51,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:14:51,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:14:51,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:14:51,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:14:51,285 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:14:51,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:14:51,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:14:51,285 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:14:51,285 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:14:51,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:14:51,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:14:51,286 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:14:51,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:14:51,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:14:51,286 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:14:51,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:14:51,286 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:14:51,286 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:14:51,286 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:14:51,286 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:14:51,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:14:51,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:14:51,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:14:51,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:14:51,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:14:51,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:14:51,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:14:51,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:14:51,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:14:51,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:14:51,287 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:14:51,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:14:51,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:14:51,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:14:51,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:14:51,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:14:51,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:14:51,288 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> b3d7899c651fa61cfb9cf623e0f4ceb470fe32eb0d0272d2277c965ed07c2f88 [2025-04-30 10:14:51,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:14:51,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:14:51,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:14:51,532 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:14:51,532 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:14:51,533 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.i [2025-04-30 10:14:52,918 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3663de5e0/45ea01a7b4b84ddda33b74d635c7e5cd/FLAG6cdb7b9a4 [2025-04-30 10:14:53,181 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:14:53,181 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.i [2025-04-30 10:14:53,191 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3663de5e0/45ea01a7b4b84ddda33b74d635c7e5cd/FLAG6cdb7b9a4 [2025-04-30 10:14:53,918 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3663de5e0/45ea01a7b4b84ddda33b74d635c7e5cd [2025-04-30 10:14:53,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:14:53,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:14:53,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:14:53,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:14:53,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:14:53,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:14:53" (1/1) ... [2025-04-30 10:14:53,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e2107a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:53, skipping insertion in model container [2025-04-30 10:14:53,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:14:53" (1/1) ... [2025-04-30 10:14:53,955 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:14:54,200 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.i[24038,24051] [2025-04-30 10:14:54,203 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:14:54,212 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:14:54,278 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all_reverse.i[24038,24051] [2025-04-30 10:14:54,278 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:14:54,300 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:14:54,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54 WrapperNode [2025-04-30 10:14:54,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:14:54,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:14:54,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:14:54,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:14:54,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,318 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,341 INFO L138 Inliner]: procedures = 126, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 96 [2025-04-30 10:14:54,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:14:54,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:14:54,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:14:54,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:14:54,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,368 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 7, 6]. 47 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2025-04-30 10:14:54,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:14:54,393 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:14:54,393 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:14:54,393 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:14:54,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (1/1) ... [2025-04-30 10:14:54,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:14:54,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:54,426 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) [2025-04-30 10:14:54,428 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 [2025-04-30 10:14:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:14:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-30 10:14:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:14:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-30 10:14:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-30 10:14:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-30 10:14:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:14:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-30 10:14:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-30 10:14:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:14:54,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:14:54,543 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:14:54,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:14:54,675 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-04-30 10:14:54,675 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:14:54,682 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:14:54,682 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:14:54,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:14:54 BoogieIcfgContainer [2025-04-30 10:14:54,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:14:54,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:14:54,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:14:54,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:14:54,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:14:53" (1/3) ... [2025-04-30 10:14:54,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7528074c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:14:54, skipping insertion in model container [2025-04-30 10:14:54,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:14:54" (2/3) ... [2025-04-30 10:14:54,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7528074c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:14:54, skipping insertion in model container [2025-04-30 10:14:54,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:14:54" (3/3) ... [2025-04-30 10:14:54,691 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_reverse.i [2025-04-30 10:14:54,705 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:14:54,706 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_remove_all_reverse.i that has 1 procedures, 21 locations, 27 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-30 10:14:54,741 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:14:54,750 INFO L340 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;@32ea621b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:14:54,750 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-30 10:14:54,753 INFO L278 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 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) [2025-04-30 10:14:54,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:14:54,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:54,758 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:54,758 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:54,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:54,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1817335599, now seen corresponding path program 1 times [2025-04-30 10:14:54,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:54,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758046530] [2025-04-30 10:14:54,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:54,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:54,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:14:54,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:14:54,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:54,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:14:54,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:54,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758046530] [2025-04-30 10:14:54,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758046530] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:14:54,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:14:54,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:14:54,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455625867] [2025-04-30 10:14:54,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:14:54,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:14:54,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:54,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:14:54,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:14:54,984 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2025-04-30 10:14:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:55,027 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2025-04-30 10:14:55,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:14:55,030 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-04-30 10:14:55,030 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:55,035 INFO L225 Difference]: With dead ends: 40 [2025-04-30 10:14:55,036 INFO L226 Difference]: Without dead ends: 21 [2025-04-30 10:14:55,040 INFO L436 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 [2025-04-30 10:14:55,044 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 43 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 [2025-04-30 10:14:55,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 43 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:14:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-04-30 10:14:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2025-04-30 10:14:55,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:14:55,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-04-30 10:14:55,089 INFO L79 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 7 [2025-04-30 10:14:55,089 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:55,090 INFO L485 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-04-30 10:14:55,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2025-04-30 10:14:55,090 INFO L278 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-04-30 10:14:55,090 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:14:55,090 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:55,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:55,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:14:55,091 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:55,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:55,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1230601383, now seen corresponding path program 1 times [2025-04-30 10:14:55,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:55,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058000067] [2025-04-30 10:14:55,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:55,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:55,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:14:55,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:14:55,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:55,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:55,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:14:55,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:55,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058000067] [2025-04-30 10:14:55,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058000067] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:55,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102313145] [2025-04-30 10:14:55,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:55,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:55,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:55,251 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) [2025-04-30 10:14:55,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:14:55,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:14:55,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:14:55,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:55,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:55,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:14:55,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:14:55,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:14:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:14:55,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102313145] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:14:55,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:14:55,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-30 10:14:55,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754693601] [2025-04-30 10:14:55,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:14:55,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:14:55,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:55,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:14:55,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:14:55,408 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-04-30 10:14:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:55,429 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-04-30 10:14:55,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:14:55,430 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 11 [2025-04-30 10:14:55,430 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:55,430 INFO L225 Difference]: With dead ends: 33 [2025-04-30 10:14:55,430 INFO L226 Difference]: Without dead ends: 22 [2025-04-30 10:14:55,431 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:14:55,431 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:55,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 61 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:14:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-04-30 10:14:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-04-30 10:14:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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) [2025-04-30 10:14:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2025-04-30 10:14:55,436 INFO L79 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 11 [2025-04-30 10:14:55,436 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:55,437 INFO L485 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2025-04-30 10:14:55,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2025-04-30 10:14:55,437 INFO L278 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2025-04-30 10:14:55,437 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:14:55,438 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:55,438 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:55,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:14:55,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:55,639 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:55,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1524704799, now seen corresponding path program 2 times [2025-04-30 10:14:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:55,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277644589] [2025-04-30 10:14:55,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:14:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:55,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-30 10:14:55,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 15 statements. [2025-04-30 10:14:55,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:14:55,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:14:55,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:55,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277644589] [2025-04-30 10:14:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277644589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:14:55,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:14:55,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:14:55,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103235083] [2025-04-30 10:14:55,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:14:55,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:14:55,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:55,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:14:55,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:14:55,707 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-04-30 10:14:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:55,723 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-04-30 10:14:55,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:14:55,723 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-30 10:14:55,723 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:55,724 INFO L225 Difference]: With dead ends: 32 [2025-04-30 10:14:55,724 INFO L226 Difference]: Without dead ends: 29 [2025-04-30 10:14:55,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:14:55,725 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:55,725 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 43 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:14:55,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-30 10:14:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-04-30 10:14:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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) [2025-04-30 10:14:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-04-30 10:14:55,729 INFO L79 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2025-04-30 10:14:55,729 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:55,729 INFO L485 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-04-30 10:14:55,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2025-04-30 10:14:55,729 INFO L278 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-04-30 10:14:55,729 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-30 10:14:55,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:55,730 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:55,730 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:14:55,730 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:55,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1802939970, now seen corresponding path program 1 times [2025-04-30 10:14:55,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:55,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897782820] [2025-04-30 10:14:55,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:55,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:55,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:14:55,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:14:55,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:55,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:14:55,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:55,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897782820] [2025-04-30 10:14:55,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897782820] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:55,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519347447] [2025-04-30 10:14:55,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:55,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:55,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:55,933 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) [2025-04-30 10:14:55,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:14:55,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:14:56,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:14:56,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:56,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:56,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:14:56,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:56,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:14:56,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:14:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-30 10:14:56,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519347447] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:14:56,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:14:56,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-04-30 10:14:56,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554408082] [2025-04-30 10:14:56,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:14:56,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:14:56,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:56,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:14:56,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:14:56,089 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2025-04-30 10:14:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:56,145 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2025-04-30 10:14:56,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:14:56,146 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 [2025-04-30 10:14:56,147 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:56,147 INFO L225 Difference]: With dead ends: 33 [2025-04-30 10:14:56,147 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:14:56,147 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:14:56,147 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:56,148 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 58 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:14:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:14:56,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-04-30 10:14:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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) [2025-04-30 10:14:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-04-30 10:14:56,150 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2025-04-30 10:14:56,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:56,151 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-04-30 10:14:56,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2025-04-30 10:14:56,151 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-04-30 10:14:56,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-30 10:14:56,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:56,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:56,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:14:56,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-30 10:14:56,352 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:56,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash 766873023, now seen corresponding path program 2 times [2025-04-30 10:14:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:56,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576806896] [2025-04-30 10:14:56,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:14:56,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:56,365 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-30 10:14:56,372 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-30 10:14:56,372 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:14:56,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:14:56,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:56,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576806896] [2025-04-30 10:14:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576806896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:14:56,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:14:56,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:14:56,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776020992] [2025-04-30 10:14:56,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:14:56,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:14:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:56,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:14:56,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:14:56,583 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2025-04-30 10:14:56,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:56,630 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2025-04-30 10:14:56,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:14:56,630 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 21 [2025-04-30 10:14:56,631 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:56,631 INFO L225 Difference]: With dead ends: 42 [2025-04-30 10:14:56,633 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:14:56,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:14:56,633 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:56,634 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 74 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:14:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:14:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-04-30 10:14:56,639 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) [2025-04-30 10:14:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-04-30 10:14:56,639 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 21 [2025-04-30 10:14:56,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:56,639 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-04-30 10:14:56,639 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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) [2025-04-30 10:14:56,639 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-04-30 10:14:56,640 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-30 10:14:56,640 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:56,640 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:56,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:14:56,640 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:56,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:56,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1915069895, now seen corresponding path program 1 times [2025-04-30 10:14:56,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:56,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652639560] [2025-04-30 10:14:56,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:56,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:56,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:14:56,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:14:56,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:56,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:14:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:57,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652639560] [2025-04-30 10:14:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652639560] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:57,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093821528] [2025-04-30 10:14:57,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:57,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:57,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:57,234 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) [2025-04-30 10:14:57,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:14:57,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-30 10:14:57,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-30 10:14:57,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:57,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:57,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-30 10:14:57,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:57,443 INFO L354 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 45 treesize of output 33 [2025-04-30 10:14:57,446 INFO L354 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 37 treesize of output 25 [2025-04-30 10:14:57,483 INFO L354 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 31 treesize of output 19 [2025-04-30 10:14:57,488 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-04-30 10:14:57,506 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-30 10:14:57,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:14:57,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093821528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:14:57,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:14:57,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2025-04-30 10:14:57,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911574091] [2025-04-30 10:14:57,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:14:57,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:14:57,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:57,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:14:57,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-04-30 10:14:57,508 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:14:57,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:57,547 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-04-30 10:14:57,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:14:57,547 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-30 10:14:57,547 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:57,547 INFO L225 Difference]: With dead ends: 49 [2025-04-30 10:14:57,548 INFO L226 Difference]: Without dead ends: 36 [2025-04-30 10:14:57,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2025-04-30 10:14:57,548 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:57,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:14:57,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-30 10:14:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-04-30 10:14:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:14:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-04-30 10:14:57,552 INFO L79 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 27 [2025-04-30 10:14:57,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:57,552 INFO L485 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-04-30 10:14:57,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:14:57,552 INFO L278 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-04-30 10:14:57,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-30 10:14:57,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:57,553 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:57,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-30 10:14:57,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:57,754 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:57,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:57,754 INFO L85 PathProgramCache]: Analyzing trace with hash -925449857, now seen corresponding path program 1 times [2025-04-30 10:14:57,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:57,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098745919] [2025-04-30 10:14:57,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:57,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:57,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:14:57,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:14:57,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:57,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:14:58,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:14:58,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098745919] [2025-04-30 10:14:58,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098745919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:14:58,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351973169] [2025-04-30 10:14:58,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:14:58,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:58,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:14:58,291 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) [2025-04-30 10:14:58,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:14:58,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:14:58,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:14:58,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:14:58,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:14:58,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-30 10:14:58,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:14:58,532 INFO L354 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 18 treesize of output 7 [2025-04-30 10:14:58,560 INFO L354 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 [2025-04-30 10:14:58,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:14:58,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-30 10:14:58,790 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:14:58,790 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-30 10:14:58,791 INFO L354 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2025-04-30 10:14:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-30 10:14:58,827 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:14:58,887 INFO L354 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 51 treesize of output 37 [2025-04-30 10:14:58,969 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-30 10:14:58,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351973169] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:14:58,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:14:58,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 7] total 30 [2025-04-30 10:14:58,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984039120] [2025-04-30 10:14:58,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:14:58,971 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-30 10:14:58,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:14:58,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-30 10:14:58,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:14:58,974 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 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) [2025-04-30 10:14:59,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:14:59,184 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-04-30 10:14:59,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:14:59,184 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 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 33 [2025-04-30 10:14:59,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:14:59,185 INFO L225 Difference]: With dead ends: 61 [2025-04-30 10:14:59,185 INFO L226 Difference]: Without dead ends: 45 [2025-04-30 10:14:59,185 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2025-04-30 10:14:59,186 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:14:59,186 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 161 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:14:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-04-30 10:14:59,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2025-04-30 10:14:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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) [2025-04-30 10:14:59,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2025-04-30 10:14:59,190 INFO L79 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 33 [2025-04-30 10:14:59,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:14:59,190 INFO L485 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2025-04-30 10:14:59,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 30 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) [2025-04-30 10:14:59,190 INFO L278 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2025-04-30 10:14:59,191 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:14:59,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:14:59,191 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:14:59,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:14:59,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:14:59,395 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:14:59,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:14:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1904913426, now seen corresponding path program 2 times [2025-04-30 10:14:59,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:14:59,396 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322207913] [2025-04-30 10:14:59,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:14:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:14:59,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:14:59,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:14:59,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:14:59,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:15:00,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:15:00,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322207913] [2025-04-30 10:15:00,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322207913] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:15:00,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489179140] [2025-04-30 10:15:00,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:15:00,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:15:00,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:15:00,338 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:15:00,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:15:00,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:15:00,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:15:00,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:15:00,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:00,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-04-30 10:15:00,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:15:00,603 INFO L354 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 [2025-04-30 10:15:00,659 INFO L354 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 18 treesize of output 7 [2025-04-30 10:15:00,663 INFO L354 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 18 treesize of output 7 [2025-04-30 10:15:00,700 INFO L354 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 [2025-04-30 10:15:00,706 INFO L354 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 [2025-04-30 10:15:00,744 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-30 10:15:00,744 INFO L354 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 11 treesize of output 11 [2025-04-30 10:15:00,796 INFO L354 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 [2025-04-30 10:15:00,809 INFO L354 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 26 treesize of output 18 [2025-04-30 10:15:00,849 INFO L354 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 0 case distinctions, treesize of input 30 treesize of output 25 [2025-04-30 10:15:00,860 INFO L354 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 15 [2025-04-30 10:15:01,013 INFO L354 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 65 treesize of output 41 [2025-04-30 10:15:01,022 INFO L354 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 7 treesize of output 3 [2025-04-30 10:15:01,159 INFO L325 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2025-04-30 10:15:01,159 INFO L354 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 27 [2025-04-30 10:15:01,176 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-30 10:15:01,180 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:15:01,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:15:01,334 INFO L354 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 84 treesize of output 64 [2025-04-30 10:15:01,337 INFO L354 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 [2025-04-30 10:15:01,451 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:15:01,452 INFO L354 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 17 treesize of output 21 [2025-04-30 10:15:01,748 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:15:01,749 INFO L354 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 25 treesize of output 31 [2025-04-30 10:15:01,756 INFO L354 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 36 treesize of output 24 [2025-04-30 10:15:01,763 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-30 10:15:01,763 INFO L354 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 18 treesize of output 20 [2025-04-30 10:15:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-30 10:15:01,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489179140] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:15:01,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:15:01,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2025-04-30 10:15:01,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729939661] [2025-04-30 10:15:01,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:15:01,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-30 10:15:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:15:01,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-30 10:15:01,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1356, Unknown=9, NotChecked=0, Total=1482 [2025-04-30 10:15:01,944 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 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) [2025-04-30 10:15:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:15:02,486 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-04-30 10:15:02,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:15:02,487 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 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 36 [2025-04-30 10:15:02,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:15:02,487 INFO L225 Difference]: With dead ends: 81 [2025-04-30 10:15:02,487 INFO L226 Difference]: Without dead ends: 49 [2025-04-30 10:15:02,488 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=1803, Unknown=9, NotChecked=0, Total=1980 [2025-04-30 10:15:02,488 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:15:02,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 200 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:15:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-04-30 10:15:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-04-30 10:15:02,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 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) [2025-04-30 10:15:02,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-04-30 10:15:02,496 INFO L79 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 36 [2025-04-30 10:15:02,497 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:15:02,497 INFO L485 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-04-30 10:15:02,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 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) [2025-04-30 10:15:02,498 INFO L278 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-04-30 10:15:02,498 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-30 10:15:02,498 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:15:02,498 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:15:02,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:15:02,698 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:15:02,699 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-30 10:15:02,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:15:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash -930299530, now seen corresponding path program 3 times [2025-04-30 10:15:02,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:15:02,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141494007] [2025-04-30 10:15:02,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:15:02,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:15:02,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 5 equivalence classes. [2025-04-30 10:15:02,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 40 statements. [2025-04-30 10:15:02,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:15:02,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-04-30 10:15:02,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:15:02,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141494007] [2025-04-30 10:15:02,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141494007] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:15:02,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890028735] [2025-04-30 10:15:02,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:15:02,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:15:02,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:15:02,782 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:15:02,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:15:02,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 5 equivalence classes. [2025-04-30 10:15:03,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 37 of 40 statements. [2025-04-30 10:15:03,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-30 10:15:03,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:15:03,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:15:03,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:15:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-04-30 10:15:03,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:15:03,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890028735] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:15:03,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:15:03,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-04-30 10:15:03,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181159108] [2025-04-30 10:15:03,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:15:03,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:15:03,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:15:03,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:15:03,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:15:03,086 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2025-04-30 10:15:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:15:03,099 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2025-04-30 10:15:03,102 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:15:03,102 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-04-30 10:15:03,103 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:15:03,103 INFO L225 Difference]: With dead ends: 47 [2025-04-30 10:15:03,103 INFO L226 Difference]: Without dead ends: 0 [2025-04-30 10:15:03,103 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:15:03,103 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 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 [2025-04-30 10:15:03,103 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:15:03,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-30 10:15:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-30 10:15:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2025-04-30 10:15:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-30 10:15:03,104 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2025-04-30 10:15:03,104 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:15:03,104 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-30 10:15:03,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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) [2025-04-30 10:15:03,104 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-30 10:15:03,104 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-30 10:15:03,107 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-30 10:15:03,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-30 10:15:03,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:15:03,311 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1] [2025-04-30 10:15:03,312 INFO L312 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-04-30 10:15:03,475 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:15:03,486 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-30 10:15:03,487 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-04-30 10:15:03,488 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-04-30 10:15:03,488 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-30 10:15:03,488 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-04-30 10:15:03,488 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-04-30 10:15:03,488 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-30 10:15:03,488 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-04-30 10:15:03,488 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-04-30 10:15:03,488 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-30 10:15:03,488 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!base [2025-04-30 10:15:03,489 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-30 10:15:03,489 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2025-04-30 10:15:03,489 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-30 10:15:03,489 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-30 10:15:03,489 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]] [2025-04-30 10:15:03,489 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!offset [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~last~0!offset [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-04-30 10:15:03,490 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-30 10:15:03,491 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-04-30 10:15:03,491 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-04-30 10:15:03,491 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-04-30 10:15:03,491 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-30 10:15:03,491 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!base [2025-04-30 10:15:03,491 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-30 10:15:03,491 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-30 10:15:03,491 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-30 10:15:03,491 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-30 10:15:03,492 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2025-04-30 10:15:03,492 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] [2025-04-30 10:15:03,492 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-04-30 10:15:03,492 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-30 10:15:03,492 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-30 10:15:03,492 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-04-30 10:15:03,492 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-30 10:15:03,492 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-30 10:15:03,492 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-04-30 10:15:03,495 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-30 10:15:03,496 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-30 10:15:03,496 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-30 10:15:03,496 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2025-04-30 10:15:03,496 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-04-30 10:15:03,496 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-30 10:15:03,496 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-30 10:15:03,497 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-04-30 10:15:03,497 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-04-30 10:15:03,497 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-30 10:15:03,497 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-30 10:15:03,497 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] [2025-04-30 10:15:03,497 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-30 10:15:03,497 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-30 10:15:03,497 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-30 10:15:03,497 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] [2025-04-30 10:15:03,497 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!offset [2025-04-30 10:15:03,498 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~head~0!base [2025-04-30 10:15:03,498 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-30 10:15:03,506 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#s~0!offset [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2025-04-30 10:15:03,510 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2025-04-30 10:15:03,511 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-30 10:15:03,511 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset [2025-04-30 10:15:03,511 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] [2025-04-30 10:15:03,511 WARN L932 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] [2025-04-30 10:15:03,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:15:03 BoogieIcfgContainer [2025-04-30 10:15:03,511 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:15:03,511 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:15:03,511 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:15:03,512 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:15:03,512 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:14:54" (3/4) ... [2025-04-30 10:15:03,515 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:15:03,522 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-04-30 10:15:03,522 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:15:03,522 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:15:03,522 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:15:03,588 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:15:03,588 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:15:03,589 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:15:03,589 INFO L158 Benchmark]: Toolchain (without parser) took 9667.43ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 113.3MB in the beginning and 186.3MB in the end (delta: -73.0MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. [2025-04-30 10:15:03,590 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:15:03,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.22ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 92.1MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:15:03,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.31ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:15:03,591 INFO L158 Benchmark]: Boogie Preprocessor took 48.69ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:15:03,591 INFO L158 Benchmark]: RCFGBuilder took 290.02ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 73.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:15:03,591 INFO L158 Benchmark]: TraceAbstraction took 8826.64ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 73.4MB in the beginning and 194.5MB in the end (delta: -121.1MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2025-04-30 10:15:03,591 INFO L158 Benchmark]: Witness Printer took 77.18ms. Allocated memory is still 343.9MB. Free memory was 194.5MB in the beginning and 186.3MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:15:03,593 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.22ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 92.1MB in the end (delta: 21.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.31ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 90.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.69ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 88.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 290.02ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 73.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8826.64ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 73.4MB in the beginning and 194.5MB in the end (delta: -121.1MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. * Witness Printer took 77.18ms. Allocated memory is still 343.9MB. Free memory was 194.5MB in the beginning and 186.3MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~last~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~last~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~snd_to_last~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#valid,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~head~0!base,]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~head~0!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]],[IntegerLiteral[4]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]],[IntegerLiteral[0]]]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[~#s~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.offset,GLOBAL],[IdentifierExpression[~#s~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 619]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 27 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 698 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 559 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 773 IncrementalHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 139 mSDtfsCounter, 773 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 335 GetRequests, 224 SyntacticMatches, 4 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=8, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 373 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 452 ConstructedInterpolants, 7 QuantifiedInterpolants, 3439 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1635 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 282/337 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((len == 1) && (len == 2)) || ((len <= 0) && (len == 2))) || ((2 == len) && (len == 2))) RESULT: Ultimate proved your program to be correct! [2025-04-30 10:15:03,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE