./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 --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 20:02:28,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 20:02:28,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 20:02:28,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 20:02:28,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 20:02:28,169 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 20:02:28,171 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 20:02:28,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 20:02:28,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 20:02:28,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 20:02:28,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 20:02:28,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 20:02:28,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 20:02:28,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 20:02:28,176 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 20:02:28,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 20:02:28,176 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 20:02:28,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 20:02:28,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 20:02:28,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 20:02:28,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 20:02:28,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 20:02:28,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 20:02:28,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 20:02:28,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 20:02:28,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 20:02:28,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 20:02:28,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 20:02:28,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 20:02:28,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 20:02:28,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 20:02:28,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 20:02:28,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 20:02:28,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 20:02:28,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 20:02:28,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 20:02:28,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 20:02:28,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 20:02:28,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 20:02:28,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 20:02:28,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 20:02:28,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 20:02:28,185 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 20:02:28,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 20:02:28,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 20:02:28,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 20:02:28,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 20:02:28,457 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 20:02:28,458 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-12 20:02:29,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 20:02:29,864 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 20:02:29,865 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_geo3-ll.c [2024-09-12 20:02:29,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/9fcf09b49/1c7150fd503f48a98ac4b029c4d7aecc/FLAGdd257375d [2024-09-12 20:02:29,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/9fcf09b49/1c7150fd503f48a98ac4b029c4d7aecc [2024-09-12 20:02:29,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 20:02:29,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 20:02:29,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 20:02:29,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 20:02:29,897 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 20:02:29,898 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 08:02:29" (1/1) ... [2024-09-12 20:02:29,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1123b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:29, skipping insertion in model container [2024-09-12 20:02:29,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 08:02:29" (1/1) ... [2024-09-12 20:02:29,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 20:02:30,044 WARN L247 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-12 20:02:30,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 20:02:30,068 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 20:02:30,079 WARN L247 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-12 20:02:30,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 20:02:30,104 INFO L204 MainTranslator]: Completed translation [2024-09-12 20:02:30,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30 WrapperNode [2024-09-12 20:02:30,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 20:02:30,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 20:02:30,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 20:02:30,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 20:02:30,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,122 INFO L138 Inliner]: procedures = 16, calls = 66, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 20:02:30,123 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 20:02:30,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 20:02:30,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 20:02:30,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 20:02:30,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,147 INFO L175 MemorySlicer]: Split 36 memory accesses to 8 slices as follows [2, 3, 6, 4, 8, 5, 6, 2]. 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, 2, 2, 2, 1, 1]. [2024-09-12 20:02:30,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,153 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 20:02:30,165 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 20:02:30,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 20:02:30,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 20:02:30,166 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (1/1) ... [2024-09-12 20:02:30,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 20:02:30,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:02:30,190 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-12 20:02:30,192 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-12 20:02:30,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 20:02:30,223 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 20:02:30,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 20:02:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-12 20:02:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-12 20:02:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-12 20:02:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-12 20:02:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-09-12 20:02:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-09-12 20:02:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 20:02:30,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 20:02:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_30_to_38_0 [2024-09-12 20:02:30,224 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_30_to_38_0 [2024-09-12 20:02:30,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 20:02:30,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 20:02:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 20:02:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 20:02:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-12 20:02:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-12 20:02:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-12 20:02:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-12 20:02:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-09-12 20:02:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-09-12 20:02:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 20:02:30,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 20:02:30,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 20:02:30,301 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 20:02:30,302 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 20:02:30,526 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-12 20:02:30,526 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 20:02:30,551 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 20:02:30,552 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 20:02:30,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 08:02:30 BoogieIcfgContainer [2024-09-12 20:02:30,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 20:02:30,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 20:02:30,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 20:02:30,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 20:02:30,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 08:02:29" (1/3) ... [2024-09-12 20:02:30,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e188cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 08:02:30, skipping insertion in model container [2024-09-12 20:02:30,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 08:02:30" (2/3) ... [2024-09-12 20:02:30,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e188cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 08:02:30, skipping insertion in model container [2024-09-12 20:02:30,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 08:02:30" (3/3) ... [2024-09-12 20:02:30,560 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_geo3-ll.c [2024-09-12 20:02:30,573 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 20:02:30,574 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-12 20:02:30,616 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 20:02:30,635 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;@7871d6fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 20:02:30,635 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-12 20:02:30,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 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-12 20:02:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-09-12 20:02:30,646 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:02:30,646 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-09-12 20:02:30,646 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:02:30,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:02:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1953226520, now seen corresponding path program 1 times [2024-09-12 20:02:30,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:02:30,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766571607] [2024-09-12 20:02:30,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:02:30,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:02:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 20:02:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367312131] [2024-09-12 20:02:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:02:30,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:02:30,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:02:30,782 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-12 20:02:30,784 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-12 20:02:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:02:30,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-12 20:02:30,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:02:30,967 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-12 20:02:30,968 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 20:02:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:02:30,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766571607] [2024-09-12 20:02:30,969 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 20:02:30,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367312131] [2024-09-12 20:02:30,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367312131] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 20:02:30,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 20:02:30,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 20:02:30,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538629107] [2024-09-12 20:02:30,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 20:02:30,976 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 20:02:30,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:02:30,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 20:02:30,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 20:02:30,995 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.375) internal successors, (22), 20 states have internal predecessors, (22), 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 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 20:02:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:02:31,023 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2024-09-12 20:02:31,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 20:02:31,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 6 [2024-09-12 20:02:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:02:31,032 INFO L225 Difference]: With dead ends: 50 [2024-09-12 20:02:31,032 INFO L226 Difference]: Without dead ends: 24 [2024-09-12 20:02:31,033 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 20:02:31,035 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 20:02:31,036 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 51 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 20:02:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-12 20:02:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-12 20:02:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 20:02:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-09-12 20:02:31,088 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 6 [2024-09-12 20:02:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:02:31,088 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-09-12 20:02:31,089 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 20:02:31,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:02:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-09-12 20:02:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 20:02:31,093 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:02:31,093 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:02:31,124 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 20:02:31,294 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-12 20:02:31,294 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:02:31,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:02:31,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1703135812, now seen corresponding path program 1 times [2024-09-12 20:02:31,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:02:31,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402673007] [2024-09-12 20:02:31,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:02:31,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:02:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 20:02:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157484263] [2024-09-12 20:02:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:02:31,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:02:31,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:02:31,380 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-12 20:02:31,381 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-12 20:02:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:02:31,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-09-12 20:02:31,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:02:31,590 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-12 20:02:31,598 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-12 20:02:31,605 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-12 20:02:31,614 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-12 20:02:31,666 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-12 20:02:31,824 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 34 treesize of output 22 [2024-09-12 20:02:31,835 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 32 treesize of output 20 [2024-09-12 20:02:31,843 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-12 20:02:31,848 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-12 20:02:31,907 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-12 20:02:31,907 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 20:02:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:02:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402673007] [2024-09-12 20:02:31,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 20:02:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157484263] [2024-09-12 20:02:31,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157484263] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 20:02:31,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 20:02:31,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 20:02:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265673174] [2024-09-12 20:02:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 20:02:31,910 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 20:02:31,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:02:31,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 20:02:31,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-12 20:02:31,911 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-12 20:02:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:02:32,155 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-09-12 20:02:32,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 20:02:32,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 14 [2024-09-12 20:02:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:02:32,157 INFO L225 Difference]: With dead ends: 38 [2024-09-12 20:02:32,157 INFO L226 Difference]: Without dead ends: 36 [2024-09-12 20:02:32,157 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-09-12 20:02:32,158 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 20:02:32,158 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 107 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 20:02:32,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-12 20:02:32,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-09-12 20:02:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 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-12 20:02:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-09-12 20:02:32,177 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 14 [2024-09-12 20:02:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:02:32,177 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-09-12 20:02:32,178 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-12 20:02:32,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:02:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-09-12 20:02:32,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 20:02:32,179 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:02:32,179 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:02:32,186 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 20:02:32,379 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-12 20:02:32,379 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:02:32,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:02:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1118031561, now seen corresponding path program 1 times [2024-09-12 20:02:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:02:32,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793304085] [2024-09-12 20:02:32,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:02:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:02:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 20:02:32,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35801633] [2024-09-12 20:02:32,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:02:32,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:02:32,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:02:32,441 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-12 20:02:32,442 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-12 20:02:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:02:32,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 154 conjuncts are in the unsatisfiable core [2024-09-12 20:02:32,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:02:32,927 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-12 20:02:32,930 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-12 20:02:32,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-12 20:02:32,941 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-12 20:02:32,966 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-12 20:02:33,353 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-12 20:02:33,361 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-12 20:02:33,455 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 59 treesize of output 43 [2024-09-12 20:02:33,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-12 20:02:33,465 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 40 treesize of output 24 [2024-09-12 20:02:33,471 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-12 20:02:33,475 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-12 20:02:33,545 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-12 20:02:33,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:02:47,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:02:47,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793304085] [2024-09-12 20:02:47,828 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 20:02:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35801633] [2024-09-12 20:02:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35801633] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:02:47,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-12 20:02:47,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-09-12 20:02:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070365814] [2024-09-12 20:02:47,828 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-12 20:02:47,829 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-12 20:02:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:02:47,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-12 20:02:47,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=321, Unknown=2, NotChecked=0, Total=380 [2024-09-12 20:02:47,830 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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-12 20:02:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:02:48,925 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2024-09-12 20:02:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 20:02:48,926 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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 24 [2024-09-12 20:02:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:02:48,928 INFO L225 Difference]: With dead ends: 59 [2024-09-12 20:02:48,928 INFO L226 Difference]: Without dead ends: 55 [2024-09-12 20:02:48,929 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=100, Invalid=498, Unknown=2, NotChecked=0, Total=600 [2024-09-12 20:02:48,929 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-12 20:02:48,929 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 157 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-12 20:02:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-12 20:02:48,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-09-12 20:02:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 36 states have internal predecessors, (38), 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-12 20:02:48,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-09-12 20:02:48,948 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 24 [2024-09-12 20:02:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:02:48,949 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-09-12 20:02:48,949 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 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-12 20:02:48,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:02:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2024-09-12 20:02:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 20:02:48,953 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:02:48,953 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, 1, 1] [2024-09-12 20:02:48,967 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-12 20:02:49,154 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-12 20:02:49,154 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:02:49,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:02:49,154 INFO L85 PathProgramCache]: Analyzing trace with hash 826920542, now seen corresponding path program 1 times [2024-09-12 20:02:49,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:02:49,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439813818] [2024-09-12 20:02:49,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:02:49,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:02:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 20:02:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [225583844] [2024-09-12 20:02:49,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:02:49,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:02:49,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:02:49,216 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-12 20:02:49,217 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-12 20:02:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 20:02:49,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-09-12 20:02:49,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:02:49,458 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-12 20:02:49,461 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-12 20:02:49,464 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-12 20:02:49,473 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-12 20:02:49,506 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-12 20:02:49,529 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-12 20:02:53,703 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#2| |v_main_~#a~0.base_BEFORE_CALL_3|) |v_main_~#a~0.offset_BEFORE_CALL_3|) (select (select |c_#memory_int#6| |v_main_~#z~0.base_BEFORE_CALL_3|) |v_main_~#z~0.offset_BEFORE_CALL_3|)) (select (select |c_#memory_int#1| |v_main_~#az~0.base_BEFORE_CALL_3|) |v_main_~#az~0.offset_BEFORE_CALL_3|))) is different from true [2024-09-12 20:02:54,042 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-12 20:02:54,049 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 32 treesize of output 20 [2024-09-12 20:02:54,054 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 10 [2024-09-12 20:02:54,063 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-12 20:02:54,152 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-12 20:02:54,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:02:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:02:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439813818] [2024-09-12 20:02:55,914 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 20:02:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225583844] [2024-09-12 20:02:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225583844] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 20:02:55,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-12 20:02:55,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-09-12 20:02:55,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271219843] [2024-09-12 20:02:55,914 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-12 20:02:55,915 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 20:02:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:02:55,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 20:02:55,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=205, Unknown=1, NotChecked=28, Total=272 [2024-09-12 20:02:55,916 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:02:57,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-12 20:03:01,864 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-12 20:03:06,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-12 20:03:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 20:03:08,980 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2024-09-12 20:03:08,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 20:03:08,983 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2024-09-12 20:03:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 20:03:08,983 INFO L225 Difference]: With dead ends: 55 [2024-09-12 20:03:08,983 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 20:03:08,984 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2024-09-12 20:03:08,984 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-09-12 20:03:08,984 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 105 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 1 Unknown, 40 Unchecked, 11.0s Time] [2024-09-12 20:03:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 20:03:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-12 20:03:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.1) internal successors, (33), 32 states have internal predecessors, (33), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-12 20:03:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2024-09-12 20:03:08,996 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 24 [2024-09-12 20:03:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 20:03:08,997 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2024-09-12 20:03:08,997 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 4 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 20:03:08,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:03:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2024-09-12 20:03:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 20:03:08,998 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 20:03:08,998 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 20:03:09,012 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 20:03:09,201 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:03:09,201 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 20:03:09,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 20:03:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1685928854, now seen corresponding path program 2 times [2024-09-12 20:03:09,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 20:03:09,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108242427] [2024-09-12 20:03:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 20:03:09,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 20:03:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 20:03:09,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711608514] [2024-09-12 20:03:09,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 20:03:09,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 20:03:09,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 20:03:09,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 20:03:09,246 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 20:03:17,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 20:03:17,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 20:03:17,982 WARN L260 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 253 conjuncts are in the unsatisfiable core [2024-09-12 20:03:17,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 20:03:18,000 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-12 20:03:18,005 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-12 20:03:18,008 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-12 20:03:18,012 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-12 20:03:18,019 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-12 20:03:18,024 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-12 20:03:18,068 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-12 20:03:19,111 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 [2024-09-12 20:03:19,118 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-12 20:03:19,124 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-12 20:03:22,776 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-12 20:03:22,788 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-12 20:03:23,796 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 94 treesize of output 62 [2024-09-12 20:03:23,800 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-12 20:03:23,805 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 57 treesize of output 33 [2024-09-12 20:03:23,809 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-12 20:03:23,817 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-12 20:03:23,920 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-12 20:03:23,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 20:04:00,415 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int#2| 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#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#1| c_func_to_recursive_line_30_to_38_0_~az.base) c_func_to_recursive_line_30_to_38_0_~az.offset)) (.cse2 (select (select |c_#memory_int#6| c_func_to_recursive_line_30_to_38_0_~z.base) c_func_to_recursive_line_30_to_38_0_~z.offset)) (.cse3 (select (select |c_#memory_int#4| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (not (= (mod (+ (* 18446744073709551615 .cse0 .cse1) (* .cse2 .cse3) (* 18446744073709551615 .cse3) .cse4) 18446744073709551616) 0)) (= (mod (+ (* .cse2 .cse4) (* 18446744073709551615 .cse2 .cse3) (* 18446744073709551615 .cse2 .cse0 .cse1) (* .cse2 .cse2 .cse3)) 18446744073709551616) 0))) is different from true [2024-09-12 20:04:12,813 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int#2| |c_func_to_recursive_line_30_to_38_0_#in~a.base|) |c_func_to_recursive_line_30_to_38_0_#in~a.offset|)) (.cse2 (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|)) (.cse3 (select (select |c_#memory_int#1| |c_func_to_recursive_line_30_to_38_0_#in~az.base|) |c_func_to_recursive_line_30_to_38_0_#in~az.offset|)) (.cse0 (select (select |c_#memory_int#6| |c_func_to_recursive_line_30_to_38_0_#in~z.base|) |c_func_to_recursive_line_30_to_38_0_#in~z.offset|)) (.cse1 (select (select |c_#memory_int#4| |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 (= (mod (+ (* .cse0 18446744073709551615 .cse1) (* .cse0 .cse0 .cse1) (* .cse0 18446744073709551615 .cse2 .cse3) (* .cse4 .cse0)) 18446744073709551616) 0) (not (= (mod (+ .cse4 (* 18446744073709551615 .cse1) (* 18446744073709551615 .cse2 .cse3) (* .cse0 .cse1)) 18446744073709551616) 0)))) is different from true [2024-09-12 20:04:33,406 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int#2| c_func_to_recursive_line_30_to_38_0_~a.base) c_func_to_recursive_line_30_to_38_0_~a.offset)) (.cse3 (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)) (.cse4 (select (select |c_#memory_int#1| c_func_to_recursive_line_30_to_38_0_~az.base) c_func_to_recursive_line_30_to_38_0_~az.offset)) (.cse0 (select (select |c_#memory_int#6| 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#4| c_func_to_recursive_line_30_to_38_0_~x.base) c_func_to_recursive_line_30_to_38_0_~x.offset))) (or (not (= (mod (+ (* .cse0 .cse1) (* 18446744073709551615 .cse0 .cse2) (* 18446744073709551615 .cse0 .cse3 .cse4) (* .cse0 .cse0 .cse2)) 18446744073709551616) 0)) (= (mod (+ (* .cse0 .cse0 .cse1) (* 18446744073709551615 .cse0 .cse0 .cse3 .cse4) (* 18446744073709551615 .cse0 .cse0 .cse2) (* .cse0 .cse0 .cse0 .cse2)) 18446744073709551616) 0))) is different from true [2024-09-12 20:04:51,917 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-12 20:05:16,521 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int#2| |c_func_to_recursive_line_30_to_38_0_#in~a.base|) |c_func_to_recursive_line_30_to_38_0_#in~a.offset|)) (.cse2 (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|)) (.cse3 (select (select |c_#memory_int#1| |c_func_to_recursive_line_30_to_38_0_#in~az.base|) |c_func_to_recursive_line_30_to_38_0_#in~az.offset|)) (.cse0 (select (select |c_#memory_int#6| |c_func_to_recursive_line_30_to_38_0_#in~z.base|) |c_func_to_recursive_line_30_to_38_0_#in~z.offset|)) (.cse1 (select (select |c_#memory_int#4| |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 (+ (* .cse0 18446744073709551615 .cse1) (* .cse0 .cse0 .cse1) (* .cse0 18446744073709551615 .cse2 .cse3) (* .cse4 .cse0)) 18446744073709551616) 0)) (= (mod (+ (* .cse4 .cse0 .cse0) (* .cse0 .cse0 18446744073709551615 .cse2 .cse3) (* .cse0 .cse0 18446744073709551615 .cse1) (* .cse0 .cse0 .cse0 .cse1)) 18446744073709551616) 0))) is different from true [2024-09-12 20:05:28,769 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_main_~#a~0.base|) |c_main_~#a~0.offset|)) (.cse2 (select (select |c_#memory_int#5| |c_main_~#y~0.base|) |c_main_~#y~0.offset|)) (.cse3 (select (select |c_#memory_int#1| |c_main_~#az~0.base|) |c_main_~#az~0.offset|)) (.cse4 (select (select |c_#memory_int#4| |c_main_~#x~0.base|) |c_main_~#x~0.offset|)) (.cse1 (select (select |c_#memory_int#6| |c_main_~#z~0.base|) |c_main_~#z~0.offset|))) (or (= (mod (+ (* .cse0 .cse1 .cse1) (* 18446744073709551615 .cse2 .cse3 .cse1 .cse1) (* 18446744073709551615 .cse4 .cse1 .cse1) (* .cse4 .cse1 .cse1 .cse1)) 18446744073709551616) 0) (not (= (mod (+ (* .cse0 .cse1) (* 18446744073709551615 .cse2 .cse3 .cse1) (* .cse4 .cse1 .cse1) (* 18446744073709551615 .cse4 .cse1)) 18446744073709551616) 0)))) is different from true [2024-09-12 20:05:36,785 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 20:05:49,506 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#2| |c_main_~#a~0.base|) |c_main_~#a~0.offset|)) (.cse3 (select (select |c_#memory_int#5| |c_main_~#y~0.base|) |c_main_~#y~0.offset|)) (.cse2 (select (select |c_#memory_int#4| |c_main_~#x~0.base|) |c_main_~#x~0.offset|)) (.cse1 (select (select |c_#memory_int#6| |c_main_~#z~0.base|) |c_main_~#z~0.offset|))) (or (= (mod (+ (* .cse0 .cse1 .cse1) (* 18446744073709551615 .cse2 .cse1 .cse1) (* 18446744073709551615 .cse3 |c_main_#t~mem23| |c_main_#t~mem22| .cse1 .cse1) (* .cse2 .cse1 .cse1 .cse1)) 18446744073709551616) 0) (not (= (mod (+ (* .cse0 .cse1) (* 18446744073709551615 .cse3 |c_main_#t~mem23| |c_main_#t~mem22| .cse1) (* .cse2 .cse1 .cse1) (* 18446744073709551615 .cse2 .cse1)) 18446744073709551616) 0)) (< 9223372036854775807 (* |c_main_#t~mem23| |c_main_#t~mem22|)))) is different from true [2024-09-12 20:05:57,524 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 20:06:05,918 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2024-09-12 20:06:05,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 20:06:05,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108242427] [2024-09-12 20:06:05,919 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 20:06:05,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711608514] [2024-09-12 20:06:05,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711608514] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 20:06:05,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 20:06:05,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2024-09-12 20:06:05,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259201842] [2024-09-12 20:06:05,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 20:06:05,919 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-12 20:06:05,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 20:06:05,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-12 20:06:05,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=767, Unknown=9, NotChecked=366, Total=1260 [2024-09-12 20:06:05,921 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 36 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 26 states have internal predecessors, (44), 13 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 20:06:22,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2024-09-12 20:06:32,613 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 [] [2024-09-12 20:06:36,617 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 [] [2024-09-12 20:06:57,753 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 [] [2024-09-12 20:07:01,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []