./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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 19:55:43,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 19:55:43,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 19:55:43,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 19:55:43,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 19:55:43,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 19:55:43,733 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 19:55:43,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 19:55:43,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 19:55:43,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 19:55:43,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 19:55:43,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 19:55:43,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 19:55:43,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 19:55:43,741 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 19:55:43,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 19:55:43,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 19:55:43,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 19:55:43,743 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 19:55:43,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 19:55:43,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 19:55:43,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 19:55:43,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 19:55:43,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 19:55:43,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 19:55:43,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 19:55:43,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 19:55:43,746 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 19:55:43,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 19:55:43,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 19:55:43,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 19:55:43,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 19:55:43,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:55:43,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 19:55:43,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 19:55:43,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 19:55:43,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 19:55:43,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 19:55:43,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 19:55:43,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 19:55:43,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 19:55:43,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 19:55:43,755 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 [2024-09-15 19:55:44,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 19:55:44,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 19:55:44,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 19:55:44,128 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 19:55:44,129 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 19:55:44,130 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-15 19:55:45,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 19:55:46,101 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 19:55:46,101 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_geo3-ll.c [2024-09-15 19:55:46,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/236f5e13f/971f9858467544deaf32972c1a23a133/FLAG67ac66216 [2024-09-15 19:55:46,122 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/236f5e13f/971f9858467544deaf32972c1a23a133 [2024-09-15 19:55:46,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 19:55:46,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 19:55:46,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 19:55:46,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 19:55:46,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 19:55:46,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ac0936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46, skipping insertion in model container [2024-09-15 19:55:46,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,159 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 19:55:46,332 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_geo3-ll.c[1055,1068] [2024-09-15 19:55:46,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:55:46,385 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 19:55:46,396 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_geo3-ll.c[1055,1068] [2024-09-15 19:55:46,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 19:55:46,434 INFO L204 MainTranslator]: Completed translation [2024-09-15 19:55:46,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46 WrapperNode [2024-09-15 19:55:46,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 19:55:46,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 19:55:46,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 19:55:46,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 19:55:46,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,471 INFO L138 Inliner]: procedures = 16, calls = 66, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 19:55:46,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 19:55:46,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 19:55:46,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 19:55:46,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 19:55:46,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,514 INFO L175 MemorySlicer]: Split 36 memory accesses to 8 slices as follows [2, 6, 4, 5, 8, 2, 6, 3]. 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, 2, 2, 2, 1, 1, 1]. [2024-09-15 19:55:46,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 19:55:46,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 19:55:46,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 19:55:46,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 19:55:46,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (1/1) ... [2024-09-15 19:55:46,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 19:55:46,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:55:46,585 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-15 19:55:46,591 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-15 19:55:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 19:55:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 19:55:46,649 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 19:55:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 19:55:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-15 19:55:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-15 19:55:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-15 19:55:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-15 19:55:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-15 19:55:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-09-15 19:55:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-09-15 19:55:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-15 19:55:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-15 19:55:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-15 19:55:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-15 19:55:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-15 19:55:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-15 19:55:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-15 19:55:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-09-15 19:55:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-09-15 19:55:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 19:55:46,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 19:55:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_30_to_38_0 [2024-09-15 19:55:46,654 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_30_to_38_0 [2024-09-15 19:55:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 19:55:46,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 19:55:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-15 19:55:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-15 19:55:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-15 19:55:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-15 19:55:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-15 19:55:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-15 19:55:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-09-15 19:55:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-09-15 19:55:46,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 19:55:46,656 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 19:55:46,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-15 19:55:46,779 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 19:55:46,785 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 19:55:47,028 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-15 19:55:47,029 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 19:55:47,054 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 19:55:47,057 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-15 19:55:47,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:55:47 BoogieIcfgContainer [2024-09-15 19:55:47,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 19:55:47,060 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 19:55:47,060 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 19:55:47,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 19:55:47,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 07:55:46" (1/3) ... [2024-09-15 19:55:47,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3ad6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:55:47, skipping insertion in model container [2024-09-15 19:55:47,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 07:55:46" (2/3) ... [2024-09-15 19:55:47,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3ad6f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 07:55:47, skipping insertion in model container [2024-09-15 19:55:47,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 07:55:47" (3/3) ... [2024-09-15 19:55:47,069 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_geo3-ll.c [2024-09-15 19:55:47,088 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 19:55:47,088 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-15 19:55:47,150 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 19:55:47,158 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;@5812f67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 19:55:47,159 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-15 19:55:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-15 19:55:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-15 19:55:47,172 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:55:47,173 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:55:47,174 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:55:47,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:55:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash 784733954, now seen corresponding path program 1 times [2024-09-15 19:55:47,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:55:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062813769] [2024-09-15 19:55:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:55:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:55:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:55:47,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711706450] [2024-09-15 19:55:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:55:47,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:55:47,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:55:47,440 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-15 19:55:47,442 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-15 19:55:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:55:47,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-09-15 19:55:47,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:55:47,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-15 19:55:47,724 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-15 19:55:47,729 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-15 19:55:47,749 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-15 19:55:47,762 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-15 19:55:47,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-09-15 19:55:48,002 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 39 treesize of output 23 [2024-09-15 19:55:48,013 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 21 treesize of output 13 [2024-09-15 19:55:48,028 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-15 19:55:48,110 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-15 19:55:48,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-15 19:55:48,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:55:48,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062813769] [2024-09-15 19:55:48,116 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:55:48,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711706450] [2024-09-15 19:55:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711706450] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 19:55:48,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 19:55:48,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 19:55:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122392563] [2024-09-15 19:55:48,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 19:55:48,127 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 19:55:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:55:48,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 19:55:48,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-15 19:55:48,155 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 19:55:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:55:48,452 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2024-09-15 19:55:48,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 19:55:48,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-15 19:55:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:55:48,461 INFO L225 Difference]: With dead ends: 58 [2024-09-15 19:55:48,462 INFO L226 Difference]: Without dead ends: 34 [2024-09-15 19:55:48,465 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-15 19:55:48,469 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 12 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-15 19:55:48,472 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-15 19:55:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-15 19:55:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-09-15 19:55:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-15 19:55:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2024-09-15 19:55:48,521 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2024-09-15 19:55:48,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:55:48,521 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2024-09-15 19:55:48,522 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 19:55:48,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:55:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2024-09-15 19:55:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-15 19:55:48,525 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:55:48,525 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:55:48,543 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-15 19:55:48,726 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-15 19:55:48,726 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:55:48,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:55:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash 646538741, now seen corresponding path program 1 times [2024-09-15 19:55:48,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:55:48,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56936238] [2024-09-15 19:55:48,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:55:48,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:55:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:55:48,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [759227798] [2024-09-15 19:55:48,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:55:48,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:55:48,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:55:48,824 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-15 19:55:48,825 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-15 19:55:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:55:49,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 152 conjuncts are in the unsatisfiable core [2024-09-15 19:55:49,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:55:49,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-15 19:55:49,929 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-15 19:55:49,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-15 19:55:49,943 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-15 19:55:49,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-15 19:55:49,960 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-15 19:55:50,509 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-15 19:55:50,526 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-15 19:55:51,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-09-15 19:55:51,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2024-09-15 19:55:51,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2024-09-15 19:55:51,477 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-15 19:55:51,487 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-15 19:55:51,572 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-15 19:55:51,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:56:17,585 WARN L876 $PredicateComparison]: unable to prove that (let ((.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)) (.cse3 (select (select |c_#memory_int#3| 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#7| c_func_to_recursive_line_30_to_38_0_~az.base) c_func_to_recursive_line_30_to_38_0_~az.offset)) (.cse1 (select (select |c_#memory_int#1| c_func_to_recursive_line_30_to_38_0_~a.base) c_func_to_recursive_line_30_to_38_0_~a.offset)) (.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 (= (mod (+ (* .cse0 .cse1) (* 18446744073709551615 .cse0 .cse2) (* .cse0 .cse0 .cse2) (* 18446744073709551615 .cse3 .cse4 .cse0)) 18446744073709551616) 0) (not (= (mod (+ (* .cse0 .cse2) (* 18446744073709551615 .cse3 .cse4) .cse1 (* 18446744073709551615 .cse2)) 18446744073709551616) 0)))) is different from true [2024-09-15 19:56:29,882 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (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|)) (.cse1 (select (select |c_#memory_int#7| |c_func_to_recursive_line_30_to_38_0_#in~az.base|) |c_func_to_recursive_line_30_to_38_0_#in~az.offset|)) (.cse2 (select (select |c_#memory_int#3| |c_func_to_recursive_line_30_to_38_0_#in~y.base|) |c_func_to_recursive_line_30_to_38_0_#in~y.offset|)) (.cse4 (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|)) (.cse3 (select (select |c_#memory_int#1| |c_func_to_recursive_line_30_to_38_0_#in~a.base|) |c_func_to_recursive_line_30_to_38_0_#in~a.offset|))) (or (not (= (mod (+ (* 18446744073709551615 .cse0) (* 18446744073709551615 .cse1 .cse2) .cse3 (* .cse4 .cse0)) 18446744073709551616) 0)) (= (mod (+ (* .cse4 18446744073709551615 .cse0) (* .cse4 .cse4 .cse0) (* .cse4 18446744073709551615 .cse1 .cse2) (* .cse4 .cse3)) 18446744073709551616) 0))) is different from true [2024-09-15 19:56:42,826 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int#7| |c_main_~#az~0.base|) |c_main_~#az~0.offset|)) (.cse3 (select (select |c_#memory_int#3| |c_main_~#y~0.base|) |c_main_~#y~0.offset|)) (.cse0 (select (select |c_#memory_int#4| |c_main_~#x~0.base|) |c_main_~#x~0.offset|)) (.cse1 (select (select |c_#memory_int#1| |c_main_~#a~0.base|) |c_main_~#a~0.offset|)) (.cse4 (select (select |c_#memory_int#6| |c_main_~#z~0.base|) |c_main_~#z~0.offset|))) (or (not (= (mod (+ (* 18446744073709551615 .cse0) .cse1 (* .cse2 18446744073709551615 .cse3) (* .cse0 .cse4)) 18446744073709551616) 0)) (= (mod (+ (* .cse0 .cse4 .cse4) (* .cse2 18446744073709551615 .cse3 .cse4) (* 18446744073709551615 .cse0 .cse4) (* .cse1 .cse4)) 18446744073709551616) 0))) is different from true [2024-09-15 19:56:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-09-15 19:56:42,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:56:42,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56936238] [2024-09-15 19:56:42,845 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:56:42,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759227798] [2024-09-15 19:56:42,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759227798] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-15 19:56:42,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-15 19:56:42,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2024-09-15 19:56:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186976319] [2024-09-15 19:56:42,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-15 19:56:42,846 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-15 19:56:42,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:56:42,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-15 19:56:42,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=355, Unknown=5, NotChecked=120, Total=552 [2024-09-15 19:56:42,848 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-15 19:56:58,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-15 19:57:02,915 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-15 19:57:24,282 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-15 19:57:28,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-15 19:57:45,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-15 19:57:49,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-15 19:57:53,997 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-15 19:57:58,003 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-15 19:58:02,007 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-15 19:58:06,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-15 19:58:10,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-15 19:58:14,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-15 19:58:18,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-15 19:58:22,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-15 19:58:26,071 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-15 19:58:30,076 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-15 19:58:34,162 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-15 19:58:38,168 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-15 19:58:42,207 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-15 19:58:46,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-09-15 19:58:52,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-09-15 19:58:54,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2024-09-15 19:58:54,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:58:54,789 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2024-09-15 19:58:54,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-15 19:58:54,790 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2024-09-15 19:58:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:58:54,793 INFO L225 Difference]: With dead ends: 67 [2024-09-15 19:58:54,793 INFO L226 Difference]: Without dead ends: 63 [2024-09-15 19:58:54,794 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 65.9s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=12, NotChecked=180, Total=1122 [2024-09-15 19:58:54,795 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 52 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 18 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 92.1s IncrementalHoareTripleChecker+Time [2024-09-15 19:58:54,795 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 129 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 239 Invalid, 22 Unknown, 213 Unchecked, 92.1s Time] [2024-09-15 19:58:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-15 19:58:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2024-09-15 19:58:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (14), 10 states have call predecessors, (14), 9 states have call successors, (14) [2024-09-15 19:58:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-09-15 19:58:54,819 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 22 [2024-09-15 19:58:54,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:58:54,820 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-09-15 19:58:54,820 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 9 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-15 19:58:54,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:58:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-09-15 19:58:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-15 19:58:54,821 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:58:54,821 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:58:54,831 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-15 19:58:55,025 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-15 19:58:55,026 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:58:55,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:58:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1703476452, now seen corresponding path program 1 times [2024-09-15 19:58:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:58:55,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641662026] [2024-09-15 19:58:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:58:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:58:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:58:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1209314958] [2024-09-15 19:58:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:58:55,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:58:55,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:58:55,120 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-15 19:58:55,126 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-15 19:58:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:58:55,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-15 19:58:55,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:58:55,339 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-15 19:58:55,342 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-15 19:58:55,349 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-15 19:58:55,356 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-15 19:58:55,395 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-15 19:58:55,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 25 treesize of output 17 [2024-09-15 19:58:55,833 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-15 19:58:55,846 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-15 19:58:55,856 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-15 19:59:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-15 19:59:03,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 19:59:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 19:59:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641662026] [2024-09-15 19:59:21,345 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 19:59:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209314958] [2024-09-15 19:59:21,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209314958] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 19:59:21,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-15 19:59:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-09-15 19:59:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88908281] [2024-09-15 19:59:21,346 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-15 19:59:21,346 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 19:59:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 19:59:21,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 19:59:21,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=82, Unknown=4, NotChecked=0, Total=110 [2024-09-15 19:59:21,348 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-15 19:59:25,352 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-15 19:59:29,367 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-15 19:59:33,377 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-15 19:59:37,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-15 19:59:37,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 19:59:37,959 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2024-09-15 19:59:37,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 19:59:37,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 22 [2024-09-15 19:59:37,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 19:59:37,961 INFO L225 Difference]: With dead ends: 65 [2024-09-15 19:59:37,962 INFO L226 Difference]: Without dead ends: 57 [2024-09-15 19:59:37,962 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=43, Invalid=135, Unknown=4, NotChecked=0, Total=182 [2024-09-15 19:59:37,963 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2024-09-15 19:59:37,963 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 62 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 4 Unknown, 0 Unchecked, 16.4s Time] [2024-09-15 19:59:37,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-15 19:59:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-15 19:59:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 38 states have internal predecessors, (39), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (14), 9 states have call predecessors, (14), 9 states have call successors, (14) [2024-09-15 19:59:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2024-09-15 19:59:37,995 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 22 [2024-09-15 19:59:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 19:59:37,995 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2024-09-15 19:59:37,996 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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-15 19:59:37,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:59:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2024-09-15 19:59:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-15 19:59:38,001 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 19:59:38,001 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 19:59:38,016 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-15 19:59:38,202 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-15 19:59:38,202 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 19:59:38,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 19:59:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 614548665, now seen corresponding path program 1 times [2024-09-15 19:59:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 19:59:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405894271] [2024-09-15 19:59:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:59:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 19:59:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-15 19:59:38,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137706663] [2024-09-15 19:59:38,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 19:59:38,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-15 19:59:38,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 19:59:38,325 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-15 19:59:38,325 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-15 19:59:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 19:59:38,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-09-15 19:59:38,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-15 19:59:38,571 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-15 19:59:38,578 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-15 19:59:38,595 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-15 19:59:38,604 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-15 19:59:43,013 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (|v_main_~#a~0.offset_BEFORE_CALL_5| Int) (|v_main_~#az~0.offset_BEFORE_CALL_5| Int) (|v_main_~#z~0.base_BEFORE_CALL_5| Int) (|v_main_~#az~0.base_BEFORE_CALL_5| Int) (|v_main_~#z~0.offset_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_int#7| |v_main_~#az~0.base_BEFORE_CALL_5|) |v_main_~#az~0.offset_BEFORE_CALL_5|) (* (select (select |c_#memory_int#6| |v_main_~#z~0.base_BEFORE_CALL_5|) |v_main_~#z~0.offset_BEFORE_CALL_5|) (select (select |c_#memory_int#1| |v_main_~#a~0.base_BEFORE_CALL_5|) |v_main_~#a~0.offset_BEFORE_CALL_5|)))) is different from true [2024-09-15 19:59:43,240 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 8 treesize of output 1 [2024-09-15 19:59:44,763 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-15 19:59:44,980 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 55 treesize of output 39 [2024-09-15 19:59:45,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-15 19:59:45,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 70 [2024-09-15 19:59:45,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-15 19:59:45,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 78 [2024-09-15 19:59:45,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-15 19:59:45,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 65 [2024-09-15 19:59:45,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-09-15 19:59:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2024-09-15 19:59:49,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-15 20:00:01,284 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_func_to_recursive_line_30_to_38_0_#in~z.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~x.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~x.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~az.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~z.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~a.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~az.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~y.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~a.offset_BEFORE_CALL_4| Int)) (let ((.cse0 (select (select |c_#memory_int#1| |v_func_to_recursive_line_30_to_38_0_#in~a.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~a.offset_BEFORE_CALL_4|)) (.cse3 (select (select |c_#memory_int#6| |v_func_to_recursive_line_30_to_38_0_#in~z.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~z.offset_BEFORE_CALL_4|)) (.cse2 (select (select |c_#memory_int#7| |v_func_to_recursive_line_30_to_38_0_#in~az.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~az.offset_BEFORE_CALL_4|))) (or (not (= (mod (let ((.cse1 (select (select |c_old(#memory_int#4)| |v_func_to_recursive_line_30_to_38_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~x.offset_BEFORE_CALL_4|))) (+ .cse0 (* 18446744073709551615 .cse1) (* 18446744073709551615 .cse2 (select (select |c_old(#memory_int#3)| |v_func_to_recursive_line_30_to_38_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~y.offset_BEFORE_CALL_4|)) (* .cse3 .cse1))) 18446744073709551616) 0)) (= (mod (let ((.cse4 (select (select |c_#memory_int#4| |v_func_to_recursive_line_30_to_38_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~x.offset_BEFORE_CALL_4|))) (+ (* 18446744073709551615 .cse4) .cse0 (* .cse4 .cse3) (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_30_to_38_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~y.offset_BEFORE_CALL_4|) 18446744073709551615 .cse2))) 18446744073709551616) 0)))) (or (= (mod (let ((.cse5 (select (select |c_old(#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|))) (+ (* (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|) .cse5) (select (select |c_#memory_int#1| |c_func_to_recursive_line_30_to_38_0_#in~a.base|) |c_func_to_recursive_line_30_to_38_0_#in~a.offset|) (* 18446744073709551615 .cse5) (* 18446744073709551615 (select (select |c_#memory_int#7| |c_func_to_recursive_line_30_to_38_0_#in~az.base|) |c_func_to_recursive_line_30_to_38_0_#in~az.offset|) (select (select |c_old(#memory_int#3)| |c_func_to_recursive_line_30_to_38_0_#in~y.base|) |c_func_to_recursive_line_30_to_38_0_#in~y.offset|)))) 18446744073709551616) 0) (forall ((|v_func_to_recursive_line_30_to_38_0_#in~z.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~x.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~y.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~x.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~az.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~z.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~a.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~az.base_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~y.offset_BEFORE_CALL_4| Int) (|v_func_to_recursive_line_30_to_38_0_#in~a.offset_BEFORE_CALL_4| Int)) (= (mod (let ((.cse6 (select (select |c_#memory_int#4| |v_func_to_recursive_line_30_to_38_0_#in~x.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~x.offset_BEFORE_CALL_4|))) (+ (* 18446744073709551615 .cse6) (select (select |c_#memory_int#1| |v_func_to_recursive_line_30_to_38_0_#in~a.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~a.offset_BEFORE_CALL_4|) (* .cse6 (select (select |c_#memory_int#6| |v_func_to_recursive_line_30_to_38_0_#in~z.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~z.offset_BEFORE_CALL_4|)) (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_30_to_38_0_#in~y.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~y.offset_BEFORE_CALL_4|) 18446744073709551615 (select (select |c_#memory_int#7| |v_func_to_recursive_line_30_to_38_0_#in~az.base_BEFORE_CALL_4|) |v_func_to_recursive_line_30_to_38_0_#in~az.offset_BEFORE_CALL_4|)))) 18446744073709551616) 0)))) is different from false [2024-09-15 20:00:02,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:00:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405894271] [2024-09-15 20:00:02,621 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-15 20:00:02,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137706663] [2024-09-15 20:00:02,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137706663] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-15 20:00:02,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-15 20:00:02,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2024-09-15 20:00:02,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654202916] [2024-09-15 20:00:02,622 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-15 20:00:02,622 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-15 20:00:02,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:00:02,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-15 20:00:02,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=401, Unknown=3, NotChecked=82, Total=552 [2024-09-15 20:00:02,624 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 18 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-15 20:00:06,629 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-15 20:00:09,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-15 20:00:11,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-15 20:00:15,255 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-15 20:00:19,267 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-15 20:00:25,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0]