./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ca4ee3dd Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-ca4ee3d-m [2024-09-20 20:01:11,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 20:01:11,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 20:01:11,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 20:01:11,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 20:01:11,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 20:01:11,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 20:01:11,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 20:01:11,538 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 20:01:11,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 20:01:11,540 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 20:01:11,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 20:01:11,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 20:01:11,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 20:01:11,544 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 20:01:11,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 20:01:11,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 20:01:11,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 20:01:11,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 20:01:11,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 20:01:11,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 20:01:11,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 20:01:11,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 20:01:11,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 20:01:11,547 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 20:01:11,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 20:01:11,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 20:01:11,548 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 20:01:11,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 20:01:11,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 20:01:11,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 20:01:11,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 20:01:11,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 20:01:11,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 20:01:11,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 20:01:11,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 20:01:11,551 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 20:01:11,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 20:01:11,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 20:01:11,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 20:01:11,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 20:01:11,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 20:01:11,553 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d93bd48e791c000b7768d0e055259ea6d087a487fbdd17b18765993d4c240b84 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 20:01:11,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 20:01:11,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 20:01:11,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 20:01:11,859 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 20:01:11,860 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 20:01:11,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2024-09-20 20:01:13,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 20:01:13,504 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 20:01:13,504 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_lcm2.c [2024-09-20 20:01:13,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/33841eefd/01e55c6d80ac4389bdcae89a2384fb33/FLAG799a677a7 [2024-09-20 20:01:13,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/33841eefd/01e55c6d80ac4389bdcae89a2384fb33 [2024-09-20 20:01:13,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 20:01:13,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 20:01:13,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 20:01:13,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 20:01:13,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 20:01:13,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae0a169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13, skipping insertion in model container [2024-09-20 20:01:13,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 20:01:13,705 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_lcm2.c[1061,1074] [2024-09-20 20:01:13,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 20:01:13,739 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 20:01:13,752 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_lcm2.c[1061,1074] [2024-09-20 20:01:13,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 20:01:13,778 INFO L204 MainTranslator]: Completed translation [2024-09-20 20:01:13,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13 WrapperNode [2024-09-20 20:01:13,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 20:01:13,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 20:01:13,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 20:01:13,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 20:01:13,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,805 INFO L138 Inliner]: procedures = 16, calls = 82, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 20:01:13,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 20:01:13,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 20:01:13,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 20:01:13,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 20:01:13,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,856 INFO L175 MemorySlicer]: Split 51 memory accesses to 8 slices as follows [2, 6, 7, 6, 7, 7, 8, 8]. 16 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 7, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 2, 0, 2, 1, 1, 2, 2]. [2024-09-20 20:01:13,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,868 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 20:01:13,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 20:01:13,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 20:01:13,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 20:01:13,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (1/1) ... [2024-09-20 20:01:13,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 20:01:13,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 20:01:13,929 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 20:01:13,936 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 20:01:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 20:01:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 20:01:13,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 20:01:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 20:01:13,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 20:01:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 20:01:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-20 20:01:13,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-20 20:01:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-20 20:01:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-20 20:01:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-20 20:01:13,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-09-20 20:01:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-09-20 20:01:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-20 20:01:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-20 20:01:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-20 20:01:13,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-20 20:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-20 20:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-20 20:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-20 20:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-09-20 20:01:13,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-09-20 20:01:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 20:01:13,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 20:01:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 20:01:13,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 20:01:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-20 20:01:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-20 20:01:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-20 20:01:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-20 20:01:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-20 20:01:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-20 20:01:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-09-20 20:01:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-09-20 20:01:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 20:01:13,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 20:01:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 20:01:13,991 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_35_to_46_0 [2024-09-20 20:01:13,991 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_35_to_46_0 [2024-09-20 20:01:14,086 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 20:01:14,088 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 20:01:14,340 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-20 20:01:14,340 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 20:01:14,361 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 20:01:14,361 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 20:01:14,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:01:14 BoogieIcfgContainer [2024-09-20 20:01:14,362 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 20:01:14,364 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 20:01:14,364 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 20:01:14,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 20:01:14,368 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:01:13" (1/3) ... [2024-09-20 20:01:14,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5142f9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:01:14, skipping insertion in model container [2024-09-20 20:01:14,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:01:13" (2/3) ... [2024-09-20 20:01:14,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5142f9f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:01:14, skipping insertion in model container [2024-09-20 20:01:14,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:01:14" (3/3) ... [2024-09-20 20:01:14,371 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_lcm2.c [2024-09-20 20:01:14,388 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 20:01:14,389 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 20:01:14,443 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 20:01:14,450 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2574f9f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 20:01:14,450 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 20:01:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-20 20:01:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-20 20:01:14,467 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 20:01:14,471 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 20:01:14,472 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 20:01:14,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 20:01:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1231096965, now seen corresponding path program 1 times [2024-09-20 20:01:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 20:01:14,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900730586] [2024-09-20 20:01:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 20:01:14,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 20:01:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 20:01:14,774 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 20:01:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 20:01:14,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 20:01:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 20:01:14,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-20 20:01:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 20:01:14,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 20:01:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 20:01:14,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-20 20:01:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 20:01:14,829 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 20:01:14,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 20:01:14,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900730586] [2024-09-20 20:01:14,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900730586] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 20:01:14,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 20:01:14,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 20:01:14,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444315253] [2024-09-20 20:01:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 20:01:14,838 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 20:01:14,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 20:01:14,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 20:01:14,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 20:01:14,865 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 20:01:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 20:01:14,895 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2024-09-20 20:01:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 20:01:14,899 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2024-09-20 20:01:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 20:01:14,905 INFO L225 Difference]: With dead ends: 72 [2024-09-20 20:01:14,906 INFO L226 Difference]: Without dead ends: 35 [2024-09-20 20:01:14,911 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 20:01:14,914 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 20:01:14,915 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 20:01:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-20 20:01:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-20 20:01:15,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-20 20:01:15,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-09-20 20:01:15,009 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 36 [2024-09-20 20:01:15,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 20:01:15,011 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-09-20 20:01:15,011 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 20:01:15,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 20:01:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-09-20 20:01:15,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-20 20:01:15,015 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 20:01:15,016 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 20:01:15,016 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 20:01:15,016 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 20:01:15,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 20:01:15,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1757352067, now seen corresponding path program 1 times [2024-09-20 20:01:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 20:01:15,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442950745] [2024-09-20 20:01:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 20:01:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 20:01:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 20:01:15,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047662691] [2024-09-20 20:01:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 20:01:15,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 20:01:15,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 20:01:15,139 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 20:01:15,141 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 20:01:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 20:01:15,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-09-20 20:01:15,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 20:01:15,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-20 20:01:15,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-20 20:01:15,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:01:15,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:01:15,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:01:15,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:01:15,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-20 20:01:15,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-20 20:01:15,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-09-20 20:01:15,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-20 20:01:15,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-20 20:01:15,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-09-20 20:01:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 20:01:15,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 20:01:15,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 20:01:15,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442950745] [2024-09-20 20:01:15,950 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 20:01:15,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047662691] [2024-09-20 20:01:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047662691] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 20:01:15,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 20:01:15,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-20 20:01:15,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642672441] [2024-09-20 20:01:15,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 20:01:15,952 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-20 20:01:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 20:01:15,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-20 20:01:15,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-20 20:01:15,956 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-20 20:01:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 20:01:16,279 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-09-20 20:01:16,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-20 20:01:16,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2024-09-20 20:01:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 20:01:16,282 INFO L225 Difference]: With dead ends: 50 [2024-09-20 20:01:16,283 INFO L226 Difference]: Without dead ends: 48 [2024-09-20 20:01:16,284 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-20 20:01:16,286 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 14 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-20 20:01:16,286 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 182 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-20 20:01:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-20 20:01:16,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2024-09-20 20:01:16,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-20 20:01:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2024-09-20 20:01:16,303 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 36 [2024-09-20 20:01:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 20:01:16,304 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2024-09-20 20:01:16,304 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-20 20:01:16,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 20:01:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2024-09-20 20:01:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-20 20:01:16,306 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 20:01:16,306 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 20:01:16,315 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 20:01:16,507 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 20:01:16,507 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 20:01:16,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 20:01:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash -641452916, now seen corresponding path program 1 times [2024-09-20 20:01:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 20:01:16,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675044604] [2024-09-20 20:01:16,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 20:01:16,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 20:01:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 20:01:16,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1436876985] [2024-09-20 20:01:16,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 20:01:16,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 20:01:16,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 20:01:16,635 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 20:01:16,638 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 20:01:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 20:01:16,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-09-20 20:01:16,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 20:01:16,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-20 20:01:16,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-20 20:01:16,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:01:16,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:01:16,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:01:16,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:01:17,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-20 20:01:17,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-20 20:01:17,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-20 20:01:17,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-20 20:01:32,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2024-09-20 20:01:32,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2024-09-20 20:01:32,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2024-09-20 20:01:32,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 39 [2024-09-20 20:01:32,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 35 [2024-09-20 20:01:32,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2024-09-20 20:01:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 20:01:32,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 20:01:39,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 20:01:39,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675044604] [2024-09-20 20:01:39,598 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 20:01:39,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436876985] [2024-09-20 20:01:39,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436876985] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 20:01:39,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-20 20:01:39,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-09-20 20:01:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918413373] [2024-09-20 20:01:39,599 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-20 20:01:39,599 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-20 20:01:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 20:01:39,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-20 20:01:39,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=219, Unknown=4, NotChecked=0, Total=272 [2024-09-20 20:01:39,601 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 13 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-20 20:01:44,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:01:48,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:01:52,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:01:56,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:00,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:04,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:08,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:09,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:13,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:17,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:18,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:22,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:24,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:32,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:34,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:38,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:42,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:46,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:57,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-20 20:02:57,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 20:02:57,378 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2024-09-20 20:02:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-20 20:02:57,379 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-09-20 20:02:57,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 20:02:57,381 INFO L225 Difference]: With dead ends: 59 [2024-09-20 20:02:57,381 INFO L226 Difference]: Without dead ends: 49 [2024-09-20 20:02:57,382 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 34.8s TimeCoverageRelationStatistics Valid=110, Invalid=435, Unknown=7, NotChecked=0, Total=552 [2024-09-20 20:02:57,383 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 22 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.9s IncrementalHoareTripleChecker+Time [2024-09-20 20:02:57,383 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 85 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 255 Invalid, 14 Unknown, 0 Unchecked, 63.9s Time] [2024-09-20 20:02:57,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-20 20:02:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2024-09-20 20:02:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-20 20:02:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2024-09-20 20:02:57,408 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 46 [2024-09-20 20:02:57,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 20:02:57,408 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2024-09-20 20:02:57,409 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-20 20:02:57,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 20:02:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2024-09-20 20:02:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-20 20:02:57,412 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 20:02:57,412 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 20:02:57,419 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 20:02:57,613 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 20:02:57,613 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 20:02:57,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 20:02:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1100455939, now seen corresponding path program 1 times [2024-09-20 20:02:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 20:02:57,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943347284] [2024-09-20 20:02:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 20:02:57,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 20:02:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 20:02:57,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350232880] [2024-09-20 20:02:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 20:02:57,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 20:02:57,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 20:02:57,718 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 20:02:57,719 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 20:02:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 20:02:58,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 170 conjuncts are in the unsatisfiable core [2024-09-20 20:02:58,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 20:02:58,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-20 20:02:58,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-20 20:02:58,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:02:58,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:02:58,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:02:58,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:03:02,491 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_1 Int)) (let ((.cse0 (select (select |c_#memory_int#4| v_func_to_recursive_line_35_to_46_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~b.offset_BEFORE_CALL_1))) (and (= (select (select |c_#memory_int#3| v_func_to_recursive_line_35_to_46_0_~u.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~u.offset_BEFORE_CALL_1) .cse0) (= .cse0 (select (select |c_#memory_int#6| v_func_to_recursive_line_35_to_46_0_~y.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~y.offset_BEFORE_CALL_1))))) (exists ((v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1 Int) (v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1 Int)) (let ((.cse1 (select (select |c_#memory_int#5| v_func_to_recursive_line_35_to_46_0_~a.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~a.offset_BEFORE_CALL_1))) (and (= (select (select |c_#memory_int#7| v_func_to_recursive_line_35_to_46_0_~x.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~x.offset_BEFORE_CALL_1) .cse1) (= .cse1 (select (select |c_#memory_int#1| v_func_to_recursive_line_35_to_46_0_~v.base_BEFORE_CALL_1) v_func_to_recursive_line_35_to_46_0_~v.offset_BEFORE_CALL_1)))))) is different from true [2024-09-20 20:03:02,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2024-09-20 20:03:02,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2024-09-20 20:03:02,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-09-20 20:03:02,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2024-09-20 20:03:02,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2024-09-20 20:03:02,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2024-09-20 20:03:02,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 30 [2024-09-20 20:03:02,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-09-20 20:03:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 1 not checked. [2024-09-20 20:03:02,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 20:03:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 20:03:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 20:03:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943347284] [2024-09-20 20:03:16,383 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 20:03:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350232880] [2024-09-20 20:03:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350232880] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 20:03:16,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 20:03:16,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2024-09-20 20:03:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588196388] [2024-09-20 20:03:16,383 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 20:03:16,384 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-20 20:03:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 20:03:16,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-20 20:03:16,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=290, Unknown=2, NotChecked=34, Total=380 [2024-09-20 20:03:16,385 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 20 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-20 20:03:23,436 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 20:03:27,449 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 20:03:39,580 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 20:03:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 20:03:41,511 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-09-20 20:03:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-20 20:03:41,511 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 47 [2024-09-20 20:03:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 20:03:41,512 INFO L225 Difference]: With dead ends: 66 [2024-09-20 20:03:41,513 INFO L226 Difference]: Without dead ends: 62 [2024-09-20 20:03:41,513 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=4, NotChecked=54, Total=870 [2024-09-20 20:03:41,514 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2024-09-20 20:03:41,514 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 284 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 314 Invalid, 3 Unknown, 75 Unchecked, 15.1s Time] [2024-09-20 20:03:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-20 20:03:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-09-20 20:03:41,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-20 20:03:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2024-09-20 20:03:41,539 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 47 [2024-09-20 20:03:41,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 20:03:41,539 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2024-09-20 20:03:41,539 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-20 20:03:41,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 20:03:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2024-09-20 20:03:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-20 20:03:41,541 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 20:03:41,541 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 20:03:41,549 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 20:03:41,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 20:03:41,742 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 20:03:41,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 20:03:41,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1433843150, now seen corresponding path program 1 times [2024-09-20 20:03:41,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 20:03:41,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447589700] [2024-09-20 20:03:41,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 20:03:41,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 20:03:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 20:03:41,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275614498] [2024-09-20 20:03:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 20:03:41,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 20:03:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 20:03:41,862 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 20:03:41,863 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 20:03:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 20:03:42,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 181 conjuncts are in the unsatisfiable core [2024-09-20 20:03:42,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 20:03:42,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-20 20:03:42,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-20 20:03:42,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:03:42,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:03:42,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:03:42,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-09-20 20:03:42,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-20 20:03:42,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-20 20:03:42,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-20 20:03:42,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-20 20:03:43,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-09-20 20:03:43,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 35 [2024-09-20 20:03:43,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2024-09-20 20:03:43,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2024-09-20 20:03:43,296 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 29 treesize of output 27 [2024-09-20 20:03:43,301 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 27 treesize of output 25 [2024-09-20 20:04:19,732 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_3| Int) (v_arrayElimCell_29 Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_3| Int) (|v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_3| Int) (v_arrayElimCell_31 Int) (|v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_3| Int) (v_arrayElimCell_34 Int) (v_arrayElimCell_33 Int)) (= (* (mod (* (select (select |c_#memory_int#4| |v_func_to_recursive_line_35_to_46_0_#in~b.base_BEFORE_CALL_3|) |v_func_to_recursive_line_35_to_46_0_#in~b.offset_BEFORE_CALL_3|) (select (select |c_#memory_int#5| |v_func_to_recursive_line_35_to_46_0_#in~a.base_BEFORE_CALL_3|) |v_func_to_recursive_line_35_to_46_0_#in~a.offset_BEFORE_CALL_3|)) 2147483648) 2) (mod (+ (* v_arrayElimCell_29 v_arrayElimCell_34) (* v_arrayElimCell_33 v_arrayElimCell_31)) 4294967296))) is different from true [2024-09-20 20:04:36,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2024-09-20 20:04:36,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2024-09-20 20:04:36,370 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 47 treesize of output 43 [2024-09-20 20:04:36,377 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 49 treesize of output 45 [2024-09-20 20:04:39,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2024-09-20 20:04:39,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2024-09-20 20:04:39,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2024-09-20 20:04:39,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 20:04:39,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 72 [2024-09-20 20:04:39,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2024-09-20 20:04:39,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-20 20:04:39,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2024-09-20 20:04:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 1 not checked. [2024-09-20 20:04:43,465 INFO L327 TraceCheckSpWp]: Computing backward predicates...