./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps3-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_nla-digbench/recursified_ps3-ll.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 e4b995352c2aa614292d7ca8e2ab060aead2140bac61fbd718d54a02f08e13c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:51:28,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:51:28,997 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:51:29,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:51:29,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:51:29,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:51:29,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:51:29,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:51:29,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:51:29,021 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:51:29,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:51:29,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:51:29,022 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:51:29,022 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:51:29,022 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:51:29,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:51:29,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:51:29,023 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:51:29,023 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:51:29,023 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:51:29,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:51:29,023 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:51:29,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:51:29,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:51:29,023 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:51:29,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:51:29,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:51:29,024 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:51:29,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:51:29,024 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 -> e4b995352c2aa614292d7ca8e2ab060aead2140bac61fbd718d54a02f08e13c4 [2025-03-08 05:51:29,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:51:29,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:51:29,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:51:29,241 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:51:29,241 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:51:29,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps3-ll.c [2025-03-08 05:51:30,345 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4eeb1c8/76cdef353acb4af394ea88cb8a6af3c4/FLAG238992a33 [2025-03-08 05:51:30,537 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:51:30,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_ps3-ll.c [2025-03-08 05:51:30,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4eeb1c8/76cdef353acb4af394ea88cb8a6af3c4/FLAG238992a33 [2025-03-08 05:51:30,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a4eeb1c8/76cdef353acb4af394ea88cb8a6af3c4 [2025-03-08 05:51:30,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:51:30,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:51:30,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:51:30,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:51:30,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:51:30,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1998856b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30, skipping insertion in model container [2025-03-08 05:51:30,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:51:30,702 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_nla-digbench/recursified_ps3-ll.c[987,1000] [2025-03-08 05:51:30,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:51:30,725 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:51:30,732 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_nla-digbench/recursified_ps3-ll.c[987,1000] [2025-03-08 05:51:30,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:51:30,751 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:51:30,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30 WrapperNode [2025-03-08 05:51:30,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:51:30,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:51:30,754 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:51:30,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:51:30,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,763 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,774 INFO L138 Inliner]: procedures = 16, calls = 51, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-03-08 05:51:30,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:51:30,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:51:30,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:51:30,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:51:30,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,796 INFO L175 MemorySlicer]: Split 30 memory accesses to 5 slices as follows [2, 2, 5, 17, 4]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 7 writes are split as follows [0, 1, 2, 2, 2]. [2025-03-08 05:51:30,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,797 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:51:30,807 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:51:30,807 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:51:30,807 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:51:30,808 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (1/1) ... [2025-03-08 05:51:30,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:51:30,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:30,835 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-08 05:51:30,836 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-08 05:51:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:51:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:51:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:51:30,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:51:30,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 05:51:30,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 05:51:30,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 05:51:30,854 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_34_0 [2025-03-08 05:51:30,854 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_34_0 [2025-03-08 05:51:30,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 05:51:30,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 05:51:30,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 05:51:30,916 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:51:30,918 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:51:31,001 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L73: call ULTIMATE.dealloc(main_~#k~0#1.base, main_~#k~0#1.offset);havoc main_~#k~0#1.base, main_~#k~0#1.offset;call ULTIMATE.dealloc(main_~#y~0#1.base, main_~#y~0#1.offset);havoc main_~#y~0#1.base, main_~#y~0#1.offset;call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset; [2025-03-08 05:51:31,044 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2025-03-08 05:51:31,045 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:51:31,053 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:51:31,053 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:51:31,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:51:31 BoogieIcfgContainer [2025-03-08 05:51:31,054 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:51:31,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:51:31,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:51:31,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:51:31,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:51:30" (1/3) ... [2025-03-08 05:51:31,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb6610e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:51:31, skipping insertion in model container [2025-03-08 05:51:31,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:51:30" (2/3) ... [2025-03-08 05:51:31,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb6610e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:51:31, skipping insertion in model container [2025-03-08 05:51:31,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:51:31" (3/3) ... [2025-03-08 05:51:31,061 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_ps3-ll.c [2025-03-08 05:51:31,072 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:51:31,074 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps3-ll.c that has 3 procedures, 23 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-08 05:51:31,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:51:31,124 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;@3ef25a8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:51:31,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:51:31,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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-08 05:51:31,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 05:51:31,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:31,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:51:31,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:31,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1928012302, now seen corresponding path program 1 times [2025-03-08 05:51:31,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:31,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369944558] [2025-03-08 05:51:31,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:31,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 05:51:31,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 05:51:31,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:31,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:51:31,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [958864501] [2025-03-08 05:51:31,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:31,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:31,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:31,242 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-08 05:51:31,243 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-08 05:51:31,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 05:51:31,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 05:51:31,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:31,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:31,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 05:51:31,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:31,386 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-08 05:51:31,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 05:51:31,530 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-08 05:51:31,530 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:51:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:51:31,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369944558] [2025-03-08 05:51:31,532 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:51:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958864501] [2025-03-08 05:51:31,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958864501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:51:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:51:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:51:31,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283738514] [2025-03-08 05:51:31,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:51:31,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:51:31,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:51:31,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:51:31,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:51:31,552 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:51:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:51:31,689 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2025-03-08 05:51:31,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:51:31,691 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 05:51:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:51:31,696 INFO L225 Difference]: With dead ends: 55 [2025-03-08 05:51:31,696 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 05:51:31,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:51:31,700 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:51:31,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:51:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 05:51:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-08 05:51:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-08 05:51:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2025-03-08 05:51:31,729 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 9 [2025-03-08 05:51:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:51:31,729 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-03-08 05:51:31,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:51:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2025-03-08 05:51:31,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 05:51:31,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:31,731 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:51:31,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:51:31,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:51:31,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:31,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:31,936 INFO L85 PathProgramCache]: Analyzing trace with hash 658125928, now seen corresponding path program 1 times [2025-03-08 05:51:31,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:31,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302703817] [2025-03-08 05:51:31,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:31,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:31,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:51:31,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:51:31,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:31,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:51:31,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [365359354] [2025-03-08 05:51:32,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:32,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:32,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:32,002 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-08 05:51:32,002 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-08 05:51:32,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:51:32,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:51:32,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:32,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:32,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-08 05:51:32,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:32,108 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-08 05:51:32,111 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-08 05:51:32,209 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 29 treesize of output 21 [2025-03-08 05:51:32,217 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 19 treesize of output 11 [2025-03-08 05:51:32,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:51:32,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:51:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 05:51:32,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:51:32,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302703817] [2025-03-08 05:51:32,485 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:51:32,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365359354] [2025-03-08 05:51:32,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365359354] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:51:32,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 05:51:32,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-03-08 05:51:32,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642433854] [2025-03-08 05:51:32,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 05:51:32,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 05:51:32,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:51:32,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 05:51:32,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:51:32,489 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:51:32,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:51:32,809 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2025-03-08 05:51:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 05:51:32,810 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-03-08 05:51:32,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:51:32,815 INFO L225 Difference]: With dead ends: 58 [2025-03-08 05:51:32,815 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 05:51:32,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-03-08 05:51:32,816 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 50 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:51:32,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 125 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:51:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 05:51:32,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2025-03-08 05:51:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.103448275862069) internal successors, (32), 31 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-08 05:51:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-03-08 05:51:32,827 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 19 [2025-03-08 05:51:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:51:32,828 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-03-08 05:51:32,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 7 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:51:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-03-08 05:51:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 05:51:32,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:32,829 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:51:32,835 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-08 05:51:33,033 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,SelfDestructingSolverStorable1 [2025-03-08 05:51:33,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:33,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:33,034 INFO L85 PathProgramCache]: Analyzing trace with hash 598526318, now seen corresponding path program 1 times [2025-03-08 05:51:33,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:33,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686189785] [2025-03-08 05:51:33,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:33,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:33,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:51:33,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:51:33,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:33,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:51:33,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2016203816] [2025-03-08 05:51:33,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:33,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:33,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:33,080 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-08 05:51:33,081 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-08 05:51:33,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 05:51:33,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 05:51:33,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:33,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:33,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 05:51:33,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:33,146 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-08 05:51:33,150 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-08 05:51:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:51:33,216 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:51:33,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:51:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686189785] [2025-03-08 05:51:33,216 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:51:33,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016203816] [2025-03-08 05:51:33,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016203816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:51:33,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:51:33,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:51:33,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277116467] [2025-03-08 05:51:33,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:51:33,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:51:33,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:51:33,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:51:33,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:51:33,217 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:51:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:51:33,292 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-08 05:51:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:51:33,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-03-08 05:51:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:51:33,294 INFO L225 Difference]: With dead ends: 52 [2025-03-08 05:51:33,294 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 05:51:33,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:51:33,295 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:51:33,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:51:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 05:51:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-08 05:51:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-08 05:51:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-08 05:51:33,310 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 19 [2025-03-08 05:51:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:51:33,310 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-08 05:51:33,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 05:51:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-08 05:51:33,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 05:51:33,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:33,311 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:51:33,317 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-08 05:51:33,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:33,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:33,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1478484312, now seen corresponding path program 1 times [2025-03-08 05:51:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:33,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184082700] [2025-03-08 05:51:33,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:33,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:33,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 05:51:33,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 05:51:33,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:33,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:51:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145788223] [2025-03-08 05:51:33,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:51:33,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:33,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:33,573 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-08 05:51:33,575 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-08 05:51:33,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 05:51:33,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 05:51:33,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:51:33,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:33,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 05:51:33,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:33,665 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-08 05:51:33,669 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-08 05:51:33,808 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 19 treesize of output 11 [2025-03-08 05:51:33,812 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 19 treesize of output 11 [2025-03-08 05:51:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 05:51:33,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:51:34,223 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 46 treesize of output 22 [2025-03-08 05:51:34,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2025-03-08 05:51:34,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:51:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184082700] [2025-03-08 05:51:34,443 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:51:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145788223] [2025-03-08 05:51:34,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145788223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:51:34,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:51:34,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2025-03-08 05:51:34,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654712134] [2025-03-08 05:51:34,443 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 05:51:34,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:51:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:51:34,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:51:34,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:51:34,444 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:51:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:51:34,619 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-03-08 05:51:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:51:34,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2025-03-08 05:51:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:51:34,620 INFO L225 Difference]: With dead ends: 50 [2025-03-08 05:51:34,621 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 05:51:34,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-03-08 05:51:34,622 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:51:34,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:51:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 05:51:34,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 05:51:34,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-08 05:51:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-03-08 05:51:34,635 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 31 [2025-03-08 05:51:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:51:34,635 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-08 05:51:34,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 05:51:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-03-08 05:51:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 05:51:34,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:51:34,636 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:51:34,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:51:34,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:34,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:51:34,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:51:34,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1606801982, now seen corresponding path program 2 times [2025-03-08 05:51:34,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:51:34,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528014095] [2025-03-08 05:51:34,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:51:34,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:51:34,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-08 05:51:34,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:51:34,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:51:34,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:51:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260090375] [2025-03-08 05:51:34,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:51:34,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:51:34,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:51:34,904 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-08 05:51:34,905 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-08 05:51:34,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-08 05:51:35,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 05:51:35,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:51:35,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:51:35,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-03-08 05:51:35,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:51:35,025 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-08 05:51:35,030 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-08 05:51:35,248 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 27 treesize of output 19 [2025-03-08 05:51:35,525 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 19 treesize of output 11 [2025-03-08 05:51:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:51:35,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:51:36,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 05:51:36,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 344 treesize of output 343 [2025-03-08 05:51:44,779 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#3| c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse0 (select .cse2 c_func_to_recursive_line_26_to_34_0_~y.offset))) (or (not (= (mod (+ (* 3 .cse0 .cse0) .cse0 (* 2 .cse0 .cse0 .cse0)) 6) 0)) (and (= (let ((.cse1 (select (select (store |c_#memory_int#3| c_func_to_recursive_line_26_to_34_0_~y.base (store .cse2 c_func_to_recursive_line_26_to_34_0_~y.offset (+ .cse0 1))) |c_func_to_recursive_line_26_to_34_0_#in~y.base|) |c_func_to_recursive_line_26_to_34_0_#in~y.offset|))) (+ (* (* .cse1 .cse1) 3) .cse1 (* 2 (* .cse1 .cse1 .cse1)))) (+ (* 9 (* .cse0 .cse0)) (* .cse0 13) 6 (* 2 (* .cse0 .cse0 .cse0)))) (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| c_func_to_recursive_line_26_to_34_0_~x.base) (= c_func_to_recursive_line_26_to_34_0_~x.offset |c_func_to_recursive_line_26_to_34_0_#in~x.offset|))))) is different from false [2025-03-08 05:51:56,829 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 05:52:00,848 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (let ((.cse0 (select .cse3 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|))) (and (or (= (mod (+ (* 3 .cse0 .cse0) .cse0 (* 2 .cse0 .cse0 .cse0)) 6) 0) (forall ((|v_func_to_recursive_line_26_to_34_0_#in~x.offset_BEFORE_CALL_9| Int) (|v_func_to_recursive_line_26_to_34_0_#in~y.base_BEFORE_CALL_9| Int) (|v_func_to_recursive_line_26_to_34_0_#in~x.base_BEFORE_CALL_9| Int) (|v_func_to_recursive_line_26_to_34_0_#in~y.offset_BEFORE_CALL_9| Int)) (= (* (select (select |c_#memory_int#2| |v_func_to_recursive_line_26_to_34_0_#in~x.base_BEFORE_CALL_9|) |v_func_to_recursive_line_26_to_34_0_#in~x.offset_BEFORE_CALL_9|) 6) (let ((.cse1 (select (select |c_#memory_int#3| |v_func_to_recursive_line_26_to_34_0_#in~y.base_BEFORE_CALL_9|) |v_func_to_recursive_line_26_to_34_0_#in~y.offset_BEFORE_CALL_9|))) (+ (* (* .cse1 .cse1) 3) (* 2 (* .cse1 .cse1 .cse1)) .cse1))))) (forall ((|v_func_to_recursive_line_26_to_34_0_#in~y.base_BEFORE_CALL_9| Int) (|v_func_to_recursive_line_26_to_34_0_#in~y.offset_BEFORE_CALL_9| Int)) (or (not (= (+ (* .cse0 13) 6 (* (* .cse0 .cse0 .cse0) 2) (* 9 (* .cse0 .cse0))) (let ((.cse2 (select (select (store |c_old(#memory_int#3)| |c_func_to_recursive_line_26_to_34_0_#in~y.base| (store .cse3 |c_func_to_recursive_line_26_to_34_0_#in~y.offset| (+ .cse0 1))) |v_func_to_recursive_line_26_to_34_0_#in~y.base_BEFORE_CALL_9|) |v_func_to_recursive_line_26_to_34_0_#in~y.offset_BEFORE_CALL_9|))) (+ .cse2 (* (* .cse2 .cse2) 3) (* 2 (* .cse2 .cse2 .cse2)))))) (= (let ((.cse4 (select (select |c_#memory_int#3| |v_func_to_recursive_line_26_to_34_0_#in~y.base_BEFORE_CALL_9|) |v_func_to_recursive_line_26_to_34_0_#in~y.offset_BEFORE_CALL_9|))) (+ (* (* .cse4 .cse4) 3) (* 2 (* .cse4 .cse4 .cse4)) .cse4)) (* (select (select |c_#memory_int#2| |c_func_to_recursive_line_26_to_34_0_#in~x.base|) |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 6))))))) is different from true [2025-03-08 05:52:12,870 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 05:52:25,041 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 05:52:29,064 WARN L873 $PredicateComparison]: unable to prove that (or (not (= (* (select (select |c_#memory_int#2| c_func_to_recursive_line_26_to_34_0_~x.base) c_func_to_recursive_line_26_to_34_0_~x.offset) 6) (let ((.cse0 (select (select |c_#memory_int#3| c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (+ (* 3 (* .cse0 .cse0)) .cse0 (* 2 (* .cse0 .cse0 .cse0)))))) (let ((.cse4 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (let ((.cse1 (select .cse4 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|))) (and (or (= (mod (+ (* 3 .cse1 .cse1) .cse1 (* 2 .cse1 .cse1 .cse1)) 6) 0) (forall ((|v_func_to_recursive_line_26_to_34_0_#in~x.offset_BEFORE_CALL_9| Int) (|v_func_to_recursive_line_26_to_34_0_#in~y.base_BEFORE_CALL_9| Int) (|v_func_to_recursive_line_26_to_34_0_#in~x.base_BEFORE_CALL_9| Int) (|v_func_to_recursive_line_26_to_34_0_#in~y.offset_BEFORE_CALL_9| Int)) (= (* (select (select |c_#memory_int#2| |v_func_to_recursive_line_26_to_34_0_#in~x.base_BEFORE_CALL_9|) |v_func_to_recursive_line_26_to_34_0_#in~x.offset_BEFORE_CALL_9|) 6) (let ((.cse2 (select (select |c_#memory_int#3| |v_func_to_recursive_line_26_to_34_0_#in~y.base_BEFORE_CALL_9|) |v_func_to_recursive_line_26_to_34_0_#in~y.offset_BEFORE_CALL_9|))) (+ (* (* .cse2 .cse2) 3) (* 2 (* .cse2 .cse2 .cse2)) .cse2))))) (forall ((|v_func_to_recursive_line_26_to_34_0_#in~y.base_BEFORE_CALL_9| Int) (|v_func_to_recursive_line_26_to_34_0_#in~y.offset_BEFORE_CALL_9| Int)) (or (not (= (+ (* .cse1 13) 6 (* (* .cse1 .cse1 .cse1) 2) (* 9 (* .cse1 .cse1))) (let ((.cse3 (select (select (store |c_old(#memory_int#3)| |c_func_to_recursive_line_26_to_34_0_#in~y.base| (store .cse4 |c_func_to_recursive_line_26_to_34_0_#in~y.offset| (+ .cse1 1))) |v_func_to_recursive_line_26_to_34_0_#in~y.base_BEFORE_CALL_9|) |v_func_to_recursive_line_26_to_34_0_#in~y.offset_BEFORE_CALL_9|))) (+ .cse3 (* (* .cse3 .cse3) 3) (* 2 (* .cse3 .cse3 .cse3)))))) (= (let ((.cse5 (select (select |c_#memory_int#3| |v_func_to_recursive_line_26_to_34_0_#in~y.base_BEFORE_CALL_9|) |v_func_to_recursive_line_26_to_34_0_#in~y.offset_BEFORE_CALL_9|))) (+ (* (* .cse5 .cse5) 3) (* 2 (* .cse5 .cse5 .cse5)) .cse5)) (* (select (select |c_#memory_int#2| |c_func_to_recursive_line_26_to_34_0_#in~x.base|) |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 6)))))))) is different from true [2025-03-08 05:52:29,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:52:29,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528014095] [2025-03-08 05:52:29,066 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:52:29,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260090375] [2025-03-08 05:52:29,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260090375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:52:29,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:52:29,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2025-03-08 05:52:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193894811] [2025-03-08 05:52:29,066 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 05:52:29,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 05:52:29,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:52:29,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 05:52:29,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=536, Unknown=3, NotChecked=144, Total=756 [2025-03-08 05:52:29,069 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 21 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:52:33,402 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 [] [2025-03-08 05:52:33,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:52:33,563 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-08 05:52:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 05:52:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2025-03-08 05:52:33,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:52:33,565 INFO L225 Difference]: With dead ends: 48 [2025-03-08 05:52:33,565 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 05:52:33,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=168, Invalid=1031, Unknown=3, NotChecked=204, Total=1406 [2025-03-08 05:52:33,566 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:52:33,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 90 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 266 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2025-03-08 05:52:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 05:52:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-08 05:52:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-08 05:52:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2025-03-08 05:52:33,575 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 43 [2025-03-08 05:52:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:52:33,575 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2025-03-08 05:52:33,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 05:52:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2025-03-08 05:52:33,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 05:52:33,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:52:33,576 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:52:33,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:52:33,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:33,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:52:33,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:52:33,777 INFO L85 PathProgramCache]: Analyzing trace with hash 60552876, now seen corresponding path program 3 times [2025-03-08 05:52:33,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:52:33,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106260177] [2025-03-08 05:52:33,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:52:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:52:33,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 5 equivalence classes. [2025-03-08 05:52:33,839 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 05:52:33,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 05:52:33,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 05:52:33,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1716742179] [2025-03-08 05:52:33,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 05:52:33,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:52:33,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:52:33,846 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-08 05:52:33,848 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-08 05:52:33,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 5 equivalence classes. [2025-03-08 05:52:34,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 53 of 55 statements. [2025-03-08 05:52:34,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 05:52:34,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:52:34,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 184 conjuncts are in the unsatisfiable core [2025-03-08 05:52:34,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:52:34,359 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-08 05:52:34,365 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-08 05:52:34,369 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-08 05:52:55,385 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 19 treesize of output 11 [2025-03-08 05:52:55,389 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 19 treesize of output 11 [2025-03-08 05:52:55,514 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 49 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 05:52:55,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:53:01,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#y~0#1.base|) |c_ULTIMATE.start_main_~#y~0#1.offset|))) (let ((.cse2 (* .cse1 .cse1)) (.cse0 (* (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#x~0#1.base|) |c_ULTIMATE.start_main_~#x~0#1.offset|) 6))) (or (= .cse0 (+ (* 2 (* .cse1 .cse1 .cse1)) (* .cse2 3) .cse1)) (forall ((|v_func_to_recursive_line_26_to_34_0_#t~mem5_78| Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem6_78| Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem8_79| Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem7_80| Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem9_78| Int)) (not (= (+ (* 3 (* |v_func_to_recursive_line_26_to_34_0_#t~mem9_78| |v_func_to_recursive_line_26_to_34_0_#t~mem8_79|)) (* (* |v_func_to_recursive_line_26_to_34_0_#t~mem5_78| |v_func_to_recursive_line_26_to_34_0_#t~mem6_78| |v_func_to_recursive_line_26_to_34_0_#t~mem7_80|) 2)) (+ (* 35 .cse1) (* .cse2 12) .cse0 28))))))) is different from false [2025-03-08 05:53:01,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:53:01,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106260177] [2025-03-08 05:53:01,683 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 05:53:01,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716742179] [2025-03-08 05:53:01,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716742179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:53:01,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:53:01,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-03-08 05:53:01,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108349759] [2025-03-08 05:53:01,683 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 05:53:01,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 05:53:01,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:53:01,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 05:53:01,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=444, Unknown=6, NotChecked=42, Total=552 [2025-03-08 05:53:01,684 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 20 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 17 states have internal predecessors, (28), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-08 05:53:05,722 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-03-08 05:53:09,733 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]