./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 798a7b37 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-?-798a7b3-m [2025-03-03 14:37:56,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:37:56,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:37:56,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:37:56,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:37:56,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:37:56,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:37:56,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:37:56,383 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:37:56,383 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:37:56,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:37:56,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:37:56,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:37:56,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:37:56,384 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:37:56,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:37:56,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:37:56,385 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:37:56,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:37:56,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:37:56,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:37:56,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:37:56,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:37:56,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:37:56,385 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:37:56,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:37:56,386 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:37:56,386 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:37:56,386 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:37:56,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:37:56,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:37:56,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:37:56,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:37:56,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:37:56,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:37:56,387 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:37:56,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:37:56,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:37:56,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:37:56,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:37:56,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:37:56,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:37:56,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:37:56,388 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-03 14:37:56,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:37:56,623 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:37:56,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:37:56,625 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:37:56,626 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:37:56,627 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-03 14:37:57,749 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58529307f/944a1b17f4f5444a941f36007beb2b76/FLAG4dbfcf7ec [2025-03-03 14:37:57,921 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:37:57,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2025-03-03 14:37:57,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58529307f/944a1b17f4f5444a941f36007beb2b76/FLAG4dbfcf7ec [2025-03-03 14:37:58,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58529307f/944a1b17f4f5444a941f36007beb2b76 [2025-03-03 14:37:58,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:37:58,316 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:37:58,317 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:37:58,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:37:58,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:37:58,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2913649e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58, skipping insertion in model container [2025-03-03 14:37:58,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:37:58,428 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-03 14:37:58,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:37:58,436 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:37:58,446 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-03 14:37:58,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:37:58,458 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:37:58,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58 WrapperNode [2025-03-03 14:37:58,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:37:58,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:37:58,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:37:58,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:37:58,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,481 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2025-03-03 14:37:58,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:37:58,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:37:58,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:37:58,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:37:58,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,503 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-03 14:37:58,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,504 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,511 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:37:58,515 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:37:58,516 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:37:58,516 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:37:58,517 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (1/1) ... [2025-03-03 14:37:58,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:37:58,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:37:58,545 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-03 14:37:58,550 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-03 14:37:58,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:37:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:37:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:37:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:37:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 14:37:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 14:37:58,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 14:37:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 14:37:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2025-03-03 14:37:58,569 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2025-03-03 14:37:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:37:58,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:37:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 14:37:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 14:37:58,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 14:37:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2025-03-03 14:37:58,570 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2025-03-03 14:37:58,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 14:37:58,622 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:37:58,624 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:37:58,699 INFO L1325 $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-03 14:37:58,721 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-03 14:37:58,721 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:37:58,727 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:37:58,727 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:37:58,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:37:58 BoogieIcfgContainer [2025-03-03 14:37:58,728 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:37:58,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:37:58,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:37:58,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:37:58,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:37:58" (1/3) ... [2025-03-03 14:37:58,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1963283a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:37:58, skipping insertion in model container [2025-03-03 14:37:58,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:37:58" (2/3) ... [2025-03-03 14:37:58,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1963283a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:37:58, skipping insertion in model container [2025-03-03 14:37:58,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:37:58" (3/3) ... [2025-03-03 14:37:58,734 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2025-03-03 14:37:58,746 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:37:58,748 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_2.c that has 3 procedures, 24 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:37:58,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:37:58,791 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;@30896f8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:37:58,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:37:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 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-03 14:37:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 14:37:58,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:58,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:58,799 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:37:58,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:58,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1504494570, now seen corresponding path program 1 times [2025-03-03 14:37:58,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:58,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597798135] [2025-03-03 14:37:58,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:58,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:58,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 14:37:58,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 14:37:58,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:58,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:59,150 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-03 14:37:59,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:59,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597798135] [2025-03-03 14:37:59,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597798135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:37:59,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:37:59,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:37:59,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220938231] [2025-03-03 14:37:59,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:37:59,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:37:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:59,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:37:59,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:37:59,172 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 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.8) internal successors, (9), 5 states have internal predecessors, (9), 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-03 14:37:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:59,255 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-03-03 14:37:59,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:37:59,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-03-03 14:37:59,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:59,262 INFO L225 Difference]: With dead ends: 35 [2025-03-03 14:37:59,262 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 14:37:59,264 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-03 14:37:59,268 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 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-03 14:37:59,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:37:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 14:37:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 14:37:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 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), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 14:37:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-03 14:37:59,293 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2025-03-03 14:37:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:59,294 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-03 14:37:59,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-03 14:37:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-03 14:37:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 14:37:59,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:59,295 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:59,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:37:59,295 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:37:59,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1403001686, now seen corresponding path program 1 times [2025-03-03 14:37:59,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:59,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618869954] [2025-03-03 14:37:59,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:59,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:59,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 14:37:59,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 14:37:59,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:59,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:59,484 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-03 14:37:59,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:59,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618869954] [2025-03-03 14:37:59,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618869954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:37:59,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:37:59,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:37:59,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352576277] [2025-03-03 14:37:59,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:37:59,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:37:59,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:59,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:37:59,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:37:59,488 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03 14:37:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:59,548 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2025-03-03 14:37:59,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:37:59,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 22 [2025-03-03 14:37:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:59,549 INFO L225 Difference]: With dead ends: 43 [2025-03-03 14:37:59,549 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 14:37:59,550 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-03 14:37:59,550 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 57 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-03 14:37:59,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 57 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:37:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 14:37:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-03 14:37:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 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-03 14:37:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-03-03 14:37:59,556 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 22 [2025-03-03 14:37:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:59,556 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-03-03 14:37:59,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-03 14:37:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-03-03 14:37:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 14:37:59,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:59,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:59,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:37:59,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:37:59,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1171971531, now seen corresponding path program 1 times [2025-03-03 14:37:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845633245] [2025-03-03 14:37:59,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:59,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:59,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 14:37:59,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 14:37:59,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:59,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:59,884 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-03 14:37:59,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:37:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845633245] [2025-03-03 14:37:59,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845633245] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:37:59,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442808593] [2025-03-03 14:37:59,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:37:59,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:37:59,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:37:59,887 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-03 14:37:59,888 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-03 14:37:59,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 14:37:59,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 14:37:59,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:59,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:37:59,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 14:37:59,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:37:59,978 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-03 14:38:00,140 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-03 14:38:00,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:00,515 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-03 14:38:00,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442808593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:00,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:00,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2025-03-03 14:38:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376762769] [2025-03-03 14:38:00,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:00,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 14:38:00,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:00,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 14:38:00,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:38:00,518 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 24 states, 18 states have (on average 2.111111111111111) internal successors, (38), 20 states have internal predecessors, (38), 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-03 14:38:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:00,836 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2025-03-03 14:38:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:38:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 2.111111111111111) internal successors, (38), 20 states have internal predecessors, (38), 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 27 [2025-03-03 14:38:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:00,837 INFO L225 Difference]: With dead ends: 49 [2025-03-03 14:38:00,837 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 14:38:00,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:38:00,838 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:00,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 105 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:00,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 14:38:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-03 14:38:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 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-03 14:38:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-03 14:38:00,844 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 27 [2025-03-03 14:38:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:00,844 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-03 14:38:00,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 2.111111111111111) internal successors, (38), 20 states have internal predecessors, (38), 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-03 14:38:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-03-03 14:38:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:38:00,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:00,845 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, 1] [2025-03-03 14:38:00,851 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-03 14:38:01,050 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-03 14:38:01,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:01,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:01,051 INFO L85 PathProgramCache]: Analyzing trace with hash -488170110, now seen corresponding path program 2 times [2025-03-03 14:38:01,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:01,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173763850] [2025-03-03 14:38:01,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:01,062 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-03 14:38:01,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:38:01,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:01,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:01,599 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-03 14:38:01,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:01,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173763850] [2025-03-03 14:38:01,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173763850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:01,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629825738] [2025-03-03 14:38:01,600 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:01,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:01,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:01,602 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-03 14:38:01,604 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-03 14:38:01,646 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-03 14:38:01,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:38:01,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:01,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:01,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 14:38:01,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:01,688 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-03 14:38:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-03 14:38:01,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-03 14:38:02,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629825738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:02,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 32 [2025-03-03 14:38:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438087861] [2025-03-03 14:38:02,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:02,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 14:38:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:02,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 14:38:02,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:38:02,566 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 32 states, 24 states have (on average 2.0) internal successors, (48), 27 states have internal predecessors, (48), 13 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-03 14:38:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:02,885 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2025-03-03 14:38:02,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:38:02,885 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 2.0) internal successors, (48), 27 states have internal predecessors, (48), 13 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) Word has length 53 [2025-03-03 14:38:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:02,886 INFO L225 Difference]: With dead ends: 57 [2025-03-03 14:38:02,886 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 14:38:02,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 14:38:02,887 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:02,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 161 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 14:38:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-03 14:38:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-03 14:38:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-03 14:38:02,892 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 53 [2025-03-03 14:38:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:02,892 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-03 14:38:02,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 2.0) internal successors, (48), 27 states have internal predecessors, (48), 13 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (17), 11 states have call predecessors, (17), 13 states have call successors, (17) [2025-03-03 14:38:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-03 14:38:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:38:02,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:02,894 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:02,900 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-03 14:38:03,094 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-03 14:38:03,094 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:03,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1751379651, now seen corresponding path program 3 times [2025-03-03 14:38:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:03,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393328281] [2025-03-03 14:38:03,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:03,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:03,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 7 equivalence classes. [2025-03-03 14:38:03,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 59 of 89 statements. [2025-03-03 14:38:03,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 14:38:03,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2025-03-03 14:38:03,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393328281] [2025-03-03 14:38:03,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393328281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:03,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448613721] [2025-03-03 14:38:03,427 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:03,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:03,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:03,431 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-03 14:38:03,433 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-03 14:38:03,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 89 statements into 7 equivalence classes. [2025-03-03 14:38:03,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 59 of 89 statements. [2025-03-03 14:38:03,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 14:38:03,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:03,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-03 14:38:03,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:03,531 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-03 14:38:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-03 14:38:03,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-03 14:38:04,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448613721] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:04,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:04,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 18] total 36 [2025-03-03 14:38:04,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529236694] [2025-03-03 14:38:04,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:04,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 14:38:04,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:04,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 14:38:04,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1069, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:38:04,720 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 36 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 14 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (18), 16 states have call predecessors, (18), 14 states have call successors, (18) [2025-03-03 14:38:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:04,999 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-03 14:38:04,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:38:04,999 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 14 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (18), 16 states have call predecessors, (18), 14 states have call successors, (18) Word has length 89 [2025-03-03 14:38:04,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:05,000 INFO L225 Difference]: With dead ends: 39 [2025-03-03 14:38:05,000 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 14:38:05,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=326, Invalid=1566, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 14:38:05,002 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:05,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 100 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 14:38:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-03 14:38:05,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 4 states have call successors, (4), 2 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-03 14:38:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-03-03 14:38:05,010 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 89 [2025-03-03 14:38:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:05,012 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-03-03 14:38:05,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 30 states have internal predecessors, (48), 14 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (18), 16 states have call predecessors, (18), 14 states have call successors, (18) [2025-03-03 14:38:05,012 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-03-03 14:38:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:38:05,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:05,013 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:38:05,020 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-03 14:38:05,213 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-03 14:38:05,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:05,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:05,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1146915985, now seen corresponding path program 1 times [2025-03-03 14:38:05,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:05,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547580088] [2025-03-03 14:38:05,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:05,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:05,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:38:05,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:38:05,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:05,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:05,850 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 12 proven. 243 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2025-03-03 14:38:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547580088] [2025-03-03 14:38:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547580088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329584060] [2025-03-03 14:38:05,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:38:05,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:05,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:05,854 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-03 14:38:05,856 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-03 14:38:05,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:38:05,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:38:05,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:38:05,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:05,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-03 14:38:05,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:06,028 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-03 14:38:06,217 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 236 proven. 15 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2025-03-03 14:38:06,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 236 proven. 27 refuted. 0 times theorem prover too weak. 341 trivial. 0 not checked. [2025-03-03 14:38:07,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329584060] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:07,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:07,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 18] total 36 [2025-03-03 14:38:07,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105143328] [2025-03-03 14:38:07,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:07,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 14:38:07,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:07,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 14:38:07,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:38:07,907 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 36 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 31 states have internal predecessors, (53), 13 states have call successors, (18), 7 states have call predecessors, (18), 11 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) [2025-03-03 14:38:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:08,140 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2025-03-03 14:38:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:38:08,141 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 31 states have internal predecessors, (53), 13 states have call successors, (18), 7 states have call predecessors, (18), 11 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) Word has length 115 [2025-03-03 14:38:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:08,141 INFO L225 Difference]: With dead ends: 69 [2025-03-03 14:38:08,143 INFO L226 Difference]: Without dead ends: 38 [2025-03-03 14:38:08,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=337, Invalid=1469, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:38:08,144 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:08,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 206 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-03 14:38:08,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-03 14:38:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 4 states have call successors, (4), 2 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-03 14:38:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-03-03 14:38:08,150 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 115 [2025-03-03 14:38:08,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:08,151 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-03-03 14:38:08,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 31 states have internal predecessors, (53), 13 states have call successors, (18), 7 states have call predecessors, (18), 11 states have return successors, (22), 10 states have call predecessors, (22), 13 states have call successors, (22) [2025-03-03 14:38:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-03-03 14:38:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-03 14:38:08,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:08,152 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, 1] [2025-03-03 14:38:08,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:38:08,357 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-03 14:38:08,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:08,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:08,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2066942673, now seen corresponding path program 2 times [2025-03-03 14:38:08,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662129241] [2025-03-03 14:38:08,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:08,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-03-03 14:38:08,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:38:08,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:08,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 16 proven. 551 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2025-03-03 14:38:09,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:09,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662129241] [2025-03-03 14:38:09,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662129241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:09,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831327369] [2025-03-03 14:38:09,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:38:09,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:09,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:09,272 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-03 14:38:09,281 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-03 14:38:09,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-03-03 14:38:09,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 155 of 155 statements. [2025-03-03 14:38:09,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:38:09,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:09,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-03 14:38:09,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:09,408 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-03 14:38:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 518 proven. 35 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2025-03-03 14:38:09,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 8 proven. 586 refuted. 0 times theorem prover too weak. 758 trivial. 0 not checked. [2025-03-03 14:38:11,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831327369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:11,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 26] total 43 [2025-03-03 14:38:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852268034] [2025-03-03 14:38:11,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:11,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 14:38:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:11,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 14:38:11,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=1432, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:38:11,595 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 43 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 36 states have internal predecessors, (61), 12 states have call successors, (18), 9 states have call predecessors, (18), 15 states have return successors, (26), 13 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-03 14:38:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:11,835 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2025-03-03 14:38:11,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:38:11,835 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 36 states have internal predecessors, (61), 12 states have call successors, (18), 9 states have call predecessors, (18), 15 states have return successors, (26), 13 states have call predecessors, (26), 12 states have call successors, (26) Word has length 155 [2025-03-03 14:38:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:11,836 INFO L225 Difference]: With dead ends: 75 [2025-03-03 14:38:11,836 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 14:38:11,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 289 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=533, Invalid=1917, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 14:38:11,838 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 27 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:11,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 210 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:38:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 14:38:11,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-03 14:38:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-03 14:38:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-03-03 14:38:11,842 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 155 [2025-03-03 14:38:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:11,842 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-03-03 14:38:11,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 36 states have internal predecessors, (61), 12 states have call successors, (18), 9 states have call predecessors, (18), 15 states have return successors, (26), 13 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-03 14:38:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-03-03 14:38:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-03 14:38:11,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:38:11,844 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, 1] [2025-03-03 14:38:11,850 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-03 14:38:12,044 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-03 14:38:12,045 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:38:12,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:38:12,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1229798611, now seen corresponding path program 3 times [2025-03-03 14:38:12,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:38:12,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383796861] [2025-03-03 14:38:12,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:12,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:38:12,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 175 statements into 20 equivalence classes. [2025-03-03 14:38:12,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 154 of 175 statements. [2025-03-03 14:38:12,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-03 14:38:12,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 602 proven. 24 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2025-03-03 14:38:12,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:38:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383796861] [2025-03-03 14:38:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383796861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:38:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759027231] [2025-03-03 14:38:12,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:38:12,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:38:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:38:12,702 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-03 14:38:12,704 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-03 14:38:12,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 175 statements into 20 equivalence classes. [2025-03-03 14:38:13,449 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 154 of 175 statements. [2025-03-03 14:38:13,449 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-03-03 14:38:13,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:38:13,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-03 14:38:13,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:38:13,470 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-03 14:38:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1822 trivial. 0 not checked. [2025-03-03 14:38:13,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:38:15,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2025-03-03 14:38:15,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759027231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:38:15,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:38:15,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 22] total 43 [2025-03-03 14:38:15,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526938427] [2025-03-03 14:38:15,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:38:15,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 14:38:15,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:38:15,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 14:38:15,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1557, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:38:15,214 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 43 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 37 states have internal predecessors, (60), 17 states have call successors, (19), 8 states have call predecessors, (19), 15 states have return successors, (23), 19 states have call predecessors, (23), 17 states have call successors, (23) [2025-03-03 14:38:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:38:15,682 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2025-03-03 14:38:15,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:38:15,682 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 37 states have internal predecessors, (60), 17 states have call successors, (19), 8 states have call predecessors, (19), 15 states have return successors, (23), 19 states have call predecessors, (23), 17 states have call successors, (23) Word has length 175 [2025-03-03 14:38:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:38:15,683 INFO L225 Difference]: With dead ends: 45 [2025-03-03 14:38:15,683 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:38:15,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=527, Invalid=3013, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 14:38:15,684 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:38:15,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 67 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:38:15,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:38:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:38:15,685 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-03 14:38:15,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:38:15,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2025-03-03 14:38:15,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:38:15,685 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:38:15,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 37 states have internal predecessors, (60), 17 states have call successors, (19), 8 states have call predecessors, (19), 15 states have return successors, (23), 19 states have call predecessors, (23), 17 states have call successors, (23) [2025-03-03 14:38:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:38:15,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:38:15,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:38:15,696 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-03 14:38:15,888 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-03 14:38:15,890 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2025-03-03 14:38:15,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:38:16,235 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:38:16,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:38:16 BoogieIcfgContainer [2025-03-03 14:38:16,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:38:16,241 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:38:16,241 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:38:16,241 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:38:16,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:37:58" (3/4) ... [2025-03-03 14:38:16,242 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 14:38:16,246 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2025-03-03 14:38:16,246 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2025-03-03 14:38:16,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-03 14:38:16,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-03 14:38:16,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 14:38:16,248 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 14:38:16,298 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:38:16,298 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:38:16,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:38:16,298 INFO L158 Benchmark]: Toolchain (without parser) took 17982.65ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 113.5MB in the beginning and 288.2MB in the end (delta: -174.6MB). Peak memory consumption was 318.4MB. Max. memory is 16.1GB. [2025-03-03 14:38:16,298 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:38:16,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.48ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 103.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:38:16,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.10ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:38:16,299 INFO L158 Benchmark]: Boogie Preprocessor took 31.40ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:38:16,299 INFO L158 Benchmark]: IcfgBuilder took 212.68ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 88.7MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 14:38:16,299 INFO L158 Benchmark]: TraceAbstraction took 17510.69ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 87.7MB in the beginning and 292.5MB in the end (delta: -204.7MB). Peak memory consumption was 284.8MB. Max. memory is 16.1GB. [2025-03-03 14:38:16,299 INFO L158 Benchmark]: Witness Printer took 57.40ms. Allocated memory is still 637.5MB. Free memory was 292.5MB in the beginning and 288.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:38:16,300 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 142.48ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 103.0MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.10ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.40ms. Allocated memory is still 142.6MB. Free memory was 101.5MB in the beginning and 100.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 212.68ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 88.7MB in the end (delta: 11.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17510.69ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 87.7MB in the beginning and 292.5MB in the end (delta: -204.7MB). Peak memory consumption was 284.8MB. Max. memory is 16.1GB. * Witness Printer took 57.40ms. Allocated memory is still 637.5MB. Free memory was 292.5MB in the beginning and 288.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. 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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 964 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 856 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1642 IncrementalHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 108 mSDtfsCounter, 1642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1403 GetRequests, 1127 SyntacticMatches, 6 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3495 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=7, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 1261 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 1855 ConstructedInterpolants, 0 QuantifiedInterpolants, 7393 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2518 ConjunctsInSsa, 362 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 10978/12676 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-03 14:38:16,313 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