./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:02:35,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:02:35,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:02:35,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:02:35,324 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:02:35,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:02:35,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:02:35,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:02:35,345 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:02:35,345 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:02:35,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:02:35,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:02:35,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:02:35,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:02:35,346 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:02:35,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:02:35,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:02:35,348 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:02:35,348 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:02:35,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:02:35,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:02:35,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:02:35,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:02:35,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:02:35,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:02:35,349 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:02:35,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:02:35,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:02:35,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:02:35,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:02:35,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:02:35,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:02:35,349 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:02:35,349 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-jdk21/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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2025-02-07 20:02:35,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:02:35,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:02:35,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:02:35,581 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:02:35,582 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:02:35,582 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2025-02-07 20:02:36,775 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9febbcb1f/49136319fd50490394156f98c3976321/FLAG068c46c2b [2025-02-07 20:02:37,014 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:02:37,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2025-02-07 20:02:37,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9febbcb1f/49136319fd50490394156f98c3976321/FLAG068c46c2b [2025-02-07 20:02:37,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9febbcb1f/49136319fd50490394156f98c3976321 [2025-02-07 20:02:37,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:02:37,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:02:37,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:02:37,355 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:02:37,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:02:37,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfc6d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37, skipping insertion in model container [2025-02-07 20:02:37,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:02:37,443 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2025-02-07 20:02:37,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:02:37,467 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:02:37,474 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2025-02-07 20:02:37,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:02:37,489 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:02:37,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37 WrapperNode [2025-02-07 20:02:37,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:02:37,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:02:37,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:02:37,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:02:37,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,510 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-02-07 20:02:37,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:02:37,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:02:37,511 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:02:37,511 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:02:37,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,517 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,527 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 6, 6, 0]. 43 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2, 0]. The 5 writes are split as follows [0, 2, 3, 0]. [2025-02-07 20:02:37,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,532 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,533 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:02:37,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:02:37,536 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:02:37,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:02:37,537 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (1/1) ... [2025-02-07 20:02:37,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:02:37,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:02:37,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 20:02:37,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 20:02:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:02:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:02:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 20:02:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 20:02:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 20:02:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 20:02:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 20:02:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 20:02:37,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-02-07 20:02:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure g [2025-02-07 20:02:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure fake_malloc [2025-02-07 20:02:37,580 INFO L138 BoogieDeclarations]: Found implementation of procedure fake_malloc [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 20:02:37,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 20:02:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:02:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:02:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 20:02:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 20:02:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:02:37,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:02:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:02:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:02:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 20:02:37,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 20:02:37,645 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:02:37,646 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:02:37,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc #t~post10; [2025-02-07 20:02:37,793 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-02-07 20:02:37,793 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:02:37,802 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:02:37,803 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:02:37,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:02:37 BoogieIcfgContainer [2025-02-07 20:02:37,804 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:02:37,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:02:37,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:02:37,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:02:37,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:02:37" (1/3) ... [2025-02-07 20:02:37,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d02d8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:02:37, skipping insertion in model container [2025-02-07 20:02:37,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:02:37" (2/3) ... [2025-02-07 20:02:37,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d02d8d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:02:37, skipping insertion in model container [2025-02-07 20:02:37,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:02:37" (3/3) ... [2025-02-07 20:02:37,811 INFO L128 eAbstractionObserver]: Analyzing ICFG ex3_forlist.i [2025-02-07 20:02:37,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:02:37,824 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ex3_forlist.i that has 4 procedures, 33 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-07 20:02:37,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:02:37,876 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c82824b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:02:37,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:02:37,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 20:02:37,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 20:02:37,883 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:37,884 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:37,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:37,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:37,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1260850310, now seen corresponding path program 1 times [2025-02-07 20:02:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:37,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289246555] [2025-02-07 20:02:37,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:37,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:37,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 20:02:37,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 20:02:37,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:37,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:02:38,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289246555] [2025-02-07 20:02:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289246555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:02:38,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:02:38,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:02:38,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823952077] [2025-02-07 20:02:38,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:02:38,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:02:38,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:38,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:02:38,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:02:38,087 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.380952380952381) internal successors, (29), 23 states have internal predecessors, (29), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 20:02:38,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:02:38,104 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2025-02-07 20:02:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:02:38,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2025-02-07 20:02:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:02:38,109 INFO L225 Difference]: With dead ends: 65 [2025-02-07 20:02:38,109 INFO L226 Difference]: Without dead ends: 30 [2025-02-07 20:02:38,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 20:02:38,113 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:02:38,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:02:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-07 20:02:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-07 20:02:38,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:02:38,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2025-02-07 20:02:38,133 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 29 [2025-02-07 20:02:38,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:02:38,133 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2025-02-07 20:02:38,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 20:02:38,133 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2025-02-07 20:02:38,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-07 20:02:38,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:38,134 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:38,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:02:38,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:38,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:38,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1325929122, now seen corresponding path program 1 times [2025-02-07 20:02:38,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:38,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970154371] [2025-02-07 20:02:38,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:38,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:38,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 20:02:38,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 20:02:38,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:38,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:02:38,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:38,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970154371] [2025-02-07 20:02:38,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970154371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:02:38,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820598092] [2025-02-07 20:02:38,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:38,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:38,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:02:38,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:02:38,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 20:02:38,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-07 20:02:38,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-07 20:02:38,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:38,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:38,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-07 20:02:38,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:02:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 20:02:38,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:02:38,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820598092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:02:38,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:02:38,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-07 20:02:38,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585900346] [2025-02-07 20:02:38,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:02:38,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 20:02:38,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:38,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 20:02:38,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:02:38,371 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 20:02:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:02:38,384 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2025-02-07 20:02:38,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 20:02:38,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2025-02-07 20:02:38,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:02:38,385 INFO L225 Difference]: With dead ends: 50 [2025-02-07 20:02:38,386 INFO L226 Difference]: Without dead ends: 32 [2025-02-07 20:02:38,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:02:38,386 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:02:38,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:02:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-07 20:02:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2025-02-07 20:02:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:02:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2025-02-07 20:02:38,394 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 30 [2025-02-07 20:02:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:02:38,395 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2025-02-07 20:02:38,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 20:02:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2025-02-07 20:02:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 20:02:38,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:38,396 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:38,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 20:02:38,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:38,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:38,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:38,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1643181088, now seen corresponding path program 1 times [2025-02-07 20:02:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:38,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873650945] [2025-02-07 20:02:38,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:38,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:38,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 20:02:38,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 20:02:38,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:38,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:38,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 20:02:38,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:38,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873650945] [2025-02-07 20:02:38,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873650945] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:02:38,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488183780] [2025-02-07 20:02:38,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:38,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:38,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:02:38,692 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:02:38,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 20:02:38,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-07 20:02:38,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 20:02:38,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:38,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:38,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:02:38,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:02:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 20:02:38,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:02:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 20:02:38,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488183780] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:02:38,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:02:38,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 5 [2025-02-07 20:02:38,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638077743] [2025-02-07 20:02:38,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:02:38,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:02:38,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:38,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:02:38,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:02:38,847 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-07 20:02:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:02:38,863 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2025-02-07 20:02:38,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:02:38,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 32 [2025-02-07 20:02:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:02:38,864 INFO L225 Difference]: With dead ends: 60 [2025-02-07 20:02:38,864 INFO L226 Difference]: Without dead ends: 32 [2025-02-07 20:02:38,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 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-02-07 20:02:38,864 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:02:38,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:02:38,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-07 20:02:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-02-07 20:02:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:02:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2025-02-07 20:02:38,868 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 32 [2025-02-07 20:02:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:02:38,868 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2025-02-07 20:02:38,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2025-02-07 20:02:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2025-02-07 20:02:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-07 20:02:38,869 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:38,869 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:38,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 20:02:39,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:39,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:39,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash 89456708, now seen corresponding path program 2 times [2025-02-07 20:02:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:39,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632479988] [2025-02-07 20:02:39,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:02:39,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:39,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-07 20:02:39,111 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 33 statements. [2025-02-07 20:02:39,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 20:02:39,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:02:39,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:39,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632479988] [2025-02-07 20:02:39,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632479988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:02:39,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:02:39,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-07 20:02:39,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230631516] [2025-02-07 20:02:39,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:02:39,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:02:39,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:39,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:02:39,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:02:39,403 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 20:02:39,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:02:39,524 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2025-02-07 20:02:39,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:02:39,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 33 [2025-02-07 20:02:39,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:02:39,527 INFO L225 Difference]: With dead ends: 69 [2025-02-07 20:02:39,528 INFO L226 Difference]: Without dead ends: 58 [2025-02-07 20:02:39,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:02:39,529 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 89 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:02:39,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 108 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:02:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-07 20:02:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2025-02-07 20:02:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 37 states have internal predecessors, (48), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-07 20:02:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2025-02-07 20:02:39,540 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 33 [2025-02-07 20:02:39,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:02:39,540 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2025-02-07 20:02:39,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2025-02-07 20:02:39,540 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2025-02-07 20:02:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-07 20:02:39,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:39,544 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:39,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:02:39,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:39,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:39,546 INFO L85 PathProgramCache]: Analyzing trace with hash 132581606, now seen corresponding path program 1 times [2025-02-07 20:02:39,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:39,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999562503] [2025-02-07 20:02:39,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:39,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:39,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 20:02:39,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:02:39,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:39,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 20:02:39,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999562503] [2025-02-07 20:02:39,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999562503] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:02:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11023614] [2025-02-07 20:02:39,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:39,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:39,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:02:39,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:02:39,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 20:02:39,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-07 20:02:39,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-07 20:02:39,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:39,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:39,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:02:39,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:02:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 20:02:39,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:02:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-07 20:02:39,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11023614] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:02:39,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:02:39,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-07 20:02:39,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615364215] [2025-02-07 20:02:39,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:02:39,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:02:39,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:39,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:02:39,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:02:39,750 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 20:02:39,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:02:39,764 INFO L93 Difference]: Finished difference Result 87 states and 118 transitions. [2025-02-07 20:02:39,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:02:39,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-02-07 20:02:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:02:39,765 INFO L225 Difference]: With dead ends: 87 [2025-02-07 20:02:39,765 INFO L226 Difference]: Without dead ends: 54 [2025-02-07 20:02:39,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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-02-07 20:02:39,766 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:02:39,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:02:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-07 20:02:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-07 20:02:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-07 20:02:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2025-02-07 20:02:39,772 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 35 [2025-02-07 20:02:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:02:39,772 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2025-02-07 20:02:39,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-07 20:02:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2025-02-07 20:02:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-07 20:02:39,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:39,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:39,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-07 20:02:39,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:39,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:39,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:39,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2144801950, now seen corresponding path program 1 times [2025-02-07 20:02:39,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:39,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370768938] [2025-02-07 20:02:39,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:39,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 20:02:40,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 20:02:40,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:40,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 20:02:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370768938] [2025-02-07 20:02:40,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370768938] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:02:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249037214] [2025-02-07 20:02:40,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:40,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:40,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:02:40,456 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:02:40,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 20:02:40,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-07 20:02:40,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-07 20:02:40,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:40,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:40,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 20:02:40,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:02:40,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 20:02:40,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-07 20:02:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 20:02:40,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:02:41,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2025-02-07 20:02:41,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-02-07 20:02:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 20:02:41,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249037214] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:02:41,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:02:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2025-02-07 20:02:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550646829] [2025-02-07 20:02:41,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:02:41,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-07 20:02:41,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:41,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-07 20:02:41,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2025-02-07 20:02:41,194 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. Second operand has 39 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 28 states have internal predecessors, (59), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-07 20:02:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:02:41,970 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2025-02-07 20:02:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 20:02:41,971 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 28 states have internal predecessors, (59), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 36 [2025-02-07 20:02:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:02:41,971 INFO L225 Difference]: With dead ends: 106 [2025-02-07 20:02:41,972 INFO L226 Difference]: Without dead ends: 82 [2025-02-07 20:02:41,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=2224, Unknown=0, NotChecked=0, Total=2550 [2025-02-07 20:02:41,973 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 125 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:02:41,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 85 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:02:41,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-07 20:02:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2025-02-07 20:02:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 59 states have internal predecessors, (74), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 8 states have call successors, (13) [2025-02-07 20:02:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 99 transitions. [2025-02-07 20:02:41,986 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 99 transitions. Word has length 36 [2025-02-07 20:02:41,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:02:41,986 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 99 transitions. [2025-02-07 20:02:41,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 28 states have internal predecessors, (59), 11 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2025-02-07 20:02:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 99 transitions. [2025-02-07 20:02:41,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 20:02:41,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:41,987 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:41,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 20:02:42,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-07 20:02:42,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:42,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:42,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1540326210, now seen corresponding path program 1 times [2025-02-07 20:02:42,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:42,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061765426] [2025-02-07 20:02:42,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:42,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:02:42,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:02:42,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:42,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 20:02:42,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061765426] [2025-02-07 20:02:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061765426] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:02:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593200000] [2025-02-07 20:02:42,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:42,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:42,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:02:42,543 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:02:42,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 20:02:42,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:02:42,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:02:42,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:42,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:42,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-07 20:02:42,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:02:42,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 20:02:42,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:02:42,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-02-07 20:02:42,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:02:42,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:02:42,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2025-02-07 20:02:43,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:02:43,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:02:43,033 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-02-07 20:02:43,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2025-02-07 20:02:43,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-07 20:02:43,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:02:43,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-07 20:02:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:02:43,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:02:50,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-07 20:02:50,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-02-07 20:02:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:02:50,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593200000] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:02:50,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:02:50,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 17, 15] total 39 [2025-02-07 20:02:50,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463957828] [2025-02-07 20:02:50,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:02:50,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-07 20:02:50,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:50,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-07 20:02:50,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1353, Unknown=7, NotChecked=0, Total=1482 [2025-02-07 20:02:50,760 INFO L87 Difference]: Start difference. First operand 78 states and 99 transitions. Second operand has 39 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 30 states have internal predecessors, (63), 7 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-07 20:02:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:02:52,016 INFO L93 Difference]: Finished difference Result 108 states and 133 transitions. [2025-02-07 20:02:52,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-07 20:02:52,016 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 30 states have internal predecessors, (63), 7 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 37 [2025-02-07 20:02:52,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:02:52,017 INFO L225 Difference]: With dead ends: 108 [2025-02-07 20:02:52,017 INFO L226 Difference]: Without dead ends: 74 [2025-02-07 20:02:52,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=343, Invalid=2956, Unknown=7, NotChecked=0, Total=3306 [2025-02-07 20:02:52,019 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 20:02:52,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 85 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 910 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 20:02:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-07 20:02:52,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2025-02-07 20:02:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 38 states have (on average 1.236842105263158) internal successors, (47), 39 states have internal predecessors, (47), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-07 20:02:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2025-02-07 20:02:52,032 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 37 [2025-02-07 20:02:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:02:52,033 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-02-07 20:02:52,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 30 states have internal predecessors, (63), 7 states have call successors, (15), 10 states have call predecessors, (15), 7 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2025-02-07 20:02:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2025-02-07 20:02:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 20:02:52,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:52,037 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:52,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 20:02:52,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:52,238 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:52,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:52,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1671637987, now seen corresponding path program 1 times [2025-02-07 20:02:52,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:52,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212595881] [2025-02-07 20:02:52,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:52,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 20:02:52,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 20:02:52,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:52,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:02:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212595881] [2025-02-07 20:02:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212595881] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:02:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567234557] [2025-02-07 20:02:53,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:53,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:53,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:02:53,008 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:02:53,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 20:02:53,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 20:02:53,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 20:02:53,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:53,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:53,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-07 20:02:53,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:02:53,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 20:02:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 20:02:53,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:02:53,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-07 20:02:53,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-02-07 20:02:54,012 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:02:54,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567234557] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:02:54,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:02:54,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 17] total 52 [2025-02-07 20:02:54,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028822765] [2025-02-07 20:02:54,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:02:54,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-07 20:02:54,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:54,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-07 20:02:54,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2498, Unknown=0, NotChecked=0, Total=2652 [2025-02-07 20:02:54,018 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 52 states, 45 states have (on average 1.711111111111111) internal successors, (77), 37 states have internal predecessors, (77), 12 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-07 20:02:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:02:55,691 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2025-02-07 20:02:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-07 20:02:55,692 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 45 states have (on average 1.711111111111111) internal successors, (77), 37 states have internal predecessors, (77), 12 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) Word has length 38 [2025-02-07 20:02:55,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:02:55,692 INFO L225 Difference]: With dead ends: 132 [2025-02-07 20:02:55,693 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 20:02:55,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=559, Invalid=6083, Unknown=0, NotChecked=0, Total=6642 [2025-02-07 20:02:55,696 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 246 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-07 20:02:55,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 55 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 20:02:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 20:02:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2025-02-07 20:02:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 72 states have internal predecessors, (85), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-07 20:02:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2025-02-07 20:02:55,714 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 38 [2025-02-07 20:02:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:02:55,714 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2025-02-07 20:02:55,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 45 states have (on average 1.711111111111111) internal successors, (77), 37 states have internal predecessors, (77), 12 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-07 20:02:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2025-02-07 20:02:55,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-07 20:02:55,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:55,718 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:55,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 20:02:55,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-07 20:02:55,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:55,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1716845726, now seen corresponding path program 1 times [2025-02-07 20:02:55,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:55,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904744671] [2025-02-07 20:02:55,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:55,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 20:02:55,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 20:02:55,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:55,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 20:02:55,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904744671] [2025-02-07 20:02:55,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904744671] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:02:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544489337] [2025-02-07 20:02:55,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:55,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:55,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:02:55,975 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:02:55,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-07 20:02:56,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-07 20:02:56,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 20:02:56,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:56,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:56,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 20:02:56,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:02:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 20:02:56,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:02:56,111 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-07 20:02:56,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544489337] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:02:56,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:02:56,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-07 20:02:56,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304126862] [2025-02-07 20:02:56,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:02:56,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:02:56,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:56,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:02:56,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:02:56,114 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 20:02:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:02:56,139 INFO L93 Difference]: Finished difference Result 130 states and 154 transitions. [2025-02-07 20:02:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:02:56,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2025-02-07 20:02:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:02:56,140 INFO L225 Difference]: With dead ends: 130 [2025-02-07 20:02:56,141 INFO L226 Difference]: Without dead ends: 103 [2025-02-07 20:02:56,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 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-02-07 20:02:56,142 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 10 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:02:56,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:02:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-07 20:02:56,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2025-02-07 20:02:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 76 states have internal predecessors, (89), 10 states have call successors, (10), 9 states have call predecessors, (10), 10 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2025-02-07 20:02:56,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2025-02-07 20:02:56,162 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 46 [2025-02-07 20:02:56,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:02:56,162 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2025-02-07 20:02:56,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 20:02:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2025-02-07 20:02:56,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-07 20:02:56,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:56,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:56,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 20:02:56,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:56,365 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:56,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1711261298, now seen corresponding path program 1 times [2025-02-07 20:02:56,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:56,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197675808] [2025-02-07 20:02:56,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:56,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:56,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-07 20:02:56,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 20:02:56,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:56,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 20:02:56,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197675808] [2025-02-07 20:02:56,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197675808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:02:56,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954219515] [2025-02-07 20:02:56,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:56,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:56,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:02:56,827 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:02:56,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 20:02:56,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-07 20:02:56,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-07 20:02:56,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:56,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:56,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-07 20:02:56,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:02:57,283 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-07 20:02:57,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:02:57,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-07 20:02:57,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:02:57,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2025-02-07 20:02:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 20:02:57,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954219515] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:02:57,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:02:57,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 42 [2025-02-07 20:02:57,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118987624] [2025-02-07 20:02:57,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:02:57,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-07 20:02:57,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:57,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-07 20:02:57,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2025-02-07 20:02:57,545 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 42 states, 37 states have (on average 2.027027027027027) internal successors, (75), 29 states have internal predecessors, (75), 10 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (15), 11 states have call predecessors, (15), 7 states have call successors, (15) [2025-02-07 20:02:58,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:02:58,277 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2025-02-07 20:02:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 20:02:58,278 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 2.027027027027027) internal successors, (75), 29 states have internal predecessors, (75), 10 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (15), 11 states have call predecessors, (15), 7 states have call successors, (15) Word has length 48 [2025-02-07 20:02:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:02:58,279 INFO L225 Difference]: With dead ends: 137 [2025-02-07 20:02:58,279 INFO L226 Difference]: Without dead ends: 107 [2025-02-07 20:02:58,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=2501, Unknown=0, NotChecked=0, Total=2756 [2025-02-07 20:02:58,280 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 88 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:02:58,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 77 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:02:58,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-02-07 20:02:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 65. [2025-02-07 20:02:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-07 20:02:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2025-02-07 20:02:58,302 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 48 [2025-02-07 20:02:58,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:02:58,302 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2025-02-07 20:02:58,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 2.027027027027027) internal successors, (75), 29 states have internal predecessors, (75), 10 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (15), 11 states have call predecessors, (15), 7 states have call successors, (15) [2025-02-07 20:02:58,302 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2025-02-07 20:02:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-07 20:02:58,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:02:58,302 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:02:58,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-07 20:02:58,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:58,503 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:02:58,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:02:58,508 INFO L85 PathProgramCache]: Analyzing trace with hash 265302905, now seen corresponding path program 1 times [2025-02-07 20:02:58,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:02:58,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311802368] [2025-02-07 20:02:58,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:58,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:02:58,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 20:02:58,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 20:02:58,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:58,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 20:02:59,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:02:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311802368] [2025-02-07 20:02:59,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311802368] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:02:59,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883107660] [2025-02-07 20:02:59,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:02:59,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:02:59,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:02:59,115 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:02:59,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 20:02:59,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-07 20:02:59,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-07 20:02:59,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:02:59,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:02:59,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 20:02:59,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:02:59,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 20:02:59,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-07 20:02:59,421 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 20:02:59,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:02:59,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-07 20:02:59,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 20:02:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 20:02:59,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883107660] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:02:59,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:02:59,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9, 9] total 34 [2025-02-07 20:02:59,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437573559] [2025-02-07 20:02:59,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:02:59,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-07 20:02:59,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:02:59,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-07 20:02:59,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2025-02-07 20:02:59,620 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 34 states, 32 states have (on average 2.96875) internal successors, (95), 30 states have internal predecessors, (95), 9 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-07 20:03:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:00,430 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2025-02-07 20:03:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-07 20:03:00,431 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.96875) internal successors, (95), 30 states have internal predecessors, (95), 9 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) Word has length 49 [2025-02-07 20:03:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:00,432 INFO L225 Difference]: With dead ends: 90 [2025-02-07 20:03:00,432 INFO L226 Difference]: Without dead ends: 69 [2025-02-07 20:03:00,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=422, Invalid=2884, Unknown=0, NotChecked=0, Total=3306 [2025-02-07 20:03:00,433 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 230 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:00,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 124 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:03:00,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-07 20:03:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2025-02-07 20:03:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-07 20:03:00,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2025-02-07 20:03:00,454 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 49 [2025-02-07 20:03:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:00,454 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2025-02-07 20:03:00,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.96875) internal successors, (95), 30 states have internal predecessors, (95), 9 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15) [2025-02-07 20:03:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2025-02-07 20:03:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-07 20:03:00,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:03:00,454 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:03:00,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-07 20:03:00,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:00,655 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting gErr0ASSERT_VIOLATIONERROR_FUNCTION === [gErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:03:00,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:03:00,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1739829042, now seen corresponding path program 2 times [2025-02-07 20:03:00,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:03:00,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130544518] [2025-02-07 20:03:00,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:03:00,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:03:00,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-07 20:03:00,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-07 20:03:00,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:03:00,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 20:03:00,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:03:00,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130544518] [2025-02-07 20:03:00,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130544518] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:03:00,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050239975] [2025-02-07 20:03:00,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:03:00,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:03:00,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:03:00,719 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:03:00,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-07 20:03:00,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-02-07 20:03:00,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 54 of 54 statements. [2025-02-07 20:03:00,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:03:00,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:03:00,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 20:03:00,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:03:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-07 20:03:00,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:03:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050239975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:03:00,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:03:00,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-02-07 20:03:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911620608] [2025-02-07 20:03:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:03:00,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:03:00,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:03:00,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:03:00,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:03:00,836 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 20:03:00,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:03:00,854 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2025-02-07 20:03:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:03:00,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2025-02-07 20:03:00,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:03:00,855 INFO L225 Difference]: With dead ends: 73 [2025-02-07 20:03:00,855 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 20:03:00,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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-02-07 20:03:00,855 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:03:00,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:03:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 20:03:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 20:03:00,856 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-02-07 20:03:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 20:03:00,857 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2025-02-07 20:03:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:03:00,857 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 20:03:00,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-07 20:03:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 20:03:00,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 20:03:00,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location gErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:03:00,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-07 20:03:01,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-07 20:03:01,069 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:03:01,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 20:03:10,561 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 106 DAG size of output: 63 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-02-07 20:03:11,182 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:03:11,198 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 20:03:11,199 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-07 20:03:11,200 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,203 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,204 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,205 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,206 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,206 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,208 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,208 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-07 20:03:11,208 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,208 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,208 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,208 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL] [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,210 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL] [2025-02-07 20:03:11,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,211 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-07 20:03:11,213 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!base [2025-02-07 20:03:11,213 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!base [2025-02-07 20:03:11,213 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-07 20:03:11,214 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,214 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,215 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-07 20:03:11,215 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,215 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]] [2025-02-07 20:03:11,215 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,215 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2025-02-07 20:03:11,215 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2025-02-07 20:03:11,216 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] [2025-02-07 20:03:11,216 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-07 20:03:11,216 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-02-07 20:03:11,216 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset [2025-02-07 20:03:11,216 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,216 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]] [2025-02-07 20:03:11,216 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,216 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#pp~0!offset [2025-02-07 20:03:11,216 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-02-07 20:03:11,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]] [2025-02-07 20:03:11,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-02-07 20:03:11,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base [2025-02-07 20:03:11,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]] [2025-02-07 20:03:11,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] [2025-02-07 20:03:11,217 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,218 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset [2025-02-07 20:03:11,218 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~pointer!offset [2025-02-07 20:03:11,218 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~pointer!offset [2025-02-07 20:03:11,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:03:11 BoogieIcfgContainer [2025-02-07 20:03:11,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:03:11,220 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:03:11,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:03:11,220 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:03:11,220 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:02:37" (3/4) ... [2025-02-07 20:03:11,222 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 20:03:11,226 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure f [2025-02-07 20:03:11,226 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure g [2025-02-07 20:03:11,226 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fake_malloc [2025-02-07 20:03:11,229 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-07 20:03:11,229 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-07 20:03:11,230 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 20:03:11,230 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 20:03:11,285 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:03:11,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:03:11,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:03:11,287 INFO L158 Benchmark]: Toolchain (without parser) took 33933.10ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 106.6MB in the beginning and 183.1MB in the end (delta: -76.5MB). Peak memory consumption was 211.7MB. Max. memory is 16.1GB. [2025-02-07 20:03:11,287 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:03:11,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.27ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:03:11,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.51ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:03:11,288 INFO L158 Benchmark]: Boogie Preprocessor took 24.74ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:03:11,288 INFO L158 Benchmark]: IcfgBuilder took 268.15ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 77.1MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:03:11,289 INFO L158 Benchmark]: TraceAbstraction took 33413.61ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 77.1MB in the beginning and 191.5MB in the end (delta: -114.4MB). Peak memory consumption was 232.1MB. Max. memory is 16.1GB. [2025-02-07 20:03:11,289 INFO L158 Benchmark]: Witness Printer took 66.83ms. Allocated memory is still 436.2MB. Free memory was 191.5MB in the beginning and 183.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:03:11,291 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.27ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 95.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.51ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 94.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.74ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.1MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 268.15ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 77.1MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 33413.61ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 77.1MB in the beginning and 191.5MB in the end (delta: -114.4MB). Peak memory consumption was 232.1MB. Max. memory is 16.1GB. * Witness Printer took 66.83ms. Allocated memory is still 436.2MB. Free memory was 191.5MB in the beginning and 183.1MB in the end (delta: 8.4MB). 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: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - 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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - 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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - 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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - 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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - 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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!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[~#pp~0!base,GLOBAL]]] - 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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - 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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - 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[~#pp~0!base,GLOBAL]]] - 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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~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[~#pp~0!base,GLOBAL]]] - 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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~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[~#pp~0!base,GLOBAL]]] - 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[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[~#pstate~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pstate~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~#pp~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.base,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#1.offset,GLOBAL]],[IdentifierExpression[~#pp~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#1.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~pointer!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~pointer!offset * 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: 8]: 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 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 12, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 879 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 879 mSDsluCounter, 1048 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 762 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5685 IncrementalHoareTripleChecker+Invalid, 5915 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 286 mSDtfsCounter, 5685 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 935 GetRequests, 604 SyntacticMatches, 13 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3261 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=9, InterpolantAutomatonStates: 144, 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, 12 MinimizatonAttempts, 111 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 872 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1163 ConstructedInterpolants, 25 QuantifiedInterpolants, 6043 SizeOfPredicates, 39 NumberOfNonLiveVariables, 3085 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 30 InterpolantComputations, 4 PerfectInterpolantSequences, 426/616 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: 38]: Location Invariant Derived location invariant: (((1 <= counter) || (1 <= counter)) || (1 <= counter)) - InvariantResult [Line: 19]: Location Invariant Derived location invariant: (((i == 0) && (counter == 1)) || ((1 <= i) && (counter == 1))) - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((1 <= counter) || (1 <= counter)) RESULT: Ultimate proved your program to be correct! [2025-02-07 20:03:11,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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