./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_geo1-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_geo1-ll.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4db0bca5538daf39b8ff60992164692d97581cce14eb7bcb8400899fae1cb0e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:11:50,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:11:50,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:11:50,832 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:11:50,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:11:50,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:11:50,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:11:50,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:11:50,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:11:50,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:11:50,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:11:50,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:11:50,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:11:50,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:11:50,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:11:50,858 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:11:50,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:11:50,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:11:50,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:11:50,859 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4db0bca5538daf39b8ff60992164692d97581cce14eb7bcb8400899fae1cb0e3 [2025-01-09 04:11:51,050 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:11:51,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:11:51,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:11:51,060 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:11:51,060 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:11:51,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_geo1-ll.c [2025-01-09 04:11:52,173 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74038d2a6/693e2c7d9d4745558041f0744a6941d1/FLAG111587685 [2025-01-09 04:11:52,394 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:11:52,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_geo1-ll.c [2025-01-09 04:11:52,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74038d2a6/693e2c7d9d4745558041f0744a6941d1/FLAG111587685 [2025-01-09 04:11:52,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74038d2a6/693e2c7d9d4745558041f0744a6941d1 [2025-01-09 04:11:52,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:11:52,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:11:52,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:11:52,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:11:52,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:11:52,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd7d527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52, skipping insertion in model container [2025-01-09 04:11:52,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,758 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:11:52,858 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_geo1-ll.c[1076,1089] [2025-01-09 04:11:52,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:11:52,881 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:11:52,890 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_geo1-ll.c[1076,1089] [2025-01-09 04:11:52,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:11:52,910 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:11:52,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52 WrapperNode [2025-01-09 04:11:52,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:11:52,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:11:52,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:11:52,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:11:52,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,936 INFO L138 Inliner]: procedures = 16, calls = 55, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2025-01-09 04:11:52,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:11:52,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:11:52,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:11:52,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:11:52,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,961 INFO L175 MemorySlicer]: Split 29 memory accesses to 6 slices as follows [2, 4, 3, 7, 5, 8]. 28 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 2, 1, 1, 2, 3]. [2025-01-09 04:11:52,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:11:52,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:11:52,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:11:52,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:11:52,980 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (1/1) ... [2025-01-09 04:11:52,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:11:52,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:11:53,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 04:11:53,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 04:11:53,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:11:53,027 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 04:11:53,027 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 04:11:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:11:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:11:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:11:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:11:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:11:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 04:11:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 04:11:53,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:11:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:11:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:11:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:11:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:11:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 04:11:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_30_to_38_0 [2025-01-09 04:11:53,029 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_30_to_38_0 [2025-01-09 04:11:53,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:11:53,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:11:53,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:11:53,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:11:53,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:11:53,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:11:53,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:11:53,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 04:11:53,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 04:11:53,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 04:11:53,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 04:11:53,113 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:11:53,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:11:53,249 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 04:11:53,249 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:11:53,255 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:11:53,256 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 04:11:53,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:11:53 BoogieIcfgContainer [2025-01-09 04:11:53,256 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:11:53,258 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:11:53,258 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:11:53,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:11:53,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:11:52" (1/3) ... [2025-01-09 04:11:53,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ac6fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:11:53, skipping insertion in model container [2025-01-09 04:11:53,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:11:52" (2/3) ... [2025-01-09 04:11:53,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ac6fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:11:53, skipping insertion in model container [2025-01-09 04:11:53,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:11:53" (3/3) ... [2025-01-09 04:11:53,264 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_geo1-ll.c [2025-01-09 04:11:53,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:11:53,277 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_geo1-ll.c that has 4 procedures, 31 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:11:53,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:11:53,323 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;@468ab3fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:11:53,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:11:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 04:11:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 04:11:53,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:11:53,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:11:53,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:11:53,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:11:53,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1816649915, now seen corresponding path program 1 times [2025-01-09 04:11:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:11:53,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009921822] [2025-01-09 04:11:53,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:11:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:11:53,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 04:11:53,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 04:11:53,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:11:53,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:11:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:11:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009921822] [2025-01-09 04:11:53,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009921822] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:11:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248419203] [2025-01-09 04:11:53,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:11:53,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:53,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:11:53,513 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:11:53,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 04:11:53,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 04:11:53,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 04:11:53,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:11:53,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:53,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 04:11:53,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:11:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:11:53,645 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:11:53,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248419203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:11:53,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:11:53,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 04:11:53,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819890149] [2025-01-09 04:11:53,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:11:53,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:11:53,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:11:53,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:11:53,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:11:53,670 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:11:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:11:53,686 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2025-01-09 04:11:53,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:11:53,688 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-01-09 04:11:53,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:11:53,692 INFO L225 Difference]: With dead ends: 59 [2025-01-09 04:11:53,692 INFO L226 Difference]: Without dead ends: 27 [2025-01-09 04:11:53,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:11:53,697 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:11:53,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:11:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-09 04:11:53,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-01-09 04:11:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 04:11:53,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-01-09 04:11:53,726 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2025-01-09 04:11:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:11:53,726 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-01-09 04:11:53,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:11:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-01-09 04:11:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 04:11:53,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:11:53,727 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:11:53,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:11:53,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 04:11:53,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:11:53,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:11:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1591034057, now seen corresponding path program 1 times [2025-01-09 04:11:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:11:53,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440622691] [2025-01-09 04:11:53,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:11:53,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:11:53,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 04:11:53,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 04:11:53,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:11:53,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 04:11:53,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312130657] [2025-01-09 04:11:53,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:11:53,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:53,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:11:53,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:11:53,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 04:11:54,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 04:11:54,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 04:11:54,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:11:54,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:54,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 04:11:54,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:11:54,133 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-01-09 04:11:54,174 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-01-09 04:11:54,180 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 11 [2025-01-09 04:11:54,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 04:11:54,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 04:11:54,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:11:54,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:11:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:11:54,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:11:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440622691] [2025-01-09 04:11:54,512 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 04:11:54,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312130657] [2025-01-09 04:11:54,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312130657] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 04:11:54,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:11:54,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2025-01-09 04:11:54,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66787467] [2025-01-09 04:11:54,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:11:54,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 04:11:54,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:11:54,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 04:11:54,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-01-09 04:11:54,513 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:11:59,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-01-09 04:11:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:11:59,541 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2025-01-09 04:11:59,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:11:59,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-01-09 04:11:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:11:59,543 INFO L225 Difference]: With dead ends: 41 [2025-01-09 04:11:59,543 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 04:11:59,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-01-09 04:11:59,544 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:11:59,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 141 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2025-01-09 04:11:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 04:11:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2025-01-09 04:11:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-09 04:11:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2025-01-09 04:11:59,552 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2025-01-09 04:11:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:11:59,552 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2025-01-09 04:11:59,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 04:11:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2025-01-09 04:11:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 04:11:59,553 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:11:59,553 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:11:59,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:11:59,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:59,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:11:59,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:11:59,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1318146784, now seen corresponding path program 1 times [2025-01-09 04:11:59,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:11:59,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873310507] [2025-01-09 04:11:59,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:11:59,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:11:59,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 04:11:59,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 04:11:59,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:11:59,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 04:11:59,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885411771] [2025-01-09 04:11:59,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:11:59,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:11:59,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:11:59,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:11:59,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 04:11:59,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 04:11:59,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 04:11:59,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:11:59,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:11:59,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-01-09 04:11:59,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:11:59,955 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-01-09 04:12:00,039 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-01-09 04:12:00,047 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 11 [2025-01-09 04:12:00,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 04:12:00,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-01-09 04:12:00,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-01-09 04:12:00,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2025-01-09 04:12:00,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2025-01-09 04:12:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:12:00,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:12:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:12:09,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:12:09,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873310507] [2025-01-09 04:12:09,102 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 04:12:09,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885411771] [2025-01-09 04:12:09,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885411771] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:12:09,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:12:09,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10] total 26 [2025-01-09 04:12:09,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980824361] [2025-01-09 04:12:09,102 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:12:09,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 04:12:09,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:12:09,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 04:12:09,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=571, Unknown=2, NotChecked=0, Total=650 [2025-01-09 04:12:09,103 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 26 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 19 states have internal predecessors, (39), 11 states have call successors, (12), 9 states have call predecessors, (12), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 04:12:13,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 04:12:25,039 WARN L286 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 04:12:33,226 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 04:12:45,716 WARN L286 SmtUtils]: Spent 12.28s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 04:12:49,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 04:13:01,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 04:13:13,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-01-09 04:13:17,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]