./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:56:30,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:56:30,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:56:30,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:56:30,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:56:30,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:56:30,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:56:30,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:56:30,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:56:30,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:56:30,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:56:30,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:56:30,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:56:30,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:56:30,701 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:56:30,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:56:30,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:56:30,701 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:56:30,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:56:30,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:56:30,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:56:30,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:56:30,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:56:30,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:56:30,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:56:30,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:56:30,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:56:30,703 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2025-03-16 18:56:30,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:56:30,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:56:30,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:56:30,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:56:30,943 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:56:30,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2025-03-16 18:56:32,068 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3db8974/82c85dc96263474cbdc2838bc747cdb9/FLAG2b249fff4 [2025-03-16 18:56:32,284 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:56:32,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2025-03-16 18:56:32,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3db8974/82c85dc96263474cbdc2838bc747cdb9/FLAG2b249fff4 [2025-03-16 18:56:32,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb3db8974/82c85dc96263474cbdc2838bc747cdb9 [2025-03-16 18:56:32,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:56:32,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:56:32,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:56:32,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:56:32,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:56:32,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eaa278c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32, skipping insertion in model container [2025-03-16 18:56:32,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,318 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:56:32,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2025-03-16 18:56:32,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:56:32,435 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:56:32,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2025-03-16 18:56:32,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:56:32,455 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:56:32,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32 WrapperNode [2025-03-16 18:56:32,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:56:32,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:56:32,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:56:32,456 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:56:32,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,476 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2025-03-16 18:56:32,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:56:32,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:56:32,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:56:32,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:56:32,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,489 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2025-03-16 18:56:32,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,496 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:56:32,497 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:56:32,497 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:56:32,497 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:56:32,497 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (1/1) ... [2025-03-16 18:56:32,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:56:32,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:56:32,520 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 18:56:32,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 18:56:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:56:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:56:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 18:56:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2025-03-16 18:56:32,539 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:56:32,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2025-03-16 18:56:32,539 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2025-03-16 18:56:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 18:56:32,595 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:56:32,597 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:56:32,724 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L61: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset; [2025-03-16 18:56:32,751 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-16 18:56:32,751 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:56:32,760 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:56:32,760 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:56:32,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:56:32 BoogieIcfgContainer [2025-03-16 18:56:32,761 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:56:32,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:56:32,764 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:56:32,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:56:32,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:56:32" (1/3) ... [2025-03-16 18:56:32,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ebaa26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:56:32, skipping insertion in model container [2025-03-16 18:56:32,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:56:32" (2/3) ... [2025-03-16 18:56:32,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ebaa26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:56:32, skipping insertion in model container [2025-03-16 18:56:32,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:56:32" (3/3) ... [2025-03-16 18:56:32,769 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2025-03-16 18:56:32,780 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:56:32,781 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_2.c that has 3 procedures, 23 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 18:56:32,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:56:32,826 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;@686a61ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:56:32,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:56:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-16 18:56:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 18:56:32,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:32,834 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:32,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:32,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash -44708894, now seen corresponding path program 1 times [2025-03-16 18:56:32,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:32,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866263661] [2025-03-16 18:56:32,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:56:32,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:32,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 18:56:32,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 18:56:32,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:56:32,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:56:33,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:33,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866263661] [2025-03-16 18:56:33,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866263661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:56:33,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:56:33,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 18:56:33,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333294472] [2025-03-16 18:56:33,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:56:33,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:56:33,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:33,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:56:33,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:56:33,188 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 18:56:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:56:33,294 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2025-03-16 18:56:33,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:56:33,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-16 18:56:33,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:56:33,300 INFO L225 Difference]: With dead ends: 34 [2025-03-16 18:56:33,301 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 18:56:33,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:56:33,305 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 7 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:56:33,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:56:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 18:56:33,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-16 18:56:33,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-16 18:56:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-16 18:56:33,331 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2025-03-16 18:56:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:56:33,331 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-16 18:56:33,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-16 18:56:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-16 18:56:33,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 18:56:33,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:33,332 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:33,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:56:33,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:33,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1481547641, now seen corresponding path program 1 times [2025-03-16 18:56:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056432458] [2025-03-16 18:56:33,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:56:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:33,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 18:56:33,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 18:56:33,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:56:33,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 18:56:33,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:33,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056432458] [2025-03-16 18:56:33,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056432458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:56:33,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:56:33,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:56:33,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781041801] [2025-03-16 18:56:33,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:56:33,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:56:33,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:33,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:56:33,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:56:33,583 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:56:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:56:33,644 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2025-03-16 18:56:33,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:56:33,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2025-03-16 18:56:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:56:33,646 INFO L225 Difference]: With dead ends: 42 [2025-03-16 18:56:33,646 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 18:56:33,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 18:56:33,647 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:56:33,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 53 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:56:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 18:56:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-16 18:56:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-16 18:56:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-16 18:56:33,651 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 21 [2025-03-16 18:56:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:56:33,651 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-16 18:56:33,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:56:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-16 18:56:33,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 18:56:33,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:33,652 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:33,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:56:33,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:33,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash -791557793, now seen corresponding path program 1 times [2025-03-16 18:56:33,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:33,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945045820] [2025-03-16 18:56:33,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:56:33,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:33,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 18:56:33,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 18:56:33,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:56:33,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:56:34,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:34,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945045820] [2025-03-16 18:56:34,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945045820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:34,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537960833] [2025-03-16 18:56:34,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:56:34,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:34,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:56:34,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:56:34,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:56:34,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 18:56:34,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 18:56:34,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:56:34,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:34,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 18:56:34,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:56:34,114 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-03-16 18:56:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:56:34,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:56:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:56:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537960833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:56:34,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:56:34,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2025-03-16 18:56:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047802926] [2025-03-16 18:56:34,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:56:34,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-16 18:56:34,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:34,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-16 18:56:34,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-03-16 18:56:34,713 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-16 18:56:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:56:35,023 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2025-03-16 18:56:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 18:56:35,024 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) Word has length 26 [2025-03-16 18:56:35,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:56:35,025 INFO L225 Difference]: With dead ends: 48 [2025-03-16 18:56:35,025 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 18:56:35,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 18:56:35,027 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 25 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:56:35,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 98 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:56:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 18:56:35,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-16 18:56:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:56:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-16 18:56:35,037 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2025-03-16 18:56:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:56:35,037 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-16 18:56:35,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 5 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2025-03-16 18:56:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-16 18:56:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 18:56:35,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:35,038 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:35,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:56:35,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:35,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:35,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:35,239 INFO L85 PathProgramCache]: Analyzing trace with hash 609563148, now seen corresponding path program 2 times [2025-03-16 18:56:35,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:35,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090853376] [2025-03-16 18:56:35,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:56:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:35,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-16 18:56:35,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 18:56:35,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:56:35,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:35,709 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 18:56:35,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:35,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090853376] [2025-03-16 18:56:35,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090853376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:35,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710329590] [2025-03-16 18:56:35,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:56:35,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:35,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:56:35,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:56:35,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:56:35,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 52 statements into 2 equivalence classes. [2025-03-16 18:56:35,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 18:56:35,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:56:35,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:35,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-16 18:56:35,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:56:35,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-16 18:56:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-16 18:56:36,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:56:36,450 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-16 18:56:36,451 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 33 treesize of output 25 [2025-03-16 18:56:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 18:56:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710329590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:56:44,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:56:44,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2025-03-16 18:56:44,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715392910] [2025-03-16 18:56:44,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:56:44,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 18:56:44,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:44,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 18:56:44,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=720, Unknown=2, NotChecked=0, Total=812 [2025-03-16 18:56:44,810 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 29 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 11 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2025-03-16 18:56:49,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 18:56:49,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:56:49,280 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2025-03-16 18:56:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 18:56:49,280 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 11 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) Word has length 52 [2025-03-16 18:56:49,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:56:49,281 INFO L225 Difference]: With dead ends: 58 [2025-03-16 18:56:49,281 INFO L226 Difference]: Without dead ends: 31 [2025-03-16 18:56:49,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=252, Invalid=1638, Unknown=2, NotChecked=0, Total=1892 [2025-03-16 18:56:49,282 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:56:49,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 60 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 235 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 18:56:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-16 18:56:49,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-16 18:56:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-16 18:56:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-03-16 18:56:49,293 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 52 [2025-03-16 18:56:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:56:49,293 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-03-16 18:56:49,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 2.0) internal successors, (48), 25 states have internal predecessors, (48), 11 states have call successors, (15), 5 states have call predecessors, (15), 9 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2025-03-16 18:56:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-03-16 18:56:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-16 18:56:49,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:49,295 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:49,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 18:56:49,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 18:56:49,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:49,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:49,497 INFO L85 PathProgramCache]: Analyzing trace with hash -724092677, now seen corresponding path program 1 times [2025-03-16 18:56:49,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:49,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710442891] [2025-03-16 18:56:49,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:56:49,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:49,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 18:56:49,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 18:56:49,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:56:49,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 8 proven. 92 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-16 18:56:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710442891] [2025-03-16 18:56:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710442891] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895044899] [2025-03-16 18:56:50,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:56:50,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:50,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:56:50,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:56:50,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:56:50,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-16 18:56:50,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-16 18:56:50,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:56:50,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:50,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-16 18:56:50,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:56:50,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-16 18:56:50,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2025-03-16 18:56:50,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-16 18:56:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2025-03-16 18:56:50,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:56:50,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895044899] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:50,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 18:56:50,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2025-03-16 18:56:50,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267747907] [2025-03-16 18:56:50,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 18:56:50,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-16 18:56:50,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:50,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-16 18:56:50,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2025-03-16 18:56:50,639 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 22 states, 17 states have (on average 2.411764705882353) internal successors, (41), 20 states have internal predecessors, (41), 9 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2025-03-16 18:56:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:56:50,888 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2025-03-16 18:56:50,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-16 18:56:50,889 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 2.411764705882353) internal successors, (41), 20 states have internal predecessors, (41), 9 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) Word has length 62 [2025-03-16 18:56:50,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:56:50,890 INFO L225 Difference]: With dead ends: 64 [2025-03-16 18:56:50,890 INFO L226 Difference]: Without dead ends: 35 [2025-03-16 18:56:50,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 18:56:50,891 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:56:50,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 57 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:56:50,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-16 18:56:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-16 18:56:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 18:56:50,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-16 18:56:50,900 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 62 [2025-03-16 18:56:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:56:50,900 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-16 18:56:50,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 2.411764705882353) internal successors, (41), 20 states have internal predecessors, (41), 9 states have call successors, (12), 3 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13) [2025-03-16 18:56:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-03-16 18:56:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-16 18:56:50,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:50,901 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:50,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 18:56:51,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:51,102 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:51,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1987715454, now seen corresponding path program 2 times [2025-03-16 18:56:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:51,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867556776] [2025-03-16 18:56:51,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:56:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:51,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-03-16 18:56:51,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 18:56:51,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:56:51,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 12 proven. 262 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 18:56:51,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867556776] [2025-03-16 18:56:51,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867556776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860942593] [2025-03-16 18:56:51,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:56:51,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:51,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:56:51,831 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:56:51,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 18:56:51,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-03-16 18:56:51,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-03-16 18:56:51,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:56:51,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:51,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-16 18:56:51,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:56:51,935 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-03-16 18:56:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-16 18:56:52,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:56:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2025-03-16 18:56:53,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860942593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:56:53,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:56:53,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 39 [2025-03-16 18:56:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951895565] [2025-03-16 18:56:53,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:56:53,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 18:56:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:53,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 18:56:53,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1277, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 18:56:53,432 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 39 states, 30 states have (on average 1.8) internal successors, (54), 33 states have internal predecessors, (54), 15 states have call successors, (18), 7 states have call predecessors, (18), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2025-03-16 18:56:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:56:53,823 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-16 18:56:53,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-16 18:56:53,824 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 30 states have (on average 1.8) internal successors, (54), 33 states have internal predecessors, (54), 15 states have call successors, (18), 7 states have call predecessors, (18), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) Word has length 103 [2025-03-16 18:56:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:56:53,824 INFO L225 Difference]: With dead ends: 70 [2025-03-16 18:56:53,825 INFO L226 Difference]: Without dead ends: 39 [2025-03-16 18:56:53,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=390, Invalid=2160, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 18:56:53,828 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 62 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:56:53,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 115 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:56:53,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-16 18:56:53,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-16 18:56:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-16 18:56:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-03-16 18:56:53,839 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 103 [2025-03-16 18:56:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:56:53,840 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-03-16 18:56:53,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 30 states have (on average 1.8) internal successors, (54), 33 states have internal predecessors, (54), 15 states have call successors, (18), 7 states have call predecessors, (18), 15 states have return successors, (22), 16 states have call predecessors, (22), 15 states have call successors, (22) [2025-03-16 18:56:53,840 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-03-16 18:56:53,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-16 18:56:53,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:56:53,843 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 20, 20, 20, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:56:53,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 18:56:54,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:54,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:56:54,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:56:54,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1841774827, now seen corresponding path program 3 times [2025-03-16 18:56:54,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:56:54,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637030208] [2025-03-16 18:56:54,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:56:54,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:56:54,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 154 statements into 18 equivalence classes. [2025-03-16 18:56:54,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 105 of 154 statements. [2025-03-16 18:56:54,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 18:56:54,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 556 proven. 44 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2025-03-16 18:56:55,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:56:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637030208] [2025-03-16 18:56:55,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637030208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:56:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035675145] [2025-03-16 18:56:55,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:56:55,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:56:55,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:56:55,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:56:55,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 18:56:55,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 154 statements into 18 equivalence classes. [2025-03-16 18:56:55,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 105 of 154 statements. [2025-03-16 18:56:55,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 18:56:55,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:56:55,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-16 18:56:55,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:56:55,769 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-03-16 18:56:56,178 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-03-16 18:56:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 524 proven. 35 refuted. 0 times theorem prover too weak. 793 trivial. 0 not checked. [2025-03-16 18:56:56,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:56:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 524 proven. 70 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-03-16 18:56:59,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035675145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:56:59,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:56:59,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 26] total 58 [2025-03-16 18:56:59,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726425068] [2025-03-16 18:56:59,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:56:59,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-16 18:56:59,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:56:59,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-16 18:56:59,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=2792, Unknown=0, NotChecked=0, Total=3306 [2025-03-16 18:56:59,956 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 58 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 50 states have internal predecessors, (71), 18 states have call successors, (24), 10 states have call predecessors, (24), 19 states have return successors, (27), 17 states have call predecessors, (27), 18 states have call successors, (27) [2025-03-16 18:57:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:57:00,726 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2025-03-16 18:57:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-16 18:57:00,727 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 50 states have internal predecessors, (71), 18 states have call successors, (24), 10 states have call predecessors, (24), 19 states have return successors, (27), 17 states have call predecessors, (27), 18 states have call successors, (27) Word has length 154 [2025-03-16 18:57:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:57:00,727 INFO L225 Difference]: With dead ends: 83 [2025-03-16 18:57:00,727 INFO L226 Difference]: Without dead ends: 46 [2025-03-16 18:57:00,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 288 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1999 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=888, Invalid=4812, Unknown=0, NotChecked=0, Total=5700 [2025-03-16 18:57:00,729 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 18:57:00,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 160 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 18:57:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-16 18:57:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-03-16 18:57:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 12 states have return successors, (14), 12 states have call predecessors, (14), 5 states have call successors, (14) [2025-03-16 18:57:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-03-16 18:57:00,736 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 154 [2025-03-16 18:57:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:57:00,736 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-03-16 18:57:00,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 50 states have internal predecessors, (71), 18 states have call successors, (24), 10 states have call predecessors, (24), 19 states have return successors, (27), 17 states have call predecessors, (27), 18 states have call successors, (27) [2025-03-16 18:57:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-03-16 18:57:00,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-16 18:57:00,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:57:00,738 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:57:00,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 18:57:00,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:57:00,939 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:57:00,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:57:00,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1144041845, now seen corresponding path program 4 times [2025-03-16 18:57:00,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:57:00,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996503387] [2025-03-16 18:57:00,940 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:57:00,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:57:00,953 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 174 statements into 2 equivalence classes. [2025-03-16 18:57:00,980 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 173 of 174 statements. [2025-03-16 18:57:00,982 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 18:57:00,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:57:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 629 proven. 337 refuted. 0 times theorem prover too weak. 880 trivial. 0 not checked. [2025-03-16 18:57:03,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:57:03,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996503387] [2025-03-16 18:57:03,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996503387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:57:03,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930264828] [2025-03-16 18:57:03,289 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:57:03,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:57:03,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:57:03,292 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:57:03,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 18:57:03,397 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 174 statements into 2 equivalence classes. [2025-03-16 18:57:03,453 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 173 of 174 statements. [2025-03-16 18:57:03,453 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 18:57:03,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:57:03,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 684 conjuncts, 145 conjuncts are in the unsatisfiable core [2025-03-16 18:57:03,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:57:03,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2025-03-16 18:57:03,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 701 proven. 114 refuted. 0 times theorem prover too weak. 1031 trivial. 0 not checked. [2025-03-16 18:57:03,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:57:04,993 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-16 18:57:04,994 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 44 treesize of output 32 [2025-03-16 18:57:05,525 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-16 18:57:05,526 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 44 treesize of output 32 [2025-03-16 18:57:05,991 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-16 18:57:05,992 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 44 treesize of output 32 [2025-03-16 18:57:06,411 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-16 18:57:06,412 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 44 treesize of output 32 [2025-03-16 18:57:06,768 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-16 18:57:06,768 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 44 treesize of output 32 [2025-03-16 18:57:07,036 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-16 18:57:07,037 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 44 treesize of output 32 [2025-03-16 18:57:07,256 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-16 18:57:07,256 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 44 treesize of output 32 [2025-03-16 18:57:07,423 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-16 18:57:07,423 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 44 treesize of output 32 [2025-03-16 18:57:07,543 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-03-16 18:57:07,543 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 44 treesize of output 32 [2025-03-16 18:57:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 580 proven. 46 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2025-03-16 18:57:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930264828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:57:08,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:57:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 14] total 33 [2025-03-16 18:57:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669791674] [2025-03-16 18:57:08,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:57:08,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-16 18:57:08,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:57:08,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-16 18:57:08,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=930, Unknown=0, NotChecked=0, Total=1056 [2025-03-16 18:57:08,105 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 33 states, 26 states have (on average 2.0) internal successors, (52), 32 states have internal predecessors, (52), 12 states have call successors, (15), 4 states have call predecessors, (15), 13 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2025-03-16 18:57:16,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-16 18:57:20,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-16 18:57:24,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-16 18:57:28,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-16 18:57:32,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_old(#memory_int#2)| c_func_to_recursive_line_21_to_21_0_~b.base) c_func_to_recursive_line_21_to_21_0_~b.offset)) (.cse1 (select (select |c_#memory_int#2| c_func_to_recursive_line_21_to_21_0_~b.base) c_func_to_recursive_line_21_to_21_0_~b.offset))) (let ((.cse2 (= (+ .cse0 1) .cse1))) (and (= 6 (select (select |c_#memory_int#2| |c_func_to_recursive_line_20_to_21_0_#in~b.base|) |c_func_to_recursive_line_20_to_21_0_#in~b.offset|)) (or (< 5 (select (select |c_old(#memory_int#2)| |c_func_to_recursive_line_21_to_21_0_#in~b.base|) |c_func_to_recursive_line_21_to_21_0_#in~b.offset|)) (forall ((|v_func_to_recursive_line_21_to_21_0_#in~b.offset_BEFORE_CALL_22| Int) (|v_func_to_recursive_line_21_to_21_0_#in~b.base_BEFORE_CALL_31| Int)) (= (select (select |c_#memory_int#2| |v_func_to_recursive_line_21_to_21_0_#in~b.base_BEFORE_CALL_31|) |v_func_to_recursive_line_21_to_21_0_#in~b.offset_BEFORE_CALL_22|) 6))) (<= .cse0 5) (forall ((|v_func_to_recursive_line_21_to_21_0_#in~b.offset_BEFORE_CALL_22| Int) (|v_func_to_recursive_line_21_to_21_0_#in~b.base_BEFORE_CALL_31| Int)) (or (= (select (select |c_#memory_int#2| |v_func_to_recursive_line_21_to_21_0_#in~b.base_BEFORE_CALL_31|) |v_func_to_recursive_line_21_to_21_0_#in~b.offset_BEFORE_CALL_22|) 6) (not (= (select (select |c_old(#memory_int#2)| |v_func_to_recursive_line_21_to_21_0_#in~b.base_BEFORE_CALL_31|) |v_func_to_recursive_line_21_to_21_0_#in~b.offset_BEFORE_CALL_22|) 6)))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#b~0#1.base|) |c_ULTIMATE.start_main_~#b~0#1.offset|) 6) (= |c_func_to_recursive_line_21_to_21_0_#in~b.offset| c_func_to_recursive_line_21_to_21_0_~b.offset) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base) (<= .cse1 6) (<= .cse1 |c_func_to_recursive_line_21_to_21_0_#t~mem4|) (= 6 (select (select |c_#memory_int#2| |c_func_to_recursive_line_21_to_21_0_#in~b.base|) |c_func_to_recursive_line_21_to_21_0_#in~b.offset|)) (or (< .cse0 5) .cse2) .cse2))) is different from false [2025-03-16 18:57:36,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_old(#memory_int#2)| |c_func_to_recursive_line_21_to_21_0_#in~b.base|) |c_func_to_recursive_line_21_to_21_0_#in~b.offset|)) (.cse1 (select (select |c_#memory_int#2| |c_func_to_recursive_line_21_to_21_0_#in~b.base|) |c_func_to_recursive_line_21_to_21_0_#in~b.offset|))) (and (or (< .cse0 5) (= (+ .cse0 1) .cse1)) (or (< 5 .cse0) (forall ((|v_func_to_recursive_line_21_to_21_0_#in~b.offset_BEFORE_CALL_22| Int) (|v_func_to_recursive_line_21_to_21_0_#in~b.base_BEFORE_CALL_31| Int)) (= (select (select |c_#memory_int#2| |v_func_to_recursive_line_21_to_21_0_#in~b.base_BEFORE_CALL_31|) |v_func_to_recursive_line_21_to_21_0_#in~b.offset_BEFORE_CALL_22|) 6))) (forall ((|v_func_to_recursive_line_21_to_21_0_#in~b.offset_BEFORE_CALL_22| Int) (|v_func_to_recursive_line_21_to_21_0_#in~b.base_BEFORE_CALL_31| Int)) (or (= (select (select |c_#memory_int#2| |v_func_to_recursive_line_21_to_21_0_#in~b.base_BEFORE_CALL_31|) |v_func_to_recursive_line_21_to_21_0_#in~b.offset_BEFORE_CALL_22|) 6) (not (= (select (select |c_old(#memory_int#2)| |v_func_to_recursive_line_21_to_21_0_#in~b.base_BEFORE_CALL_31|) |v_func_to_recursive_line_21_to_21_0_#in~b.offset_BEFORE_CALL_22|) 6)))) (<= .cse0 5) (= 6 .cse1))) is different from false [2025-03-16 18:57:37,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:57:37,312 INFO L93 Difference]: Finished difference Result 74 states and 103 transitions. [2025-03-16 18:57:37,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-16 18:57:37,313 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 2.0) internal successors, (52), 32 states have internal predecessors, (52), 12 states have call successors, (15), 4 states have call predecessors, (15), 13 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) Word has length 174 [2025-03-16 18:57:37,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:57:37,313 INFO L225 Difference]: With dead ends: 74 [2025-03-16 18:57:37,313 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 18:57:37,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 997 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=572, Invalid=3215, Unknown=3, NotChecked=242, Total=4032 [2025-03-16 18:57:37,317 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 96 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2025-03-16 18:57:37,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 194 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 384 Invalid, 4 Unknown, 59 Unchecked, 16.4s Time] [2025-03-16 18:57:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 18:57:37,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 18:57:37,318 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-03-16 18:57:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 18:57:37,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2025-03-16 18:57:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:57:37,318 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 18:57:37,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 2.0) internal successors, (52), 32 states have internal predecessors, (52), 12 states have call successors, (15), 4 states have call predecessors, (15), 13 states have return successors, (21), 11 states have call predecessors, (21), 12 states have call successors, (21) [2025-03-16 18:57:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 18:57:37,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 18:57:37,322 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 18:57:37,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 18:57:37,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:57:37,526 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1] [2025-03-16 18:57:37,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 18:57:38,232 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 18:57:38,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 06:57:38 BoogieIcfgContainer [2025-03-16 18:57:38,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 18:57:38,236 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 18:57:38,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 18:57:38,236 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 18:57:38,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:56:32" (3/4) ... [2025-03-16 18:57:38,238 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 18:57:38,243 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2025-03-16 18:57:38,243 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2025-03-16 18:57:38,245 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-16 18:57:38,245 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-16 18:57:38,245 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 18:57:38,245 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 18:57:38,299 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 18:57:38,300 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 18:57:38,300 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 18:57:38,300 INFO L158 Benchmark]: Toolchain (without parser) took 65999.29ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 123.2MB in the beginning and 332.3MB in the end (delta: -209.2MB). Peak memory consumption was 241.8MB. Max. memory is 16.1GB. [2025-03-16 18:57:38,300 INFO L158 Benchmark]: CDTParser took 1.19ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:57:38,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.62ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 112.3MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:57:38,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.84ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 110.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:57:38,301 INFO L158 Benchmark]: Boogie Preprocessor took 19.65ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 110.0MB in the end (delta: 909.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:57:38,301 INFO L158 Benchmark]: IcfgBuilder took 264.93ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 97.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 18:57:38,301 INFO L158 Benchmark]: TraceAbstraction took 65472.52ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 96.4MB in the beginning and 336.7MB in the end (delta: -240.3MB). Peak memory consumption was 216.7MB. Max. memory is 16.1GB. [2025-03-16 18:57:38,301 INFO L158 Benchmark]: Witness Printer took 63.60ms. Allocated memory is still 620.8MB. Free memory was 336.7MB in the beginning and 332.3MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:57:38,302 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.19ms. Allocated memory is still 201.3MB. Free memory is still 118.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.62ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 112.3MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.84ms. Allocated memory is still 167.8MB. Free memory was 112.3MB in the beginning and 110.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.65ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 110.0MB in the end (delta: 909.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 264.93ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 97.4MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 65472.52ms. Allocated memory was 167.8MB in the beginning and 620.8MB in the end (delta: 453.0MB). Free memory was 96.4MB in the beginning and 336.7MB in the end (delta: -240.3MB). Peak memory consumption was 216.7MB. Max. memory is 16.1GB. * Witness Printer took 63.60ms. Allocated memory is still 620.8MB. Free memory was 336.7MB in the beginning and 332.3MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * 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: 69]: 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 3 procedures, 23 locations, 32 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.7s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 21.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 790 SdHoareTripleChecker+Invalid, 21.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 59 IncrementalHoareTripleChecker+Unchecked, 689 mSDsCounter, 247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1840 IncrementalHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 247 mSolverCounterUnsat, 101 mSDtfsCounter, 1840 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1358 GetRequests, 1053 SyntacticMatches, 4 SemanticMatches, 301 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4564 ImplicationChecksByTransitivity, 24.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=7, InterpolantAutomatonStates: 146, 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, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1073 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1663 ConstructedInterpolants, 27 QuantifiedInterpolants, 7488 SizeOfPredicates, 77 NumberOfNonLiveVariables, 2298 ConjunctsInSsa, 380 ConjunctsInUnsatCore, 19 InterpolantComputations, 2 PerfectInterpolantSequences, 10572/11706 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 RESULT: Ultimate proved your program to be correct! [2025-03-16 18:57:38,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE