./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_geo3-ll.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_geo3-ll.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 0f77dea8ac4e90769e7f79fe586c3bc8814d52e2350b8c4d8b140363f12c9ac8 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:36:20,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:36:20,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:36:20,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:36:20,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:36:21,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:36:21,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:36:21,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:36:21,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:36:21,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:36:21,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:36:21,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:36:21,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:36:21,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:36:21,027 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:36:21,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:36:21,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:36:21,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:36:21,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:36:21,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:36:21,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:36:21,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:36:21,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:36:21,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:36:21,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:36:21,034 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:36:21,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:36:21,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:36:21,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:36:21,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:36:21,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:36:21,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:36:21,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:36:21,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:36:21,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:36:21,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:36:21,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:36:21,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:36:21,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:36:21,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:36:21,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:36:21,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:36:21,040 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/certificate-witnesses-artifact/automizer 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 -> 0f77dea8ac4e90769e7f79fe586c3bc8814d52e2350b8c4d8b140363f12c9ac8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 11:36:21,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:36:21,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:36:21,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:36:21,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:36:21,387 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:36:21,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_nla-digbench/recursified_geo3-ll.c [2024-09-25 11:36:22,757 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:36:22,960 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:36:22,961 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_geo3-ll.c [2024-09-25 11:36:22,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/75dbafff2/fc265cbcb64b421e97943a5dd4c7fe5b/FLAG403bc8130 [2024-09-25 11:36:23,342 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/75dbafff2/fc265cbcb64b421e97943a5dd4c7fe5b [2024-09-25 11:36:23,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:36:23,345 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:36:23,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:36:23,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:36:23,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:36:23,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2342bd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23, skipping insertion in model container [2024-09-25 11:36:23,357 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:36:23,534 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_geo3-ll.c[1055,1068] [2024-09-25 11:36:23,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:36:23,574 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:36:23,585 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_geo3-ll.c[1055,1068] [2024-09-25 11:36:23,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:36:23,629 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:36:23,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23 WrapperNode [2024-09-25 11:36:23,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:36:23,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:36:23,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:36:23,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:36:23,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,653 INFO L138 Inliner]: procedures = 16, calls = 66, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:36:23,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:36:23,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:36:23,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:36:23,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:36:23,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,702 INFO L175 MemorySlicer]: Split 36 memory accesses to 8 slices as follows [2, 6, 2, 3, 6, 5, 8, 4]. 22 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 1, 1, 1, 1, 2, 2, 2]. [2024-09-25 11:36:23,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,714 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:36:23,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:36:23,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:36:23,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:36:23,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (1/1) ... [2024-09-25 11:36:23,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:36:23,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:36:23,770 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 11:36:23,776 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 11:36:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:36:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:36:23,820 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:36:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:36:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 11:36:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 11:36:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-25 11:36:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-25 11:36:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-25 11:36:23,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-09-25 11:36:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-09-25 11:36:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 11:36:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 11:36:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 11:36:23,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 11:36:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-25 11:36:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-25 11:36:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-25 11:36:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-09-25 11:36:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-09-25 11:36:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:36:23,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:36:23,826 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_30_to_38_0 [2024-09-25 11:36:23,827 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_30_to_38_0 [2024-09-25 11:36:23,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:36:23,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:36:23,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 11:36:23,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 11:36:23,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 11:36:23,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-25 11:36:23,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-25 11:36:23,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-25 11:36:23,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-09-25 11:36:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-09-25 11:36:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:36:23,829 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:36:23,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 11:36:23,952 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:36:23,954 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:36:24,239 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-25 11:36:24,239 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:36:24,265 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:36:24,266 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 11:36:24,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:36:24 BoogieIcfgContainer [2024-09-25 11:36:24,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:36:24,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:36:24,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:36:24,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:36:24,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:36:23" (1/3) ... [2024-09-25 11:36:24,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41313c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:36:24, skipping insertion in model container [2024-09-25 11:36:24,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:36:23" (2/3) ... [2024-09-25 11:36:24,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41313c9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:36:24, skipping insertion in model container [2024-09-25 11:36:24,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:36:24" (3/3) ... [2024-09-25 11:36:24,274 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_geo3-ll.c [2024-09-25 11:36:24,290 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:36:24,290 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:36:24,351 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:36:24,359 INFO L336 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=All, 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;@15a98119, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:36:24,359 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:36:24,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 11:36:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 11:36:24,369 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:36:24,369 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:36:24,370 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:36:24,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:36:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash 784733954, now seen corresponding path program 1 times [2024-09-25 11:36:24,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:36:24,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653278555] [2024-09-25 11:36:24,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:36:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:36:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:36:24,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096709618] [2024-09-25 11:36:24,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:36:24,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:36:24,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:36:24,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:36:24,610 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 11:36:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:36:24,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-09-25 11:36:24,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:36:24,910 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 21 treesize of output 17 [2024-09-25 11:36:24,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-25 11:36:24,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:36:24,942 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 [2024-09-25 11:36:24,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:36:25,112 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 36 treesize of output 24 [2024-09-25 11:36:25,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-09-25 11:36:25,136 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 35 treesize of output 19 [2024-09-25 11:36:25,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-09-25 11:36:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:36:25,219 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:36:25,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:36:25,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653278555] [2024-09-25 11:36:25,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:36:25,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096709618] [2024-09-25 11:36:25,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096709618] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:36:25,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:36:25,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 11:36:25,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732251806] [2024-09-25 11:36:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:36:25,228 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 11:36:25,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:36:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 11:36:25,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:36:25,255 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 11:36:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:36:25,545 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-09-25 11:36:25,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:36:25,548 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), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-25 11:36:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:36:25,554 INFO L225 Difference]: With dead ends: 58 [2024-09-25 11:36:25,555 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 11:36:25,558 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-25 11:36:25,562 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:36:25,564 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:36:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 11:36:25,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-09-25 11:36:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-25 11:36:25,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-09-25 11:36:25,610 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2024-09-25 11:36:25,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:36:25,612 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-09-25 11:36:25,613 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 11:36:25,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:36:25,613 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-09-25 11:36:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 11:36:25,614 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:36:25,614 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:36:25,632 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 11:36:25,815 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-09-25 11:36:25,815 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:36:25,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:36:25,816 INFO L85 PathProgramCache]: Analyzing trace with hash 646538741, now seen corresponding path program 1 times [2024-09-25 11:36:25,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:36:25,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029965080] [2024-09-25 11:36:25,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:36:25,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:36:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:36:25,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891989236] [2024-09-25 11:36:25,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:36:25,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:36:25,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:36:25,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:36:25,933 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 11:36:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:36:26,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-09-25 11:36:26,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:36:26,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-25 11:36:26,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:36:26,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:36:26,654 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 [2024-09-25 11:36:26,662 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 21 treesize of output 17 [2024-09-25 11:36:27,167 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 39 treesize of output 27 [2024-09-25 11:36:27,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-09-25 11:36:27,588 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 48 treesize of output 32 [2024-09-25 11:36:27,597 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 47 treesize of output 31 [2024-09-25 11:36:27,605 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 43 treesize of output 27 [2024-09-25 11:36:27,610 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 26 treesize of output 14 [2024-09-25 11:36:27,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-09-25 11:36:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:36:27,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:36:36,253 WARN L876 $PredicateComparison]: unable to prove that (= (mod (let ((.cse1 (select (select |c_#memory_int#6| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset)) (.cse0 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset))) (+ (* .cse0 .cse0 .cse1) (* .cse0 (select (select |c_#memory_int#1| c_func_to_recursive_line_30_to_38_0_~a.base) c_func_to_recursive_line_30_to_38_0_~a.offset)) (* 18446744073709551615 .cse0 .cse1) (* (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~az.base) c_func_to_recursive_line_30_to_38_0_~az.offset) 18446744073709551615 .cse0 (select (select |c_#memory_int#5| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)))) 18446744073709551616) 0) is different from true [2024-09-25 11:36:40,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:36:40,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029965080] [2024-09-25 11:36:40,609 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:36:40,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891989236] [2024-09-25 11:36:40,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891989236] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:36:40,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:36:40,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-09-25 11:36:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117860977] [2024-09-25 11:36:40,610 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-25 11:36:40,611 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 11:36:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:36:40,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 11:36:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=257, Unknown=2, NotChecked=32, Total=342 [2024-09-25 11:36:40,612 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:36:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:36:46,204 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2024-09-25 11:36:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-25 11:36:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2024-09-25 11:36:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:36:46,207 INFO L225 Difference]: With dead ends: 57 [2024-09-25 11:36:46,207 INFO L226 Difference]: Without dead ends: 53 [2024-09-25 11:36:46,208 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=90, Invalid=417, Unknown=3, NotChecked=42, Total=552 [2024-09-25 11:36:46,209 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:36:46,209 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 158 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-09-25 11:36:46,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-25 11:36:46,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-09-25 11:36:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-25 11:36:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-09-25 11:36:46,227 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 22 [2024-09-25 11:36:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:36:46,227 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-09-25 11:36:46,228 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 5 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:36:46,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:36:46,228 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-09-25 11:36:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 11:36:46,231 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:36:46,231 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:36:46,241 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 11:36:46,435 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:36:46,436 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:36:46,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:36:46,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1703476452, now seen corresponding path program 1 times [2024-09-25 11:36:46,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:36:46,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410771320] [2024-09-25 11:36:46,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:36:46,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:36:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:36:46,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1634941969] [2024-09-25 11:36:46,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:36:46,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:36:46,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:36:46,532 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:36:46,533 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 11:36:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:36:46,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 88 conjuncts are in the unsatisfiable core [2024-09-25 11:36:46,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:36:46,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-25 11:36:46,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:36:46,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:36:46,723 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 21 treesize of output 17 [2024-09-25 11:36:46,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:36:46,753 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 11 treesize of output 7 [2024-09-25 11:36:50,995 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#a~0.offset_BEFORE_CALL_3| Int) (|v_main_~#az~0.base_BEFORE_CALL_3| Int) (|v_main_~#z~0.base_BEFORE_CALL_3| Int) (|v_main_~#z~0.offset_BEFORE_CALL_3| Int) (|v_main_~#az~0.offset_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_int#3| |v_main_~#az~0.base_BEFORE_CALL_3|) |v_main_~#az~0.offset_BEFORE_CALL_3|) (* (select (select |c_#memory_int#1| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |c_#memory_int#4| |v_main_~#z~0.base_BEFORE_CALL_3|) |v_main_~#z~0.offset_BEFORE_CALL_3|)))) is different from true [2024-09-25 11:36:52,299 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 66 treesize of output 46 [2024-09-25 11:36:52,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 11:36:52,329 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 70 treesize of output 66 [2024-09-25 11:36:52,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 11:36:52,354 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 86 treesize of output 74 [2024-09-25 11:36:52,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 11:36:52,375 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 80 treesize of output 60 [2024-09-25 11:36:52,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-09-25 11:36:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-09-25 11:36:52,562 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:36:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:36:58,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:36:58,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410771320] [2024-09-25 11:36:58,312 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:36:58,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634941969] [2024-09-25 11:36:58,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634941969] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:36:58,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:36:58,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2024-09-25 11:36:58,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759827783] [2024-09-25 11:36:58,313 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:36:58,313 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 11:36:58,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:36:58,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 11:36:58,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=325, Unknown=1, NotChecked=36, Total=420 [2024-09-25 11:36:58,319 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 21 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-25 11:36:59,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:37:03,834 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] [2024-09-25 11:37:07,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:37:12,987 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] [2024-09-25 11:37:17,131 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] [2024-09-25 11:37:19,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 11:37:24,663 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, 1] [2024-09-25 11:37:25,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:37:25,820 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-09-25 11:37:25,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 11:37:25,821 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 22 [2024-09-25 11:37:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:37:25,822 INFO L225 Difference]: With dead ends: 55 [2024-09-25 11:37:25,822 INFO L226 Difference]: Without dead ends: 47 [2024-09-25 11:37:25,823 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=108, Invalid=545, Unknown=1, NotChecked=48, Total=702 [2024-09-25 11:37:25,824 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 25.9s IncrementalHoareTripleChecker+Time [2024-09-25 11:37:25,824 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 101 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 5 Unknown, 43 Unchecked, 25.9s Time] [2024-09-25 11:37:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-25 11:37:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-25 11:37:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.103448275862069) internal successors, (32), 31 states have internal predecessors, (32), 9 states have call successors, (9), 8 states have call predecessors, (9), 8 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-25 11:37:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-09-25 11:37:25,851 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 22 [2024-09-25 11:37:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:37:25,851 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-09-25 11:37:25,851 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 16 states have (on average 1.5) internal successors, (24), 16 states have internal predecessors, (24), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-25 11:37:25,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:37:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-09-25 11:37:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 11:37:25,852 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:37:25,852 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:37:25,875 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 11:37:26,060 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-09-25 11:37:26,061 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:37:26,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:37:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1978080984, now seen corresponding path program 2 times [2024-09-25 11:37:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:37:26,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627133137] [2024-09-25 11:37:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:37:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:37:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 11:37:26,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201458617] [2024-09-25 11:37:26,196 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 11:37:26,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:37:26,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:37:26,200 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 11:37:26,203 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 11:37:28,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 11:37:28,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 11:37:28,072 WARN L260 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 235 conjuncts are in the unsatisfiable core [2024-09-25 11:37:28,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:37:28,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:37:28,088 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 21 treesize of output 17 [2024-09-25 11:37:28,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 11:37:28,099 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 [2024-09-25 11:37:28,107 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 [2024-09-25 11:37:28,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-25 11:37:28,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-09-25 11:37:28,563 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 39 treesize of output 27 [2024-09-25 11:37:28,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-09-25 11:37:58,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-09-25 11:37:58,827 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 51 treesize of output 39 [2024-09-25 11:38:08,017 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 64 treesize of output 44 [2024-09-25 11:38:08,026 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 65 treesize of output 37 [2024-09-25 11:38:08,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-09-25 11:38:08,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-09-25 11:38:08,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-09-25 11:38:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:38:08,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:39:01,248 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~az.base) c_func_to_recursive_line_30_to_38_0_~az.offset)) (.cse4 (select (select |c_#memory_int#5| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse2 (select (select |c_#memory_int#1| c_func_to_recursive_line_30_to_38_0_~a.base) c_func_to_recursive_line_30_to_38_0_~a.offset)) (.cse0 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse1 (select (select |c_#memory_int#6| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (= (mod (+ (* .cse0 .cse0 .cse1) (* .cse0 .cse2) (* 18446744073709551615 .cse0 .cse1) (* .cse3 18446744073709551615 .cse0 .cse4)) 18446744073709551616) 0) (not (= (mod (+ (* .cse3 18446744073709551615 .cse4) .cse2 (* .cse0 .cse1) (* 18446744073709551615 .cse1)) 18446744073709551616) 0)))) is different from true [2024-09-25 11:39:13,396 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#1| |c_func_to_recursive_line_30_to_38_0_#in~a.base|) |c_func_to_recursive_line_30_to_38_0_#in~a.offset|)) (.cse0 (select (select |c_#memory_int#5| |c_func_to_recursive_line_30_to_38_0_#in~y.base|) |c_func_to_recursive_line_30_to_38_0_#in~y.offset|)) (.cse1 (select (select |c_#memory_int#3| |c_func_to_recursive_line_30_to_38_0_#in~az.base|) |c_func_to_recursive_line_30_to_38_0_#in~az.offset|)) (.cse3 (select (select |c_#memory_int#4| |c_func_to_recursive_line_30_to_38_0_#in~z.base|) |c_func_to_recursive_line_30_to_38_0_#in~z.offset|)) (.cse4 (select (select |c_#memory_int#6| |c_func_to_recursive_line_30_to_38_0_#in~x.base|) |c_func_to_recursive_line_30_to_38_0_#in~x.offset|))) (or (not (= (mod (+ (* 18446744073709551615 .cse0 .cse1) .cse2 (* .cse3 .cse4) (* 18446744073709551615 .cse4)) 18446744073709551616) 0)) (= (mod (+ (* .cse3 .cse2) (* 18446744073709551615 .cse3 .cse4) (* 18446744073709551615 .cse3 .cse0 .cse1) (* .cse3 .cse3 .cse4)) 18446744073709551616) 0))) is different from true [2024-09-25 11:39:33,754 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~az.base) c_func_to_recursive_line_30_to_38_0_~az.offset)) (.cse4 (select (select |c_#memory_int#5| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse1 (select (select |c_#memory_int#6| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset)) (.cse0 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse2 (select (select |c_#memory_int#1| c_func_to_recursive_line_30_to_38_0_~a.base) c_func_to_recursive_line_30_to_38_0_~a.offset))) (or (not (= (mod (+ (* .cse0 .cse0 .cse1) (* .cse0 .cse2) (* 18446744073709551615 .cse0 .cse1) (* .cse3 18446744073709551615 .cse0 .cse4)) 18446744073709551616) 0)) (= (mod (+ (* 18446744073709551615 .cse0 .cse0 .cse1) (* .cse3 18446744073709551615 .cse0 .cse0 .cse4) (* .cse0 .cse0 .cse0 .cse1) (* .cse0 .cse0 .cse2)) 18446744073709551616) 0))) is different from true [2024-09-25 11:39:54,219 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:40:05,331 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int#3| c_func_to_recursive_line_30_to_38_0_~az.base) c_func_to_recursive_line_30_to_38_0_~az.offset)) (.cse4 (select (select |c_#memory_int#5| c_func_to_recursive_line_30_to_38_0_~y.base) c_func_to_recursive_line_30_to_38_0_~y.offset)) (.cse1 (select (select |c_#memory_int#6| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset)) (.cse0 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse2 (select (select |c_#memory_int#1| c_func_to_recursive_line_30_to_38_0_~a.base) c_func_to_recursive_line_30_to_38_0_~a.offset))) (or (not (= (mod (+ (* .cse0 .cse0 .cse1) (* .cse0 .cse2) (* 18446744073709551615 .cse0 .cse1) (* .cse3 18446744073709551615 .cse0 .cse4)) 18446744073709551616) 0)) (= (mod (+ (* 18446744073709551615 .cse0 .cse0 .cse1) (* .cse3 18446744073709551615 .cse0 .cse0 .cse4) (* .cse0 .cse0 .cse0 .cse1) (* .cse0 .cse0 .cse2)) 18446744073709551616) 0) (not (= (mod (+ (* 18446744073709551615 |c_func_to_recursive_line_30_to_38_0_#t~mem8| |c_func_to_recursive_line_30_to_38_0_#t~mem9|) |c_func_to_recursive_line_30_to_38_0_#t~mem7| (* |c_func_to_recursive_line_30_to_38_0_#t~mem6| 18446744073709551615) (* |c_func_to_recursive_line_30_to_38_0_#t~mem4| |c_func_to_recursive_line_30_to_38_0_#t~mem5|)) 18446744073709551616) 0)))) is different from true [2024-09-25 11:40:17,657 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_func_to_recursive_line_30_to_38_0_~az.offset_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~a.offset_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~az.base_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~a.base_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_8 Int)) (let ((.cse4 (select (select |c_#memory_int#1| v_func_to_recursive_line_30_to_38_0_~a.base_BEFORE_CALL_8) v_func_to_recursive_line_30_to_38_0_~a.offset_BEFORE_CALL_8)) (.cse2 (select (select |c_#memory_int#3| v_func_to_recursive_line_30_to_38_0_~az.base_BEFORE_CALL_8) v_func_to_recursive_line_30_to_38_0_~az.offset_BEFORE_CALL_8)) (.cse3 (select (select |c_#memory_int#5| v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_8) v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_8)) (.cse0 (select (select |c_#memory_int#6| v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_8) v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_8)) (.cse1 (select (select |c_#memory_int#4| v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_8) v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_8))) (or (= (mod (+ (* .cse0 18446744073709551615 .cse1 .cse1) (* .cse0 .cse1 .cse1 .cse1) (* 18446744073709551615 .cse2 .cse1 .cse1 .cse3) (* .cse4 .cse1 .cse1)) 18446744073709551616) 0) (not (= (mod (+ (* .cse4 .cse1) (* .cse0 18446744073709551615 .cse1) (* 18446744073709551615 .cse2 .cse1 .cse3) (* .cse0 .cse1 .cse1)) 18446744073709551616) 0)))))) is different from true [2024-09-25 11:40:25,696 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:40:37,913 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:40:46,040 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((v_func_to_recursive_line_30_to_38_0_~az.offset_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~a.offset_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~az.base_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~a.base_BEFORE_CALL_8 Int) (v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_8 Int)) (let ((.cse4 (select (select |c_#memory_int#1| v_func_to_recursive_line_30_to_38_0_~a.base_BEFORE_CALL_8) v_func_to_recursive_line_30_to_38_0_~a.offset_BEFORE_CALL_8)) (.cse2 (select (select |c_#memory_int#3| v_func_to_recursive_line_30_to_38_0_~az.base_BEFORE_CALL_8) v_func_to_recursive_line_30_to_38_0_~az.offset_BEFORE_CALL_8)) (.cse3 (select (select |c_#memory_int#5| v_func_to_recursive_line_30_to_38_0_~y.base_BEFORE_CALL_8) v_func_to_recursive_line_30_to_38_0_~y.offset_BEFORE_CALL_8)) (.cse0 (select (select |c_#memory_int#6| v_func_to_recursive_line_30_to_38_0_~x.base_BEFORE_CALL_8) v_func_to_recursive_line_30_to_38_0_~x.offset_BEFORE_CALL_8)) (.cse1 (select (select |c_#memory_int#4| v_func_to_recursive_line_30_to_38_0_~z.base_BEFORE_CALL_8) v_func_to_recursive_line_30_to_38_0_~z.offset_BEFORE_CALL_8))) (or (= (mod (+ (* .cse0 18446744073709551615 .cse1 .cse1) (* .cse0 .cse1 .cse1 .cse1) (* 18446744073709551615 .cse2 .cse1 .cse1 .cse3) (* .cse4 .cse1 .cse1)) 18446744073709551616) 0) (not (= (mod (+ (* .cse4 .cse1) (* .cse0 18446744073709551615 .cse1) (* 18446744073709551615 .cse2 .cse1 .cse3) (* .cse0 .cse1 .cse1)) 18446744073709551616) 0))))) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-25 11:40:58,064 WARN L293 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)