./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c --full-output --witness-type correctness_witness --validate ../results/automizer-verification-files/SV-COMP24_unreach-call/recursified_ps2-ll.yml/witness-2.1.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d 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/AutomizerReachWitnessValidation.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c ../results/automizer-verification-files/SV-COMP24_unreach-call/recursified_ps2-ll.yml/witness-2.1.yml -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:46:59,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:46:59,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:46:59,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:46:59,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:46:59,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:46:59,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:46:59,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:46:59,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:46:59,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:46:59,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:46:59,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:46:59,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:46:59,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:46:59,773 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:46:59,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:46:59,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:46:59,774 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:46:59,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:46:59,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:46:59,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:46:59,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:46:59,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:46:59,779 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:46:59,779 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:46:59,780 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:46:59,780 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:46:59,780 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:46:59,780 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:46:59,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:46:59,781 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:46:59,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:46:59,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:46:59,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:46:59,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:46:59,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:46:59,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:46:59,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:46:59,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:46:59,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:46:59,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:46:59,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:46:59,784 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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-20 13:47:00,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:47:00,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:47:00,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:47:00,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:47:00,060 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:47:00,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c [2024-09-20 13:47:01,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:47:01,617 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:47:01,617 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c [2024-09-20 13:47:01,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/23bb15e04/d06a97c778cc47a295a380db729fd375/FLAGcb7ec838d [2024-09-20 13:47:01,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/23bb15e04/d06a97c778cc47a295a380db729fd375 [2024-09-20 13:47:01,998 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-20 13:47:01,998 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-20 13:47:01,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/recursified_ps2-ll.yml/witness-2.1.yml [2024-09-20 13:47:02,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:47:02,043 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-20 13:47:02,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:47:02,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:47:02,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:47:02,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:47:01" (1/2) ... [2024-09-20 13:47:02,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6622871a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:47:02, skipping insertion in model container [2024-09-20 13:47:02,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:47:01" (1/2) ... [2024-09-20 13:47:02,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5ec9fb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:47:02, skipping insertion in model container [2024-09-20 13:47:02,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:47:02" (2/2) ... [2024-09-20 13:47:02,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6622871a and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02, skipping insertion in model container [2024-09-20 13:47:02,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:47:02" (2/2) ... [2024-09-20 13:47:02,059 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-20 13:47:02,060 INFO L1541 ArrayList]: Function contract at [L31]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-20 13:47:02,078 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:47:02,223 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_ps2-ll.c[983,996] [2024-09-20 13:47:02,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:47:02,248 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-20 13:47:02,281 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_ps2-ll.c[983,996] [2024-09-20 13:47:02,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:47:02,304 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:47:02,305 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02 WrapperNode [2024-09-20 13:47:02,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:47:02,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:47:02,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:47:02,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:47:02,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,340 INFO L138 Inliner]: procedures = 16, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-09-20 13:47:02,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:47:02,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:47:02,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:47:02,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:47:02,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,373 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure __VERIFIER_assert is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-20 13:47:02,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:47:02,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:47:02,401 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:47:02,401 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:47:02,402 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (1/1) ... [2024-09-20 13:47:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:47:02,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:47:02,441 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-20 13:47:02,447 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-20 13:47:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:47:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-20 13:47:02,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-20 13:47:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-20 13:47:02,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:47:02,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:47:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-20 13:47:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_34_0 [2024-09-20 13:47:02,494 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_34_0 [2024-09-20 13:47:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 13:47:02,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 13:47:02,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 13:47:02,584 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:47:02,586 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:47:02,754 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-20 13:47:02,777 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-20 13:47:02,777 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:47:02,803 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:47:02,803 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 13:47:02,806 INFO L201 PluginConnector]: Adding new model witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:47:02 BoogieIcfgContainer [2024-09-20 13:47:02,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:47:02,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:47:02,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:47:02,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:47:02,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:47:01" (1/4) ... [2024-09-20 13:47:02,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c666e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:47:02, skipping insertion in model container [2024-09-20 13:47:02,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:47:02" (2/4) ... [2024-09-20 13:47:02,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c666e0 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:47:02, skipping insertion in model container [2024-09-20 13:47:02,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:47:02" (3/4) ... [2024-09-20 13:47:02,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c666e0 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:47:02, skipping insertion in model container [2024-09-20 13:47:02,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:47:02" (4/4) ... [2024-09-20 13:47:02,817 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_ps2-ll.c [2024-09-20 13:47:02,833 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:47:02,834 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-09-20 13:47:02,881 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:47:02,890 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=None, 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;@4049a4b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:47:02,891 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-20 13:47:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 13:47:02,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-20 13:47:02,902 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:47:02,903 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-20 13:47:02,904 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:47:02,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:47:02,909 INFO L85 PathProgramCache]: Analyzing trace with hash 74160820, now seen corresponding path program 1 times [2024-09-20 13:47:02,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:47:02,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556937060] [2024-09-20 13:47:02,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:47:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:47:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:47:03,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1589331480] [2024-09-20 13:47:03,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:47:03,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:47:03,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:47:03,058 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-20 13:47:03,059 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-20 13:47:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:47:03,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-20 13:47:03,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:47:03,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:03,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:03,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:03,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:03,497 INFO L349 Elim1Store]: treesize reduction 188, result has 24.5 percent of original size [2024-09-20 13:47:03,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 333 [2024-09-20 13:47:03,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2024-09-20 13:47:03,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2024-09-20 13:47:03,653 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-20 13:47:03,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 110 treesize of output 100 [2024-09-20 13:47:03,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2024-09-20 13:47:03,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2024-09-20 13:47:03,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2024-09-20 13:47:04,170 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,209 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 237 [2024-09-20 13:47:04,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,485 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,486 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,495 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 279 [2024-09-20 13:47:04,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:04,692 INFO L349 Elim1Store]: treesize reduction 54, result has 23.9 percent of original size [2024-09-20 13:47:04,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 271 treesize of output 250 [2024-09-20 13:47:05,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-09-20 13:47:05,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:05,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:05,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:05,528 INFO L349 Elim1Store]: treesize reduction 191, result has 20.7 percent of original size [2024-09-20 13:47:05,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 343 treesize of output 425 [2024-09-20 13:47:06,095 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-20 13:47:06,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 11 [2024-09-20 13:47:06,255 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-20 13:47:06,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 11 [2024-09-20 13:47:06,902 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-09-20 13:47:06,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 11 [2024-09-20 13:47:08,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:08,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:08,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:08,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 300 [2024-09-20 13:47:09,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 106 [2024-09-20 13:47:09,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 297 [2024-09-20 13:47:09,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2024-09-20 13:47:09,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 196 [2024-09-20 13:47:09,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:09,582 INFO L349 Elim1Store]: treesize reduction 201, result has 12.2 percent of original size [2024-09-20 13:47:09,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 12933 treesize of output 12761 [2024-09-20 13:47:11,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1014 treesize of output 1015 [2024-09-20 13:47:11,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,171 INFO L349 Elim1Store]: treesize reduction 149, result has 22.8 percent of original size [2024-09-20 13:47:11,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 3714 treesize of output 3394 [2024-09-20 13:47:11,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 134 [2024-09-20 13:47:11,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:11,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 491 treesize of output 496 [2024-09-20 13:47:13,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:16,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:47:16,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 1 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 170 case distinctions, treesize of input 23065 treesize of output 21825 [2024-09-20 13:47:16,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1232 treesize of output 1230 [2024-09-20 13:47:17,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1230 treesize of output 1228 [2024-09-20 13:47:17,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1228 treesize of output 1226 [2024-09-20 13:47:17,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1226 treesize of output 1224 [2024-09-20 13:47:17,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1224 treesize of output 1222 [2024-09-20 13:47:17,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1222 treesize of output 1220 [2024-09-20 13:47:18,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1220 treesize of output 1218 [2024-09-20 13:47:19,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:47:19,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2024-09-20 13:47:34,633 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-20 13:47:34,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:47:34,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:47:34,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556937060] [2024-09-20 13:47:34,634 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:47:34,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589331480] [2024-09-20 13:47:34,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589331480] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:47:34,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:47:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-20 13:47:34,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614928710] [2024-09-20 13:47:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:47:34,639 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-20 13:47:34,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:47:34,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-20 13:47:34,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:47:34,662 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:47:44,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 13:47:48,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 13:47:49,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:47:49,358 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-09-20 13:47:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 13:47:49,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-20 13:47:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:47:49,365 INFO L225 Difference]: With dead ends: 27 [2024-09-20 13:47:49,366 INFO L226 Difference]: Without dead ends: 25 [2024-09-20 13:47:49,366 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2024-09-20 13:47:49,369 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-09-20 13:47:49,369 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 80 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 8.8s Time] [2024-09-20 13:47:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-20 13:47:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-09-20 13:47:49,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 18 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 13:47:49,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-09-20 13:47:49,393 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 5 [2024-09-20 13:47:49,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:47:49,393 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-09-20 13:47:49,393 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:47:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-09-20 13:47:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-20 13:47:49,395 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:47:49,395 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:47:49,407 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 13:47:49,595 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-20 13:47:49,596 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:47:49,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:47:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1712682790, now seen corresponding path program 1 times [2024-09-20 13:47:49,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:47:49,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709170606] [2024-09-20 13:47:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:47:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:47:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:47:49,688 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-20 13:47:49,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:47:49,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709170606] [2024-09-20 13:47:49,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709170606] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:47:49,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:47:49,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:47:49,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097553183] [2024-09-20 13:47:49,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:47:49,689 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:47:49,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:47:49,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:47:49,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:47:49,690 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:47:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:47:49,705 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-09-20 13:47:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:47:49,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-09-20 13:47:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:47:49,708 INFO L225 Difference]: With dead ends: 23 [2024-09-20 13:47:49,708 INFO L226 Difference]: Without dead ends: 23 [2024-09-20 13:47:49,708 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-20 13:47:49,709 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:47:49,709 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 31 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:47:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-20 13:47:49,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-20 13:47:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 13:47:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-09-20 13:47:49,713 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 8 [2024-09-20 13:47:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:47:49,714 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-09-20 13:47:49,714 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:47:49,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-09-20 13:47:49,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-20 13:47:49,715 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:47:49,715 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:47:49,715 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 13:47:49,715 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:47:49,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:47:49,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1712682629, now seen corresponding path program 1 times [2024-09-20 13:47:49,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:47:49,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492345112] [2024-09-20 13:47:49,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:47:49,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:47:49,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:47:49,854 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-20 13:47:49,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:47:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492345112] [2024-09-20 13:47:49,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492345112] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:47:49,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:47:49,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:47:49,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875870881] [2024-09-20 13:47:49,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:47:49,859 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:47:49,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:47:49,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:47:49,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:47:49,860 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:47:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:47:49,875 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-09-20 13:47:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:47:49,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-09-20 13:47:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:47:49,876 INFO L225 Difference]: With dead ends: 21 [2024-09-20 13:47:49,876 INFO L226 Difference]: Without dead ends: 21 [2024-09-20 13:47:49,876 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-20 13:47:49,877 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:47:49,877 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:47:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-20 13:47:49,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-20 13:47:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 13:47:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2024-09-20 13:47:49,883 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 8 [2024-09-20 13:47:49,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:47:49,884 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2024-09-20 13:47:49,887 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-20 13:47:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2024-09-20 13:47:49,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-20 13:47:49,888 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:47:49,888 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:47:49,888 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 13:47:49,888 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:47:49,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:47:49,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1570114581, now seen corresponding path program 1 times [2024-09-20 13:47:49,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:47:49,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155873255] [2024-09-20 13:47:49,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:47:49,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:47:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:47:49,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500159845] [2024-09-20 13:47:49,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:47:49,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:47:49,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:47:49,963 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-20 13:47:49,967 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-20 13:47:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:47:50,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-09-20 13:47:50,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:47:50,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:50,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:50,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:50,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:50,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:50,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:50,773 INFO L349 Elim1Store]: treesize reduction 384, result has 24.0 percent of original size [2024-09-20 13:47:50,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 11 new quantified variables, introduced 8 case distinctions, treesize of input 286 treesize of output 1051 [2024-09-20 13:47:50,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 29 [2024-09-20 13:47:51,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 29 [2024-09-20 13:47:51,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 29 [2024-09-20 13:47:51,249 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-20 13:47:51,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 76 treesize of output 70 [2024-09-20 13:47:51,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 97 treesize of output 148 [2024-09-20 13:47:51,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 97 treesize of output 148 [2024-09-20 13:47:51,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 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 97 treesize of output 148 [2024-09-20 13:47:54,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:54,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:54,659 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:54,680 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:54,835 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:54,864 INFO L224 Elim1Store]: Index analysis took 476 ms [2024-09-20 13:47:54,988 INFO L349 Elim1Store]: treesize reduction 73, result has 9.9 percent of original size [2024-09-20 13:47:54,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 13 case distinctions, treesize of input 876 treesize of output 1075 [2024-09-20 13:47:56,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:56,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:56,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:56,657 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:56,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:56,699 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:56,719 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:56,750 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:56,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:56,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:56,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:56,793 INFO L224 Elim1Store]: Index analysis took 221 ms [2024-09-20 13:47:56,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 590 treesize of output 787 [2024-09-20 13:47:57,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:57,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:57,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,249 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,262 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,264 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,328 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,339 INFO L224 Elim1Store]: Index analysis took 169 ms [2024-09-20 13:47:57,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 609 treesize of output 714 [2024-09-20 13:47:57,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:57,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:57,871 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,877 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,884 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,890 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,935 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,952 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,967 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,967 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,970 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,976 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,984 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:57,984 INFO L224 Elim1Store]: Index analysis took 122 ms [2024-09-20 13:47:57,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 254 [2024-09-20 13:47:58,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:58,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:47:58,112 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:58,204 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:58,237 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:58,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:58,278 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:58,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:58,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:47:58,291 INFO L224 Elim1Store]: Index analysis took 182 ms [2024-09-20 13:47:58,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 522 treesize of output 627 [2024-09-20 13:48:04,513 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:04,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:04,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:04,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:04,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:04,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:04,522 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:04,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 169 [2024-09-20 13:48:04,536 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:04,539 INFO L349 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2024-09-20 13:48:04,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 29 [2024-09-20 13:48:04,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-09-20 13:48:05,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:05,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:05,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:05,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:05,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:05,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:05,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:05,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:05,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 84 [2024-09-20 13:48:06,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:06,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:06,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:06,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2024-09-20 13:48:06,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-09-20 13:48:06,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-09-20 13:48:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:48:06,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:48:06,471 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_125 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_ArrVal_125))) (let ((.cse6 (select .cse5 c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse3 (select .cse6 c_func_to_recursive_line_26_to_34_0_~y.offset))) (let ((.cse1 (store .cse5 c_func_to_recursive_line_26_to_34_0_~y.base (store .cse6 c_func_to_recursive_line_26_to_34_0_~y.offset (+ .cse3 1))))) (let ((.cse2 (select .cse1 c_func_to_recursive_line_26_to_34_0_~x.base))) (let ((.cse4 (select .cse2 c_func_to_recursive_line_26_to_34_0_~x.offset))) (= (let ((.cse0 (select (select (store .cse1 c_func_to_recursive_line_26_to_34_0_~x.base (store .cse2 c_func_to_recursive_line_26_to_34_0_~x.offset (+ .cse3 .cse4 1))) c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (+ (* .cse0 .cse0) .cse0)) (+ (* 2 .cse4) 2 (* 2 .cse3)))))))))) is different from false [2024-09-20 13:48:06,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:48:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155873255] [2024-09-20 13:48:06,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:48:06,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500159845] [2024-09-20 13:48:06,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500159845] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:48:06,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:48:06,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-09-20 13:48:06,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142158471] [2024-09-20 13:48:06,511 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-20 13:48:06,511 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-20 13:48:06,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:48:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-20 13:48:06,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-09-20 13:48:06,515 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 13:48:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:48:06,748 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-09-20 13:48:06,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 13:48:06,748 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-20 13:48:06,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:48:06,750 INFO L225 Difference]: With dead ends: 42 [2024-09-20 13:48:06,750 INFO L226 Difference]: Without dead ends: 42 [2024-09-20 13:48:06,751 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=160, Unknown=1, NotChecked=26, Total=240 [2024-09-20 13:48:06,752 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:48:06,753 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 57 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:48:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-20 13:48:06,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2024-09-20 13:48:06,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.12) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-20 13:48:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-09-20 13:48:06,766 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 15 [2024-09-20 13:48:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:48:06,766 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-09-20 13:48:06,766 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-20 13:48:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-09-20 13:48:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-20 13:48:06,767 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:48:06,767 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:48:06,785 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 13:48:06,971 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:48:06,972 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:48:06,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:48:06,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1571605412, now seen corresponding path program 1 times [2024-09-20 13:48:06,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:48:06,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467747432] [2024-09-20 13:48:06,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:48:06,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:48:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:48:07,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266493846] [2024-09-20 13:48:07,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:48:07,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:48:07,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:48:07,016 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-20 13:48:07,018 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-20 13:48:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:48:07,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-20 13:48:07,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:48:07,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:07,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:07,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:07,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:07,296 INFO L349 Elim1Store]: treesize reduction 188, result has 24.5 percent of original size [2024-09-20 13:48:07,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 333 [2024-09-20 13:48:07,341 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-20 13:48:07,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 77 treesize of output 73 [2024-09-20 13:48:07,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2024-09-20 13:48:07,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2024-09-20 13:48:07,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2024-09-20 13:48:07,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2024-09-20 13:48:07,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2024-09-20 13:48:08,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:08,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:08,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:08,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:08,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:08,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:08,528 INFO L349 Elim1Store]: treesize reduction 27, result has 38.6 percent of original size [2024-09-20 13:48:08,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 623 treesize of output 570 [2024-09-20 13:48:11,715 INFO L349 Elim1Store]: treesize reduction 8, result has 98.7 percent of original size [2024-09-20 13:48:11,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 5780 treesize of output 5600 [2024-09-20 13:48:11,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 430 treesize of output 428 [2024-09-20 13:48:11,848 INFO L349 Elim1Store]: treesize reduction 11, result has 50.0 percent of original size [2024-09-20 13:48:11,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 428 treesize of output 435 [2024-09-20 13:48:12,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-09-20 13:48:12,143 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-09-20 13:48:12,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 9 [2024-09-20 13:48:14,901 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-20 13:48:14,901 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:48:14,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:48:14,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467747432] [2024-09-20 13:48:14,901 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:48:14,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266493846] [2024-09-20 13:48:14,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266493846] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:48:14,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:48:14,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-20 13:48:14,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937064865] [2024-09-20 13:48:14,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:48:14,902 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:48:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:48:14,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:48:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:48:14,903 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-20 13:48:15,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:48:15,039 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-09-20 13:48:15,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:48:15,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-09-20 13:48:15,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:48:15,040 INFO L225 Difference]: With dead ends: 43 [2024-09-20 13:48:15,040 INFO L226 Difference]: Without dead ends: 39 [2024-09-20 13:48:15,041 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:48:15,041 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:48:15,041 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 25 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:48:15,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-20 13:48:15,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-20 13:48:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-09-20 13:48:15,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-09-20 13:48:15,047 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 15 [2024-09-20 13:48:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:48:15,047 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-09-20 13:48:15,047 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-20 13:48:15,047 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-09-20 13:48:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-20 13:48:15,048 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:48:15,048 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2024-09-20 13:48:15,063 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 13:48:15,252 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:48:15,253 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:48:15,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:48:15,253 INFO L85 PathProgramCache]: Analyzing trace with hash -634424222, now seen corresponding path program 2 times [2024-09-20 13:48:15,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:48:15,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925302431] [2024-09-20 13:48:15,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:48:15,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:48:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:48:15,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143088084] [2024-09-20 13:48:15,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 13:48:15,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:48:15,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:48:15,309 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-20 13:48:15,313 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-20 13:48:15,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 13:48:15,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 13:48:15,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-09-20 13:48:15,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:48:15,461 INFO L349 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2024-09-20 13:48:15,462 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2024-09-20 13:48:15,502 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2024-09-20 13:48:15,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 46 [2024-09-20 13:48:15,553 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-20 13:48:15,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 19 [2024-09-20 13:48:15,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 38 treesize of output 36 [2024-09-20 13:48:15,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2024-09-20 13:48:15,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2024-09-20 13:48:15,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:15,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 23 [2024-09-20 13:48:15,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 [2024-09-20 13:48:15,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:15,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-20 13:48:15,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:15,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:15,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:15,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 60 [2024-09-20 13:48:15,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:15,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:15,641 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-20 13:48:15,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-09-20 13:48:15,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2024-09-20 13:48:15,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 136 treesize of output 129 [2024-09-20 13:48:15,672 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-09-20 13:48:15,715 INFO L349 Elim1Store]: treesize reduction 53, result has 41.1 percent of original size [2024-09-20 13:48:15,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 63 [2024-09-20 13:48:15,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-20 13:48:15,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 [2024-09-20 13:48:15,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:15,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:15,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:15,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2024-09-20 13:48:15,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-09-20 13:48:15,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-09-20 13:48:16,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:16,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:16,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:16,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2024-09-20 13:48:16,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-09-20 13:48:16,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-09-20 13:48:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:48:16,257 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:48:16,329 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_235 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_ArrVal_235))) (let ((.cse6 (select .cse5 c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse3 (select .cse6 c_func_to_recursive_line_26_to_34_0_~y.offset))) (let ((.cse1 (store .cse5 c_func_to_recursive_line_26_to_34_0_~y.base (store .cse6 c_func_to_recursive_line_26_to_34_0_~y.offset (+ .cse3 1))))) (let ((.cse2 (select .cse1 c_func_to_recursive_line_26_to_34_0_~x.base))) (let ((.cse4 (select .cse2 c_func_to_recursive_line_26_to_34_0_~x.offset))) (= (let ((.cse0 (select (select (store .cse1 c_func_to_recursive_line_26_to_34_0_~x.base (store .cse2 c_func_to_recursive_line_26_to_34_0_~x.offset (+ .cse3 .cse4 1))) c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (+ .cse0 (* .cse0 .cse0))) (+ (* .cse3 2) 2 (* .cse4 2)))))))))) is different from false [2024-09-20 13:48:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:48:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925302431] [2024-09-20 13:48:16,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:48:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143088084] [2024-09-20 13:48:16,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143088084] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:48:16,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:48:16,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-09-20 13:48:16,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499116109] [2024-09-20 13:48:16,352 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-20 13:48:16,352 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 13:48:16,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:48:16,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 13:48:16,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2024-09-20 13:48:16,370 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 12 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-20 13:48:16,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:48:16,670 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2024-09-20 13:48:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 13:48:16,671 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-09-20 13:48:16,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:48:16,672 INFO L225 Difference]: With dead ends: 56 [2024-09-20 13:48:16,672 INFO L226 Difference]: Without dead ends: 56 [2024-09-20 13:48:16,672 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=275, Unknown=1, NotChecked=34, Total=380 [2024-09-20 13:48:16,673 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 26 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 13:48:16,673 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 81 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 13:48:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-20 13:48:16,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-09-20 13:48:16,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 37 states have internal predecessors, (38), 8 states have call successors, (8), 7 states have call predecessors, (8), 9 states have return successors, (13), 8 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-20 13:48:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-09-20 13:48:16,679 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 25 [2024-09-20 13:48:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:48:16,679 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-09-20 13:48:16,679 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 4 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-20 13:48:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-09-20 13:48:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-20 13:48:16,680 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:48:16,680 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:48:16,694 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 13:48:16,880 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:48:16,881 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:48:16,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:48:16,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1222779608, now seen corresponding path program 1 times [2024-09-20 13:48:16,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:48:16,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091280266] [2024-09-20 13:48:16,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:48:16,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:48:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:48:16,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966190082] [2024-09-20 13:48:16,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:48:16,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:48:16,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:48:16,919 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-20 13:48:16,921 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-20 13:48:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:48:17,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-09-20 13:48:17,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:48:17,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 [2024-09-20 13:48:17,132 INFO L349 Elim1Store]: treesize reduction 88, result has 39.3 percent of original size [2024-09-20 13:48:17,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 105 [2024-09-20 13:48:17,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-09-20 13:48:17,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2024-09-20 13:48:17,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 9 [2024-09-20 13:48:17,247 INFO L349 Elim1Store]: treesize reduction 51, result has 20.3 percent of original size [2024-09-20 13:48:17,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 49 treesize of output 33 [2024-09-20 13:48:17,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 11 [2024-09-20 13:48:17,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2024-09-20 13:48:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-20 13:48:17,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:48:18,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:48:18,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091280266] [2024-09-20 13:48:18,120 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:48:18,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966190082] [2024-09-20 13:48:18,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966190082] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:48:18,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:48:18,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-09-20 13:48:18,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17615188] [2024-09-20 13:48:18,120 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-20 13:48:18,121 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-20 13:48:18,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:48:18,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-20 13:48:18,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-09-20 13:48:18,124 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 13:48:18,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:48:18,420 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2024-09-20 13:48:18,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-20 13:48:18,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-09-20 13:48:18,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:48:18,421 INFO L225 Difference]: With dead ends: 52 [2024-09-20 13:48:18,422 INFO L226 Difference]: Without dead ends: 38 [2024-09-20 13:48:18,422 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-09-20 13:48:18,422 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:48:18,423 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 22 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:48:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-20 13:48:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-09-20 13:48:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 8 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 13:48:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-09-20 13:48:18,426 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 27 [2024-09-20 13:48:18,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:48:18,427 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-09-20 13:48:18,427 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.111111111111111) internal successors, (19), 10 states have internal predecessors, (19), 3 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-20 13:48:18,427 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-09-20 13:48:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-20 13:48:18,428 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:48:18,428 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2024-09-20 13:48:18,441 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-20 13:48:18,628 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-20 13:48:18,629 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:48:18,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:48:18,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1868827673, now seen corresponding path program 3 times [2024-09-20 13:48:18,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:48:18,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219318353] [2024-09-20 13:48:18,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:48:18,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:48:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:48:18,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [778152392] [2024-09-20 13:48:18,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 13:48:18,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:48:18,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:48:18,698 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:48:18,702 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-20 13:48:19,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-20 13:48:19,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 13:48:19,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 153 conjuncts are in the unsatisfiable core [2024-09-20 13:48:19,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:48:19,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:19,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:19,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:19,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:19,160 INFO L349 Elim1Store]: treesize reduction 188, result has 24.5 percent of original size [2024-09-20 13:48:19,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 333 [2024-09-20 13:48:19,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2024-09-20 13:48:19,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2024-09-20 13:48:19,209 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-20 13:48:19,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 95 treesize of output 87 [2024-09-20 13:48:19,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 29 [2024-09-20 13:48:19,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 29 [2024-09-20 13:48:19,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 33 treesize of output 29 [2024-09-20 13:48:19,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:19,582 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:19,586 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:19,587 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:19,597 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:19,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 212 [2024-09-20 13:48:19,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:19,677 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:19,681 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:19,682 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:19,691 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:19,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 244 [2024-09-20 13:48:20,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:20,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:20,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:20,172 INFO L349 Elim1Store]: treesize reduction 122, result has 17.0 percent of original size [2024-09-20 13:48:20,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 2074 treesize of output 1974 [2024-09-20 13:48:20,225 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:20,232 INFO L349 Elim1Store]: treesize reduction 69, result has 1.4 percent of original size [2024-09-20 13:48:20,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 21 [2024-09-20 13:48:20,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 31 [2024-09-20 13:48:20,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:20,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:20,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:20,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:20,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:20,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:20,787 INFO L349 Elim1Store]: treesize reduction 112, result has 36.0 percent of original size [2024-09-20 13:48:20,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 131 [2024-09-20 13:48:20,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-09-20 13:48:20,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-09-20 13:48:20,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 50 [2024-09-20 13:48:20,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 50 [2024-09-20 13:48:20,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 83 [2024-09-20 13:48:20,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 113 [2024-09-20 13:48:21,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 171 [2024-09-20 13:48:21,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 119 [2024-09-20 13:48:21,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:21,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:21,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:21,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2024-09-20 13:48:21,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-09-20 13:48:21,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 11 [2024-09-20 13:48:21,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:21,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:21,660 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2024-09-20 13:48:21,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 234 treesize of output 98 [2024-09-20 13:48:21,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-20 13:48:21,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2024-09-20 13:48:21,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2024-09-20 13:48:21,819 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:48:21,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:48:22,223 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_376 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_ArrVal_376))) (let ((.cse14 (select .cse13 c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse12 (select .cse14 c_func_to_recursive_line_26_to_34_0_~y.offset))) (let ((.cse8 (store .cse14 c_func_to_recursive_line_26_to_34_0_~y.offset (+ .cse12 1)))) (let ((.cse10 (store .cse13 c_func_to_recursive_line_26_to_34_0_~y.base .cse8))) (let ((.cse6 (let ((.cse11 (select .cse10 c_func_to_recursive_line_26_to_34_0_~x.base))) (store .cse11 c_func_to_recursive_line_26_to_34_0_~x.offset (+ (select .cse11 c_func_to_recursive_line_26_to_34_0_~x.offset) .cse12 1))))) (let ((.cse1 (let ((.cse9 (select (store .cse10 c_func_to_recursive_line_26_to_34_0_~x.base .cse6) c_func_to_recursive_line_26_to_34_0_~c.base))) (store .cse9 c_func_to_recursive_line_26_to_34_0_~c.offset (+ (select .cse9 c_func_to_recursive_line_26_to_34_0_~c.offset) 1))))) (let ((.cse7 (select (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base .cse8) c_func_to_recursive_line_26_to_34_0_~x.base .cse6) c_func_to_recursive_line_26_to_34_0_~c.base .cse1) c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse5 (select .cse7 c_func_to_recursive_line_26_to_34_0_~y.offset))) (let ((.cse2 (store .cse7 c_func_to_recursive_line_26_to_34_0_~y.offset (+ .cse5 1)))) (let ((.cse3 (select (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~x.base .cse6) c_func_to_recursive_line_26_to_34_0_~c.base .cse1) c_func_to_recursive_line_26_to_34_0_~y.base .cse2) c_func_to_recursive_line_26_to_34_0_~x.base))) (let ((.cse4 (select .cse3 c_func_to_recursive_line_26_to_34_0_~x.offset))) (= (let ((.cse0 (select (select (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base .cse1) c_func_to_recursive_line_26_to_34_0_~y.base .cse2) c_func_to_recursive_line_26_to_34_0_~x.base (store .cse3 c_func_to_recursive_line_26_to_34_0_~x.offset (+ .cse4 .cse5 1))) c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (+ .cse0 (* .cse0 .cse0))) (+ (* 2 .cse5) 2 (* .cse4 2)))))))))))))))) is different from false [2024-09-20 13:48:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:48:22,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219318353] [2024-09-20 13:48:22,323 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:48:22,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778152392] [2024-09-20 13:48:22,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778152392] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:48:22,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:48:22,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-09-20 13:48:22,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35899595] [2024-09-20 13:48:22,324 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-20 13:48:22,324 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-20 13:48:22,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:48:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-20 13:48:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=391, Unknown=5, NotChecked=40, Total=506 [2024-09-20 13:48:22,325 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 13:48:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:48:23,094 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-09-20 13:48:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-20 13:48:23,095 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-09-20 13:48:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:48:23,096 INFO L225 Difference]: With dead ends: 48 [2024-09-20 13:48:23,096 INFO L226 Difference]: Without dead ends: 48 [2024-09-20 13:48:23,096 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=120, Invalid=634, Unknown=6, NotChecked=52, Total=812 [2024-09-20 13:48:23,097 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 8 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-20 13:48:23,097 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 110 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 371 Invalid, 4 Unknown, 0 Unchecked, 0.4s Time] [2024-09-20 13:48:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-20 13:48:23,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-09-20 13:48:23,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.0) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 13:48:23,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2024-09-20 13:48:23,101 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 35 [2024-09-20 13:48:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:48:23,101 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-09-20 13:48:23,102 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 6 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-20 13:48:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2024-09-20 13:48:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-20 13:48:23,103 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:48:23,103 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2024-09-20 13:48:23,110 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-20 13:48:23,303 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:48:23,304 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0REQUIRES_VIOLATIONPRE_CONDITION, func_to_recursive_line_26_to_34_0Err0REQUIRES_VIOLATIONPRE_CONDITION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-09-20 13:48:23,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:48:23,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1753459472, now seen corresponding path program 4 times [2024-09-20 13:48:23,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:48:23,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678760012] [2024-09-20 13:48:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:48:23,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:48:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:48:23,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332725816] [2024-09-20 13:48:23,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 13:48:23,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:48:23,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:48:23,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:48:23,399 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-20 13:48:24,090 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 13:48:24,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 13:48:24,094 WARN L260 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 175 conjuncts are in the unsatisfiable core [2024-09-20 13:48:24,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:48:24,693 INFO L349 Elim1Store]: treesize reduction 417, result has 37.5 percent of original size [2024-09-20 13:48:24,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 1962 treesize of output 910 [2024-09-20 13:48:36,061 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 13:48:48,575 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 13:48:53,950 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:53,955 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:53,979 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-09-20 13:48:53,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 606 treesize of output 576 [2024-09-20 13:48:54,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 10 [2024-09-20 13:48:54,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:48:54,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 36 treesize of output 40 [2024-09-20 13:48:54,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 16 [2024-09-20 13:48:54,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 10 [2024-09-20 13:48:54,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:48:54,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 363 treesize of output 355 [2024-09-20 13:48:54,388 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:54,393 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:54,409 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-09-20 13:48:54,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 350 [2024-09-20 13:48:54,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-09-20 13:48:54,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2024-09-20 13:48:54,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:48:54,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 60 [2024-09-20 13:48:54,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:48:54,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 104 treesize of output 94 [2024-09-20 13:48:54,863 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:48:54,876 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-09-20 13:48:54,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 283 treesize of output 247 [2024-09-20 13:49:11,099 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 13:49:19,151 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 13:49:27,184 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 13:49:27,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2024-09-20 13:49:47,237 WARN L293 SmtUtils]: Spent 20.01s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-09-20 13:49:47,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:49:47,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 236 treesize of output 218 [2024-09-20 13:49:57,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:49:57,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:49:57,208 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-09-20 13:49:57,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 637 treesize of output 615 [2024-09-20 13:49:57,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2024-09-20 13:49:57,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:49:57,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 30 [2024-09-20 13:49:57,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-20 13:49:57,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:49:57,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 48 [2024-09-20 13:49:57,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-09-20 13:49:57,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:49:57,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 113 treesize of output 111 [2024-09-20 13:49:57,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2024-09-20 13:49:57,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 [2024-09-20 13:49:57,394 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-09-20 13:49:57,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 102 treesize of output 88 [2024-09-20 13:50:05,423 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 13:50:05,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:50:05,495 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-20 13:50:05,518 INFO L349 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2024-09-20 13:50:05,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 684 treesize of output 629 [2024-09-20 13:50:05,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2024-09-20 13:50:05,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:50:05,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 treesize of output 33 [2024-09-20 13:50:05,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2024-09-20 13:50:05,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:50:05,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 34 [2024-09-20 13:50:05,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 7 [2024-09-20 13:50:05,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2024-09-20 13:50:05,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 13:50:05,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 126 treesize of output 122 [2024-09-20 13:50:09,997 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_func_to_recursive_line_26_to_34_0_~x.offset c_func_to_recursive_line_26_to_34_0_~c.offset)) (.cse1 (= c_func_to_recursive_line_26_to_34_0_~x.base c_func_to_recursive_line_26_to_34_0_~c.base))) (let ((.cse10 (not .cse1)) (.cse26 (not .cse0))) (let ((.cse79 (= c_func_to_recursive_line_26_to_34_0_~y.offset c_func_to_recursive_line_26_to_34_0_~x.offset)) (.cse80 (= c_func_to_recursive_line_26_to_34_0_~x.base c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse8 (= c_func_to_recursive_line_26_to_34_0_~c.base c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse9 (= c_func_to_recursive_line_26_to_34_0_~y.offset c_func_to_recursive_line_26_to_34_0_~c.offset)) (.cse7 (or .cse10 .cse26)) (.cse6 (select (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~x.base) c_func_to_recursive_line_26_to_34_0_~x.offset))) (or (let ((.cse5 (not .cse80))) (and (let ((.cse4 (* 2 .cse6)) (.cse3 (select (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (or (and .cse0 .cse1 (let ((.cse2 (* .cse3 .cse3))) (or (and (= (+ .cse2 2 .cse3) .cse4) .cse5) (and (= (+ (div (+ .cse2 (* (- 1) .cse3)) 2) .cse3 1) .cse6) (= (mod (+ .cse2 .cse3) 2) 0))))) (and .cse7 (or (and .cse8 .cse9 (or (and .cse10 (exists ((v_DerPreprocessor_279 (Array Int Int)) (v_DerPreprocessor_266 (Array Int Int)) (v_DerPreprocessor_264 (Array Int Int)) (v_DerPreprocessor_265 (Array Int Int)) (v_DerPreprocessor_284 (Array Int Int)) (v_DerPreprocessor_282 (Array Int Int)) (v_DerPreprocessor_283 (Array Int Int)) (v_DerPreprocessor_280 (Array Int Int)) (v_DerPreprocessor_281 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_279) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_280) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_281))) (let ((.cse13 (select (select .cse12 c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (let ((.cse11 (* 2 .cse13)) (.cse15 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_282) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_283) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_284)) (.cse16 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_264) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_265) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_266)) (.cse14 (+ 1 .cse13))) (and (= .cse11 (select v_DerPreprocessor_281 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= (+ 2 .cse11) (select v_DerPreprocessor_284 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= (+ .cse11 1) (select v_DerPreprocessor_266 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= v_DerPreprocessor_279 (select .cse12 c_func_to_recursive_line_26_to_34_0_~c.base)) (= (+ (* .cse13 .cse13) 2 .cse13) .cse4) (= .cse14 (select (select .cse15 c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset)) (= v_DerPreprocessor_282 (select .cse15 c_func_to_recursive_line_26_to_34_0_~c.base)) (= .cse14 (select (select .cse16 c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset)) (= v_DerPreprocessor_264 (select .cse16 c_func_to_recursive_line_26_to_34_0_~c.base)) (= .cse14 .cse3))))))) (and (exists ((v_DerPreprocessor_279 (Array Int Int)) (v_DerPreprocessor_266 (Array Int Int)) (v_DerPreprocessor_264 (Array Int Int)) (v_DerPreprocessor_265 (Array Int Int)) (v_DerPreprocessor_284 (Array Int Int)) (v_DerPreprocessor_282 (Array Int Int)) (v_DerPreprocessor_283 (Array Int Int)) (v_DerPreprocessor_280 (Array Int Int)) (v_DerPreprocessor_281 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_279) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_280) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_281))) (let ((.cse25 (select .cse18 c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse22 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_282) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_283) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_284)) (.cse24 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_264) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_265) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_266)) (.cse19 (select .cse25 c_func_to_recursive_line_26_to_34_0_~y.offset))) (let ((.cse17 (* 2 .cse19)) (.cse20 (+ 1 .cse19)) (.cse23 (select .cse24 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse21 (select .cse22 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= .cse17 (select v_DerPreprocessor_281 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= (+ 2 .cse17) (select v_DerPreprocessor_284 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= (+ .cse17 1) (select v_DerPreprocessor_266 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= v_DerPreprocessor_279 (select .cse18 c_func_to_recursive_line_26_to_34_0_~c.base)) (= (+ (* .cse19 .cse19) 2 .cse19) .cse4) (= .cse20 (select .cse21 c_func_to_recursive_line_26_to_34_0_~y.offset)) (= v_DerPreprocessor_282 (select .cse22 c_func_to_recursive_line_26_to_34_0_~c.base)) (= .cse20 (select .cse23 c_func_to_recursive_line_26_to_34_0_~y.offset)) (= v_DerPreprocessor_264 (select .cse24 c_func_to_recursive_line_26_to_34_0_~c.base)) (= .cse20 .cse3) (= .cse23 v_DerPreprocessor_265) (= v_DerPreprocessor_283 .cse21) (= v_DerPreprocessor_280 .cse25))))))) .cse26) (exists ((v_DerPreprocessor_266 (Array Int Int)) (v_DerPreprocessor_264 (Array Int Int)) (v_DerPreprocessor_265 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_264) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_265) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_266))) (let ((.cse34 (select .cse27 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= v_DerPreprocessor_264 (select .cse27 c_func_to_recursive_line_26_to_34_0_~c.base)) (exists ((v_DerPreprocessor_284 (Array Int Int)) (v_DerPreprocessor_282 (Array Int Int)) (v_DerPreprocessor_283 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_282) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_283) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_284))) (let ((.cse33 (select .cse28 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= v_DerPreprocessor_282 (select .cse28 c_func_to_recursive_line_26_to_34_0_~c.base)) (exists ((v_DerPreprocessor_279 (Array Int Int)) (v_DerPreprocessor_280 (Array Int Int)) (v_DerPreprocessor_281 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_279) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_280) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_281))) (let ((.cse35 (select .cse30 c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse31 (select .cse35 c_func_to_recursive_line_26_to_34_0_~y.offset))) (let ((.cse29 (* 2 .cse31)) (.cse32 (+ 1 .cse31))) (and (= .cse29 (select v_DerPreprocessor_281 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= (+ 2 .cse29) (select v_DerPreprocessor_284 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= (+ .cse29 1) (select v_DerPreprocessor_266 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= v_DerPreprocessor_279 (select .cse30 c_func_to_recursive_line_26_to_34_0_~c.base)) (= (+ (* .cse31 .cse31) 2 .cse31) .cse4) (= .cse32 (select .cse33 c_func_to_recursive_line_26_to_34_0_~y.offset)) (= .cse32 (select .cse34 c_func_to_recursive_line_26_to_34_0_~y.offset)) (= .cse29 .cse6) (= .cse32 .cse3) (= v_DerPreprocessor_280 .cse35))))))) (= v_DerPreprocessor_283 .cse33))))) (= .cse34 v_DerPreprocessor_265))))))) (and (let ((.cse48 (* .cse6 .cse6)) (.cse52 (select (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base) c_func_to_recursive_line_26_to_34_0_~c.offset))) (let ((.cse36 (exists ((v_DerPreprocessor_279 (Array Int Int)) (v_DerPreprocessor_288 (Array Int Int)) (v_DerPreprocessor_289 (Array Int Int)) (v_DerPreprocessor_275 (Array Int Int)) (v_DerPreprocessor_273 (Array Int Int)) (v_DerPreprocessor_274 (Array Int Int)) (v_prenex_420 (Array Int Int)) (v_prenex_421 (Array Int Int)) (v_DerPreprocessor_280 (Array Int Int)) (v_DerPreprocessor_281 (Array Int Int)) (v_DerPreprocessor_290 (Array Int Int)) (v_prenex_419 (Array Int Int)) (v_prenex_717 (Array Int Int)) (v_prenex_718 (Array Int Int)) (v_prenex_719 (Array Int Int))) (let ((.cse74 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_279) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_280) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_281))) (let ((.cse62 (select .cse74 c_func_to_recursive_line_26_to_34_0_~c.base))) (let ((.cse76 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_288) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_289) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_290)) (.cse75 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_273) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_274) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_275)) (.cse67 (select .cse62 c_func_to_recursive_line_26_to_34_0_~c.offset)) (.cse77 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_prenex_718) c_func_to_recursive_line_26_to_34_0_~y.base v_prenex_719) c_func_to_recursive_line_26_to_34_0_~x.base v_prenex_717)) (.cse78 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_prenex_420) c_func_to_recursive_line_26_to_34_0_~y.base v_prenex_421) c_func_to_recursive_line_26_to_34_0_~x.base v_prenex_419))) (let ((.cse61 (select .cse78 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse65 (select .cse78 c_func_to_recursive_line_26_to_34_0_~c.base)) (.cse71 (select .cse77 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse68 (+ .cse6 .cse67 1)) (.cse63 (select .cse75 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse64 (select .cse76 c_func_to_recursive_line_26_to_34_0_~c.base)) (.cse73 (select .cse77 c_func_to_recursive_line_26_to_34_0_~c.base)) (.cse60 (select v_DerPreprocessor_290 c_func_to_recursive_line_26_to_34_0_~x.offset)) (.cse59 (* 2 .cse67)) (.cse66 (+ .cse67 1)) (.cse72 (select .cse76 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse70 (select .cse75 c_func_to_recursive_line_26_to_34_0_~c.base)) (.cse69 (select .cse74 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= (+ .cse4 2 .cse59) (+ (* .cse60 2) (select v_DerPreprocessor_281 c_func_to_recursive_line_26_to_34_0_~x.offset))) (= .cse61 v_prenex_421) (= v_DerPreprocessor_279 .cse62) (= v_DerPreprocessor_274 .cse63) (= .cse64 v_DerPreprocessor_288) (= .cse65 v_prenex_420) (= (select v_prenex_717 c_func_to_recursive_line_26_to_34_0_~x.offset) (+ 2 .cse59)) (= .cse66 (select .cse61 c_func_to_recursive_line_26_to_34_0_~y.offset)) (= (select .cse65 c_func_to_recursive_line_26_to_34_0_~c.offset) .cse67) (= .cse68 (+ .cse60 .cse3)) (= (+ 1 .cse59) (select v_prenex_419 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= .cse68 (+ .cse60 (select .cse69 c_func_to_recursive_line_26_to_34_0_~y.offset))) (= .cse70 v_DerPreprocessor_273) (= (+ .cse48 (* (* .cse6 .cse67) 2) 2 (* 3 .cse67) (* .cse67 .cse67) .cse6 (* .cse60 .cse60)) (+ (* (* .cse60 .cse67) 2) (* 2 (* .cse60 .cse6)) (* .cse60 3))) (= .cse71 v_prenex_719) (= .cse66 (select .cse71 c_func_to_recursive_line_26_to_34_0_~y.offset)) (= .cse68 (+ .cse60 (select .cse63 c_func_to_recursive_line_26_to_34_0_~y.offset))) (= v_DerPreprocessor_289 .cse72) (= .cse73 v_prenex_718) (= (select .cse64 c_func_to_recursive_line_26_to_34_0_~c.offset) .cse67) (= (select .cse73 c_func_to_recursive_line_26_to_34_0_~c.offset) .cse67) (= .cse52 .cse67) (= (+ .cse60 (select v_DerPreprocessor_275 c_func_to_recursive_line_26_to_34_0_~x.offset)) (+ .cse6 1 .cse59)) (= .cse66 (select .cse72 c_func_to_recursive_line_26_to_34_0_~y.offset)) (= (select .cse70 c_func_to_recursive_line_26_to_34_0_~c.offset) .cse67) (= v_DerPreprocessor_280 .cse69))))))))) (or (and .cse10 .cse36) (exists ((v_DerPreprocessor_275 (Array Int Int)) (v_DerPreprocessor_273 (Array Int Int)) (v_DerPreprocessor_274 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_273) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_274) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_275))) (let ((.cse37 (select .cse58 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse38 (select .cse58 c_func_to_recursive_line_26_to_34_0_~c.base))) (and (= v_DerPreprocessor_274 .cse37) (= .cse38 v_DerPreprocessor_273) (exists ((v_prenex_717 (Array Int Int)) (v_prenex_718 (Array Int Int)) (v_prenex_719 (Array Int Int))) (let ((.cse57 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_prenex_718) c_func_to_recursive_line_26_to_34_0_~y.base v_prenex_719) c_func_to_recursive_line_26_to_34_0_~x.base v_prenex_717))) (let ((.cse49 (select .cse57 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse51 (select .cse57 c_func_to_recursive_line_26_to_34_0_~c.base))) (and (exists ((v_DerPreprocessor_288 (Array Int Int)) (v_DerPreprocessor_289 (Array Int Int)) (v_DerPreprocessor_290 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_288) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_289) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_290))) (let ((.cse50 (select .cse56 c_func_to_recursive_line_26_to_34_0_~c.base)) (.cse53 (select .cse56 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (exists ((v_prenex_419 (Array Int Int)) (v_prenex_420 (Array Int Int)) (v_prenex_421 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_prenex_420) c_func_to_recursive_line_26_to_34_0_~y.base v_prenex_421) c_func_to_recursive_line_26_to_34_0_~x.base v_prenex_419))) (let ((.cse39 (select .cse55 c_func_to_recursive_line_26_to_34_0_~y.base)) (.cse40 (select .cse55 c_func_to_recursive_line_26_to_34_0_~c.base))) (and (= .cse39 v_prenex_421) (= .cse40 v_prenex_420) (exists ((v_DerPreprocessor_279 (Array Int Int)) (v_DerPreprocessor_280 (Array Int Int)) (v_DerPreprocessor_281 (Array Int Int))) (let ((.cse54 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_279) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_280) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_281))) (let ((.cse43 (select .cse54 c_func_to_recursive_line_26_to_34_0_~c.base))) (let ((.cse45 (select .cse43 c_func_to_recursive_line_26_to_34_0_~c.offset))) (let ((.cse46 (+ .cse6 .cse45 1)) (.cse42 (select v_DerPreprocessor_290 c_func_to_recursive_line_26_to_34_0_~x.offset)) (.cse41 (* 2 .cse45)) (.cse44 (+ .cse45 1)) (.cse47 (select .cse54 c_func_to_recursive_line_26_to_34_0_~y.base))) (and (= (+ .cse4 2 .cse41) (+ (* .cse42 2) (select v_DerPreprocessor_281 c_func_to_recursive_line_26_to_34_0_~x.offset))) (= v_DerPreprocessor_279 .cse43) (= (select v_prenex_717 c_func_to_recursive_line_26_to_34_0_~x.offset) (+ 2 .cse41)) (= .cse44 (select .cse39 c_func_to_recursive_line_26_to_34_0_~y.offset)) (= (select .cse40 c_func_to_recursive_line_26_to_34_0_~c.offset) .cse45) (= .cse46 (+ .cse42 .cse3)) (= .cse42 .cse41) (= (+ 1 .cse41) (select v_prenex_419 c_func_to_recursive_line_26_to_34_0_~x.offset)) (= .cse46 (+ .cse42 (select .cse47 c_func_to_recursive_line_26_to_34_0_~y.offset))) (= (+ .cse48 (* (* .cse6 .cse45) 2) 2 (* 3 .cse45) (* .cse45 .cse45) .cse6 (* .cse42 .cse42)) (+ (* (* .cse42 .cse45) 2) (* 2 (* .cse42 .cse6)) (* .cse42 3))) (= .cse44 (select .cse49 c_func_to_recursive_line_26_to_34_0_~y.offset)) (= .cse46 (+ .cse42 (select .cse37 c_func_to_recursive_line_26_to_34_0_~y.offset))) (= (select .cse50 c_func_to_recursive_line_26_to_34_0_~c.offset) .cse45) (= (select .cse51 c_func_to_recursive_line_26_to_34_0_~c.offset) .cse45) (= .cse52 .cse45) (= (+ .cse42 (select v_DerPreprocessor_275 c_func_to_recursive_line_26_to_34_0_~x.offset)) (+ .cse6 1 .cse41)) (= .cse44 (select .cse53 c_func_to_recursive_line_26_to_34_0_~y.offset)) (= (select .cse38 c_func_to_recursive_line_26_to_34_0_~c.offset) .cse45) (= v_DerPreprocessor_280 .cse47))))))))))) (= .cse50 v_DerPreprocessor_288) (= v_DerPreprocessor_289 .cse53))))) (= .cse49 v_prenex_719) (= .cse51 v_prenex_718))))))))) (and .cse36 .cse26)))) (or (not .cse8) (not .cse9))))))) (or .cse5 (not .cse79)))) (and .cse79 .cse80 (let ((.cse82 (= (mod .cse6 2) 0))) (or (and .cse8 .cse9 (= (let ((.cse81 (div (* (- 1) .cse6) 2))) (+ (* 5 .cse81) 6 (* .cse81 .cse81))) 0) .cse82 (exists ((v_DerPreprocessor_268 (Array Int Int)) (v_DerPreprocessor_269 (Array Int Int)) (v_DerPreprocessor_267 (Array Int Int))) (let ((.cse83 (store (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_DerPreprocessor_267) c_func_to_recursive_line_26_to_34_0_~y.base v_DerPreprocessor_268) c_func_to_recursive_line_26_to_34_0_~x.base v_DerPreprocessor_269))) (and (= v_DerPreprocessor_267 (select .cse83 c_func_to_recursive_line_26_to_34_0_~c.base)) (= v_DerPreprocessor_268 (select .cse83 c_func_to_recursive_line_26_to_34_0_~y.base)) (= (+ (select v_DerPreprocessor_269 c_func_to_recursive_line_26_to_34_0_~x.offset) 1) .cse6))))) (and (let ((.cse84 (div .cse6 2))) (= (+ 2 (* .cse84 .cse84)) (* .cse84 3))) .cse7 .cse82)))))))) is different from true [2024-09-20 13:50:33,642 WARN L293 SmtUtils]: Spent 9.24s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 13:50:49,306 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_func_to_recursive_line_26_to_34_0_#in~c.base| |c_func_to_recursive_line_26_to_34_0_#in~x.base|)) (.cse3 (= |c_func_to_recursive_line_26_to_34_0_#in~c.offset| |c_func_to_recursive_line_26_to_34_0_#in~x.offset|))) (let ((.cse29 (not .cse3)) (.cse30 (not .cse2))) (let ((.cse0 (= |c_func_to_recursive_line_26_to_34_0_#in~x.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse7 (or .cse29 .cse30)) (.cse8 (= |c_func_to_recursive_line_26_to_34_0_#in~c.offset| |c_func_to_recursive_line_26_to_34_0_#in~y.offset|)) (.cse9 (= |c_func_to_recursive_line_26_to_34_0_#in~c.base| |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse6 (select (select |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~x.base|) |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) (.cse1 (= |c_func_to_recursive_line_26_to_34_0_#in~y.offset| |c_func_to_recursive_line_26_to_34_0_#in~x.offset|))) (or (and (or (not .cse0) (not .cse1)) (let ((.cse5 (select (select |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~y.base|) |c_func_to_recursive_line_26_to_34_0_#in~y.offset|))) (or (let ((.cse4 (* .cse5 .cse5))) (and .cse2 .cse3 (= (mod (+ .cse4 .cse5) 2) 0) (= (+ (div (+ (* (- 1) .cse5) .cse4) 2) .cse5 1) .cse6))) (and .cse7 (let ((.cse17 (* .cse6 2))) (or (and .cse8 .cse9 (or (exists ((v_DerPreprocessor_266 (Array Int Int)) (v_DerPreprocessor_264 (Array Int Int)) (v_DerPreprocessor_265 (Array Int Int))) (let ((.cse10 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_264) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_265) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_266))) (let ((.cse16 (select .cse10 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (= (select .cse10 |c_func_to_recursive_line_26_to_34_0_#in~c.base|) v_DerPreprocessor_264) (exists ((v_DerPreprocessor_284 (Array Int Int)) (v_DerPreprocessor_282 (Array Int Int)) (v_DerPreprocessor_283 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_282) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_283) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_284))) (let ((.cse11 (select .cse19 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (exists ((v_DerPreprocessor_279 (Array Int Int)) (v_DerPreprocessor_280 (Array Int Int)) (v_DerPreprocessor_281 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_279) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_280) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_281))) (let ((.cse15 (select .cse13 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (let ((.cse18 (select .cse15 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|))) (let ((.cse12 (+ .cse18 1)) (.cse14 (* 2 .cse18))) (and (= (select .cse11 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|) .cse12) (= (select .cse13 |c_func_to_recursive_line_26_to_34_0_#in~c.base|) v_DerPreprocessor_279) (= .cse5 .cse12) (= .cse6 .cse14) (= .cse15 v_DerPreprocessor_280) (= (select v_DerPreprocessor_266 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) (+ .cse14 1)) (= (select .cse16 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|) .cse12) (= (+ .cse14 2) (select v_DerPreprocessor_284 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) (= .cse17 (+ (* .cse18 .cse18) 2 .cse18)) (= (select v_DerPreprocessor_281 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) .cse14))))))) (= .cse11 v_DerPreprocessor_283) (= v_DerPreprocessor_282 (select .cse19 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)))))) (= v_DerPreprocessor_265 .cse16))))) (and (exists ((v_DerPreprocessor_279 (Array Int Int)) (v_DerPreprocessor_266 (Array Int Int)) (v_DerPreprocessor_264 (Array Int Int)) (v_DerPreprocessor_265 (Array Int Int)) (v_DerPreprocessor_284 (Array Int Int)) (v_DerPreprocessor_282 (Array Int Int)) (v_DerPreprocessor_283 (Array Int Int)) (v_DerPreprocessor_280 (Array Int Int)) (v_DerPreprocessor_281 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_279) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_280) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_281))) (let ((.cse24 (select .cse22 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (let ((.cse23 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_264) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_265) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_266)) (.cse28 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_282) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_283) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_284)) (.cse27 (select .cse24 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|))) (let ((.cse21 (+ .cse27 1)) (.cse20 (select .cse28 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse25 (* 2 .cse27)) (.cse26 (select .cse23 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (= (select .cse20 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|) .cse21) (= (select .cse22 |c_func_to_recursive_line_26_to_34_0_#in~c.base|) v_DerPreprocessor_279) (= .cse5 .cse21) (= (select .cse23 |c_func_to_recursive_line_26_to_34_0_#in~c.base|) v_DerPreprocessor_264) (= .cse24 v_DerPreprocessor_280) (= (select v_DerPreprocessor_266 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) (+ .cse25 1)) (= (select .cse26 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|) .cse21) (= (+ .cse25 2) (select v_DerPreprocessor_284 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) (= .cse20 v_DerPreprocessor_283) (= .cse17 (+ (* .cse27 .cse27) 2 .cse27)) (= v_DerPreprocessor_282 (select .cse28 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)) (= (select v_DerPreprocessor_281 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) .cse25) (= v_DerPreprocessor_265 .cse26))))))) .cse29) (and .cse30 (exists ((v_DerPreprocessor_279 (Array Int Int)) (v_DerPreprocessor_266 (Array Int Int)) (v_DerPreprocessor_264 (Array Int Int)) (v_DerPreprocessor_265 (Array Int Int)) (v_DerPreprocessor_284 (Array Int Int)) (v_DerPreprocessor_282 (Array Int Int)) (v_DerPreprocessor_283 (Array Int Int)) (v_DerPreprocessor_280 (Array Int Int)) (v_DerPreprocessor_281 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_279) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_280) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_281))) (let ((.cse36 (select (select .cse33 |c_func_to_recursive_line_26_to_34_0_#in~y.base|) |c_func_to_recursive_line_26_to_34_0_#in~y.offset|))) (let ((.cse34 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_264) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_265) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_266)) (.cse32 (+ .cse36 1)) (.cse31 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_282) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_283) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_284)) (.cse35 (* 2 .cse36))) (and (= (select (select .cse31 |c_func_to_recursive_line_26_to_34_0_#in~y.base|) |c_func_to_recursive_line_26_to_34_0_#in~y.offset|) .cse32) (= (select .cse33 |c_func_to_recursive_line_26_to_34_0_#in~c.base|) v_DerPreprocessor_279) (= .cse5 .cse32) (= (select .cse34 |c_func_to_recursive_line_26_to_34_0_#in~c.base|) v_DerPreprocessor_264) (= (select v_DerPreprocessor_266 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) (+ .cse35 1)) (= (select (select .cse34 |c_func_to_recursive_line_26_to_34_0_#in~y.base|) |c_func_to_recursive_line_26_to_34_0_#in~y.offset|) .cse32) (= (+ .cse35 2) (select v_DerPreprocessor_284 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) (= .cse17 (+ (* .cse36 .cse36) 2 .cse36)) (= v_DerPreprocessor_282 (select .cse31 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)) (= (select v_DerPreprocessor_281 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) .cse35))))))))) (and (let ((.cse43 (* .cse6 .cse6)) (.cse53 (select (select |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base|) |c_func_to_recursive_line_26_to_34_0_#in~c.offset|))) (let ((.cse59 (exists ((v_DerPreprocessor_279 (Array Int Int)) (v_DerPreprocessor_288 (Array Int Int)) (v_DerPreprocessor_289 (Array Int Int)) (v_DerPreprocessor_275 (Array Int Int)) (v_DerPreprocessor_273 (Array Int Int)) (v_DerPreprocessor_274 (Array Int Int)) (v_prenex_420 (Array Int Int)) (v_prenex_421 (Array Int Int)) (v_DerPreprocessor_280 (Array Int Int)) (v_DerPreprocessor_281 (Array Int Int)) (v_DerPreprocessor_290 (Array Int Int)) (v_prenex_419 (Array Int Int)) (v_prenex_717 (Array Int Int)) (v_prenex_718 (Array Int Int)) (v_prenex_719 (Array Int Int))) (let ((.cse78 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_279) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_280) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_281))) (let ((.cse66 (select .cse78 |c_func_to_recursive_line_26_to_34_0_#in~c.base|))) (let ((.cse77 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_288) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_289) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_290)) (.cse63 (select .cse66 |c_func_to_recursive_line_26_to_34_0_#in~c.offset|)) (.cse75 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_prenex_420) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_prenex_421) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_prenex_419)) (.cse76 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_prenex_718) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_prenex_719) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_prenex_717)) (.cse79 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_273) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_274) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_275))) (let ((.cse62 (select .cse79 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)) (.cse65 (select .cse79 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse70 (select .cse76 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)) (.cse69 (select .cse75 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)) (.cse67 (+ .cse63 1)) (.cse64 (+ .cse63 .cse6 1)) (.cse73 (select .cse78 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse71 (select .cse77 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)) (.cse74 (select .cse77 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse60 (* .cse63 2)) (.cse61 (select v_DerPreprocessor_290 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) (.cse68 (select .cse76 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse72 (select .cse75 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (= (+ .cse60 .cse17 2) (+ (select v_DerPreprocessor_281 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) (* 2 .cse61))) (= (+ .cse60 1) (select v_prenex_419 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) (= (select .cse62 |c_func_to_recursive_line_26_to_34_0_#in~c.offset|) .cse63) (= (+ (* 3 .cse61) (* (* .cse63 .cse61) 2) (* (* .cse6 .cse61) 2)) (+ (* .cse61 .cse61) .cse6 (* 2 (* .cse63 .cse6)) (* .cse63 3) 2 (* .cse63 .cse63) .cse43)) (= .cse64 (+ .cse61 .cse5)) (= v_DerPreprocessor_274 .cse65) (= (select v_prenex_717 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) (+ .cse60 2)) (= .cse66 v_DerPreprocessor_279) (= v_DerPreprocessor_273 .cse62) (= .cse67 (select .cse68 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|)) (= .cse63 (select .cse69 |c_func_to_recursive_line_26_to_34_0_#in~c.offset|)) (= .cse63 (select .cse70 |c_func_to_recursive_line_26_to_34_0_#in~c.offset|)) (= .cse64 (+ .cse61 (select .cse65 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|))) (= .cse71 v_DerPreprocessor_288) (= .cse67 (select .cse72 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|)) (= .cse73 v_DerPreprocessor_280) (= .cse70 v_prenex_718) (= .cse69 v_prenex_420) (= .cse67 (select .cse74 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|)) (= .cse64 (+ (select .cse73 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|) .cse61)) (= .cse63 (select .cse71 |c_func_to_recursive_line_26_to_34_0_#in~c.offset|)) (= .cse74 v_DerPreprocessor_289) (= (+ .cse60 .cse6 1) (+ .cse61 (select v_DerPreprocessor_275 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|))) (= v_prenex_719 .cse68) (= .cse63 .cse53) (= .cse72 v_prenex_421))))))))) (or (exists ((v_DerPreprocessor_275 (Array Int Int)) (v_DerPreprocessor_273 (Array Int Int)) (v_DerPreprocessor_274 (Array Int Int))) (let ((.cse58 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_273) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_274) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_275))) (let ((.cse38 (select .cse58 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)) (.cse37 (select .cse58 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (= v_DerPreprocessor_274 .cse37) (= v_DerPreprocessor_273 .cse38) (exists ((v_prenex_717 (Array Int Int)) (v_prenex_718 (Array Int Int)) (v_prenex_719 (Array Int Int))) (let ((.cse57 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_prenex_718) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_prenex_719) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_prenex_717))) (let ((.cse48 (select .cse57 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)) (.cse47 (select .cse57 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (exists ((v_DerPreprocessor_288 (Array Int Int)) (v_DerPreprocessor_289 (Array Int Int)) (v_DerPreprocessor_290 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_288) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_289) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_290))) (let ((.cse52 (select .cse56 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)) (.cse51 (select .cse56 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (exists ((v_prenex_419 (Array Int Int)) (v_prenex_420 (Array Int Int)) (v_prenex_421 (Array Int Int))) (let ((.cse55 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_prenex_420) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_prenex_421) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_prenex_419))) (let ((.cse39 (select .cse55 |c_func_to_recursive_line_26_to_34_0_#in~c.base|)) (.cse49 (select .cse55 |c_func_to_recursive_line_26_to_34_0_#in~y.base|))) (and (= .cse39 v_prenex_420) (exists ((v_DerPreprocessor_279 (Array Int Int)) (v_DerPreprocessor_280 (Array Int Int)) (v_DerPreprocessor_281 (Array Int Int))) (let ((.cse54 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_279) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_280) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_281))) (let ((.cse45 (select .cse54 |c_func_to_recursive_line_26_to_34_0_#in~c.base|))) (let ((.cse42 (select .cse45 |c_func_to_recursive_line_26_to_34_0_#in~c.offset|))) (let ((.cse46 (+ .cse42 1)) (.cse44 (+ .cse42 .cse6 1)) (.cse50 (select .cse54 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (.cse40 (* .cse42 2)) (.cse41 (select v_DerPreprocessor_290 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|))) (and (= (+ .cse40 .cse17 2) (+ (select v_DerPreprocessor_281 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) (* 2 .cse41))) (= (+ .cse40 1) (select v_prenex_419 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|)) (= (select .cse38 |c_func_to_recursive_line_26_to_34_0_#in~c.offset|) .cse42) (= (+ (* 3 .cse41) (* (* .cse42 .cse41) 2) (* (* .cse6 .cse41) 2)) (+ (* .cse41 .cse41) .cse6 (* 2 (* .cse42 .cse6)) (* .cse42 3) 2 (* .cse42 .cse42) .cse43)) (= .cse44 (+ .cse41 .cse5)) (= (select v_prenex_717 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) (+ .cse40 2)) (= .cse45 v_DerPreprocessor_279) (= .cse40 .cse41) (= .cse46 (select .cse47 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|)) (= .cse42 (select .cse39 |c_func_to_recursive_line_26_to_34_0_#in~c.offset|)) (= .cse42 (select .cse48 |c_func_to_recursive_line_26_to_34_0_#in~c.offset|)) (= .cse44 (+ .cse41 (select .cse37 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|))) (= .cse46 (select .cse49 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|)) (= .cse50 v_DerPreprocessor_280) (= .cse46 (select .cse51 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|)) (= .cse44 (+ (select .cse50 |c_func_to_recursive_line_26_to_34_0_#in~y.offset|) .cse41)) (= .cse42 (select .cse52 |c_func_to_recursive_line_26_to_34_0_#in~c.offset|)) (= (+ .cse40 .cse6 1) (+ .cse41 (select v_DerPreprocessor_275 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|))) (= .cse42 .cse53))))))) (= .cse49 v_prenex_421))))) (= .cse52 v_DerPreprocessor_288) (= .cse51 v_DerPreprocessor_289))))) (= .cse48 v_prenex_718) (= v_prenex_719 .cse47))))))))) (and .cse29 .cse59) (and .cse59 .cse30)))) (or (not .cse9) (not .cse8))))))))) (and .cse0 (let ((.cse81 (= (mod .cse6 2) 0))) (or (and (let ((.cse80 (div .cse6 2))) (= (* 3 .cse80) (+ 2 (* .cse80 .cse80)))) .cse81 .cse7) (and .cse8 (= (let ((.cse82 (div (* (- 1) .cse6) 2))) (+ (* .cse82 5) 6 (* .cse82 .cse82))) 0) (exists ((v_DerPreprocessor_268 (Array Int Int)) (v_DerPreprocessor_269 (Array Int Int)) (v_DerPreprocessor_267 (Array Int Int))) (let ((.cse83 (store (store (store |c_#memory_int| |c_func_to_recursive_line_26_to_34_0_#in~c.base| v_DerPreprocessor_267) |c_func_to_recursive_line_26_to_34_0_#in~y.base| v_DerPreprocessor_268) |c_func_to_recursive_line_26_to_34_0_#in~x.base| v_DerPreprocessor_269))) (and (= .cse6 (+ (select v_DerPreprocessor_269 |c_func_to_recursive_line_26_to_34_0_#in~x.offset|) 1)) (= v_DerPreprocessor_268 (select .cse83 |c_func_to_recursive_line_26_to_34_0_#in~y.base|)) (= (select .cse83 |c_func_to_recursive_line_26_to_34_0_#in~c.base|) v_DerPreprocessor_267)))) .cse81 .cse9))) .cse1))))) is different from true [2024-09-20 13:51:21,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9