./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i -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 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 19:57:31,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:57:31,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:57:31,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:57:31,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:57:32,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:57:32,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:57:32,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:57:32,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:57:32,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:57:32,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:57:32,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:57:32,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:57:32,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:57:32,030 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:57:32,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:57:32,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:57:32,031 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:57:32,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:57:32,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:57:32,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:57:32,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:57:32,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:57:32,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:57:32,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:57:32,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:57:32,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:57:32,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:57:32,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:57:32,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:57:32,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:57:32,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:57:32,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:57:32,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:57:32,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:57:32,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:57:32,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:57:32,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:57:32,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:57:32,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:57:32,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:57:32,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:57:32,038 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 -> 30b7823755366f973ac95243d129f8492129fd0a43fc3ddfb545e22ce84d0c90 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 19:57:32,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:57:32,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:57:32,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:57:32,308 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:57:32,309 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:57:32,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-09-12 19:57:33,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:57:33,803 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:57:33,804 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-09-12 19:57:33,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/10ec6b023/6dc3536ce8ad408d9e9d0b301d65b92d/FLAGe2454890a [2024-09-12 19:57:34,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/10ec6b023/6dc3536ce8ad408d9e9d0b301d65b92d [2024-09-12 19:57:34,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:57:34,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:57:34,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:57:34,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:57:34,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:57:34,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7580ba73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34, skipping insertion in model container [2024-09-12 19:57:34,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,244 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:57:34,367 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2024-09-12 19:57:34,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:57:34,406 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:57:34,416 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2024-09-12 19:57:34,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:57:34,443 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:57:34,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34 WrapperNode [2024-09-12 19:57:34,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:57:34,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:57:34,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:57:34,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:57:34,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,466 INFO L138 Inliner]: procedures = 20, calls = 62, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:57:34,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:57:34,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:57:34,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:57:34,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:57:34,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,492 INFO L175 MemorySlicer]: Split 37 memory accesses to 6 slices as follows [2, 11, 11, 3, 5, 5]. 30 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 0, 1, 1, 0]. The 9 writes are split as follows [0, 3, 3, 1, 1, 1]. [2024-09-12 19:57:34,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:57:34,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:57:34,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:57:34,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:57:34,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (1/1) ... [2024-09-12 19:57:34,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:57:34,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:57:34,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 19:57:34,570 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 19:57:34,597 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_40_to_41_0 [2024-09-12 19:57:34,598 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_40_to_41_0 [2024-09-12 19:57:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:57:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_49_to_54_0 [2024-09-12 19:57:34,598 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_49_to_54_0 [2024-09-12 19:57:34,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 19:57:34,599 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 19:57:34,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:57:34,600 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:57:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:57:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 19:57:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-12 19:57:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-12 19:57:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-12 19:57:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-12 19:57:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-12 19:57:34,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 19:57:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 19:57:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-12 19:57:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-12 19:57:34,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-12 19:57:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-12 19:57:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:57:34,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:57:34,602 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_58_to_61_0 [2024-09-12 19:57:34,603 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_58_to_61_0 [2024-09-12 19:57:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:57:34,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:57:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 19:57:34,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 19:57:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-12 19:57:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-12 19:57:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-12 19:57:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-12 19:57:34,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 19:57:34,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 19:57:34,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 19:57:34,707 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:57:34,709 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:57:34,948 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-12 19:57:34,949 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:57:34,966 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:57:34,969 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:57:34,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:57:34 BoogieIcfgContainer [2024-09-12 19:57:34,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:57:34,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:57:34,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:57:34,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:57:34,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:57:34" (1/3) ... [2024-09-12 19:57:34,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d73671a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:57:34, skipping insertion in model container [2024-09-12 19:57:34,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:57:34" (2/3) ... [2024-09-12 19:57:34,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d73671a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:57:34, skipping insertion in model container [2024-09-12 19:57:34,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:57:34" (3/3) ... [2024-09-12 19:57:34,976 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i [2024-09-12 19:57:34,988 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:57:34,988 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 19:57:35,039 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:57:35,044 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;@2bad3cb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:57:35,044 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 19:57:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-12 19:57:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 19:57:35,052 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:57:35,053 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 19:57:35,053 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:57:35,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:57:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1822521200, now seen corresponding path program 1 times [2024-09-12 19:57:35,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:57:35,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849343233] [2024-09-12 19:57:35,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:57:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:57:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:35,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:57:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:35,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:57:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:35,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:57:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:35,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 19:57:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:57:35,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:57:35,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849343233] [2024-09-12 19:57:35,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849343233] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:57:35,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:57:35,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 19:57:35,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515578386] [2024-09-12 19:57:35,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:57:35,322 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:57:35,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:57:35,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:57:35,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:57:35,342 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:57:35,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:57:35,487 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2024-09-12 19:57:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:57:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-09-12 19:57:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:57:35,495 INFO L225 Difference]: With dead ends: 102 [2024-09-12 19:57:35,495 INFO L226 Difference]: Without dead ends: 56 [2024-09-12 19:57:35,498 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:57:35,500 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:57:35,501 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 28 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:57:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-12 19:57:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-09-12 19:57:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 13 states have call successors, (13), 7 states have call predecessors, (13), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-12 19:57:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-09-12 19:57:35,536 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 31 [2024-09-12 19:57:35,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:57:35,536 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-09-12 19:57:35,537 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:57:35,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:57:35,537 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-09-12 19:57:35,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 19:57:35,539 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:57:35,539 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 19:57:35,539 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:57:35,539 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:57:35,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:57:35,540 INFO L85 PathProgramCache]: Analyzing trace with hash 86541932, now seen corresponding path program 1 times [2024-09-12 19:57:35,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:57:35,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371625321] [2024-09-12 19:57:35,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:57:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:57:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:35,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:57:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:35,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:57:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:35,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 19:57:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:35,883 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 19:57:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:57:35,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:57:35,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371625321] [2024-09-12 19:57:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371625321] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:57:35,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:57:35,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:57:35,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851049614] [2024-09-12 19:57:35,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:57:35,892 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:57:35,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:57:35,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:57:35,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:57:35,895 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 19:57:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:57:36,098 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-09-12 19:57:36,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:57:36,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2024-09-12 19:57:36,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:57:36,099 INFO L225 Difference]: With dead ends: 81 [2024-09-12 19:57:36,099 INFO L226 Difference]: Without dead ends: 47 [2024-09-12 19:57:36,100 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:57:36,100 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:57:36,101 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 49 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:57:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-12 19:57:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-09-12 19:57:36,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 13 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-09-12 19:57:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-09-12 19:57:36,116 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 31 [2024-09-12 19:57:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:57:36,116 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-09-12 19:57:36,116 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-12 19:57:36,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:57:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-09-12 19:57:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 19:57:36,118 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:57:36,118 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 19:57:36,118 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:57:36,119 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:57:36,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:57:36,119 INFO L85 PathProgramCache]: Analyzing trace with hash -685815108, now seen corresponding path program 1 times [2024-09-12 19:57:36,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:57:36,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806332817] [2024-09-12 19:57:36,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:57:36,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:57:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:36,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:57:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:36,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:57:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:36,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:57:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:36,525 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-12 19:57:36,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:36,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-12 19:57:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:36,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:57:36,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:57:36,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806332817] [2024-09-12 19:57:36,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806332817] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:57:36,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248024332] [2024-09-12 19:57:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:57:36,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:57:36,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:57:36,533 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:57:36,536 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-12 19:57:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:57:36,712 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 19:57:36,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:57:36,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-12 19:57:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:57:36,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:57:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:57:37,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248024332] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:57:37,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:57:37,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20 [2024-09-12 19:57:37,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938498439] [2024-09-12 19:57:37,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:57:37,206 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 19:57:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:57:37,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 19:57:37,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2024-09-12 19:57:37,208 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 20 states, 16 states have (on average 2.5625) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 19:57:41,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 19:57:45,342 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-12 19:57:49,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 19:57:53,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 19:57:57,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 19:58:01,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 19:58:06,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 19:58:10,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 19:58:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:10,076 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-09-12 19:58:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-12 19:58:10,079 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.5625) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 36 [2024-09-12 19:58:10,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:10,084 INFO L225 Difference]: With dead ends: 116 [2024-09-12 19:58:10,084 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 19:58:10,085 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=154, Invalid=1178, Unknown=0, NotChecked=0, Total=1332 [2024-09-12 19:58:10,085 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 35 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.5s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:10,086 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 138 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 730 Invalid, 8 Unknown, 0 Unchecked, 32.5s Time] [2024-09-12 19:58:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 19:58:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-09-12 19:58:10,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 49 states have internal predecessors, (52), 18 states have call successors, (18), 12 states have call predecessors, (18), 10 states have return successors, (16), 13 states have call predecessors, (16), 14 states have call successors, (16) [2024-09-12 19:58:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-09-12 19:58:10,101 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 36 [2024-09-12 19:58:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:10,102 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-09-12 19:58:10,102 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.5625) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 19:58:10,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2024-09-12 19:58:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 19:58:10,103 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:10,103 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-09-12 19:58:10,118 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 19:58:10,306 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:10,307 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:58:10,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:10,307 INFO L85 PathProgramCache]: Analyzing trace with hash -908744810, now seen corresponding path program 1 times [2024-09-12 19:58:10,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:10,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696224915] [2024-09-12 19:58:10,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:10,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:10,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:10,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:58:10,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:11,043 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:11,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:11,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 19:58:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:11,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 19:58:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 19:58:11,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:11,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696224915] [2024-09-12 19:58:11,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696224915] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:11,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478890817] [2024-09-12 19:58:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:11,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:11,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:11,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:58:11,205 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-12 19:58:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:11,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-12 19:58:11,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:58:11,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-12 19:58:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-12 19:58:11,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:58:11,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478890817] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:58:11,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:58:11,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-09-12 19:58:11,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350042248] [2024-09-12 19:58:11,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:58:11,482 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 19:58:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:11,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 19:58:11,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2024-09-12 19:58:11,483 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 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-12 19:58:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:11,669 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2024-09-12 19:58:11,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 19:58:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 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 41 [2024-09-12 19:58:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:11,670 INFO L225 Difference]: With dead ends: 81 [2024-09-12 19:58:11,670 INFO L226 Difference]: Without dead ends: 79 [2024-09-12 19:58:11,671 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2024-09-12 19:58:11,671 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:11,672 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 349 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:58:11,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-12 19:58:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-09-12 19:58:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 52 states have internal predecessors, (55), 18 states have call successors, (18), 13 states have call predecessors, (18), 11 states have return successors, (16), 13 states have call predecessors, (16), 14 states have call successors, (16) [2024-09-12 19:58:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-09-12 19:58:11,682 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 41 [2024-09-12 19:58:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:11,683 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-09-12 19:58:11,683 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 3 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-12 19:58:11,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-09-12 19:58:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-12 19:58:11,684 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:11,684 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-09-12 19:58:11,698 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 19:58:11,885 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:11,885 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:58:11,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:11,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1404730042, now seen corresponding path program 1 times [2024-09-12 19:58:11,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:11,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983300231] [2024-09-12 19:58:11,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:11,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:12,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:12,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:58:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:12,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:12,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:12,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 19:58:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:12,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 19:58:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:12,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-12 19:58:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 19:58:12,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:12,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983300231] [2024-09-12 19:58:12,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983300231] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:12,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695694135] [2024-09-12 19:58:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:12,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:12,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:12,481 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:58:12,482 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 19:58:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:12,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 19:58:12,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:58:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 19:58:12,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:58:12,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695694135] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:58:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:58:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2024-09-12 19:58:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51524125] [2024-09-12 19:58:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:58:12,851 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:58:12,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:12,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:58:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-09-12 19:58:12,851 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 19:58:12,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:12,991 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-09-12 19:58:12,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:58:12,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2024-09-12 19:58:12,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:12,992 INFO L225 Difference]: With dead ends: 96 [2024-09-12 19:58:12,992 INFO L226 Difference]: Without dead ends: 73 [2024-09-12 19:58:12,992 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2024-09-12 19:58:12,993 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:12,993 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 65 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:58:12,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-12 19:58:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-09-12 19:58:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 47 states have internal predecessors, (49), 16 states have call successors, (16), 12 states have call predecessors, (16), 11 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-12 19:58:13,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-09-12 19:58:13,006 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 47 [2024-09-12 19:58:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:13,006 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-09-12 19:58:13,006 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-12 19:58:13,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-09-12 19:58:13,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-12 19:58:13,007 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:13,007 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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-12 19:58:13,022 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 19:58:13,208 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:13,208 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:58:13,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:13,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1142626696, now seen corresponding path program 1 times [2024-09-12 19:58:13,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:13,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679089344] [2024-09-12 19:58:13,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:13,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:13,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:13,476 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:58:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:13,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:13,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:13,906 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-12 19:58:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:13,908 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-12 19:58:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:13,909 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-12 19:58:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:13,911 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-12 19:58:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-09-12 19:58:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679089344] [2024-09-12 19:58:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679089344] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237532100] [2024-09-12 19:58:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:13,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:13,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:13,918 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:58:13,922 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 19:58:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:14,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-12 19:58:14,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:58:14,244 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-12 19:58:14,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:58:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 19:58:18,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237532100] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:58:18,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:58:18,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 32 [2024-09-12 19:58:18,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092045238] [2024-09-12 19:58:18,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:58:18,899 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-12 19:58:18,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:58:18,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-12 19:58:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=857, Unknown=1, NotChecked=0, Total=992 [2024-09-12 19:58:18,900 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 32 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 27 states have internal predecessors, (52), 10 states have call successors, (20), 7 states have call predecessors, (20), 11 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-12 19:58:23,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 19:58:27,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 19:58:39,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 19:58:43,270 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 [] [2024-09-12 19:58:47,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 19:58:51,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 19:58:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:58:51,939 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2024-09-12 19:58:51,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-12 19:58:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 27 states have internal predecessors, (52), 10 states have call successors, (20), 7 states have call predecessors, (20), 11 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) Word has length 57 [2024-09-12 19:58:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:58:51,941 INFO L225 Difference]: With dead ends: 147 [2024-09-12 19:58:51,941 INFO L226 Difference]: Without dead ends: 89 [2024-09-12 19:58:51,942 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=333, Invalid=1920, Unknown=3, NotChecked=0, Total=2256 [2024-09-12 19:58:51,944 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 64 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 44 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2024-09-12 19:58:51,944 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 168 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 773 Invalid, 6 Unknown, 0 Unchecked, 24.6s Time] [2024-09-12 19:58:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-12 19:58:51,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2024-09-12 19:58:51,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 17 states have call successors, (17), 13 states have call predecessors, (17), 15 states have return successors, (19), 16 states have call predecessors, (19), 14 states have call successors, (19) [2024-09-12 19:58:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2024-09-12 19:58:51,966 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 57 [2024-09-12 19:58:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:58:51,966 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2024-09-12 19:58:51,966 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 27 states have internal predecessors, (52), 10 states have call successors, (20), 7 states have call predecessors, (20), 11 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-12 19:58:51,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2024-09-12 19:58:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-09-12 19:58:51,968 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:58:51,968 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 3, 3, 3, 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-12 19:58:51,983 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-12 19:58:52,172 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:52,173 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 19:58:52,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:58:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1504077856, now seen corresponding path program 2 times [2024-09-12 19:58:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:58:52,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313583727] [2024-09-12 19:58:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:58:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:58:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:53,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:58:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:53,103 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:58:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:53,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,552 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,728 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-12 19:58:54,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,939 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-12 19:58:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-12 19:58:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-12 19:58:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,945 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-09-12 19:58:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:58:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-09-12 19:58:54,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:58:54,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313583727] [2024-09-12 19:58:54,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313583727] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:58:54,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636947709] [2024-09-12 19:58:54,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:58:54,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:58:54,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:58:54,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:58:54,951 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 19:58:55,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:58:55,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:58:55,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-09-12 19:58:55,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:58:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-09-12 19:58:55,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:59:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 19:59:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636947709] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:59:59,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:59:59,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14, 30] total 64 [2024-09-12 19:59:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539950601] [2024-09-12 19:59:59,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:59:59,367 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-09-12 19:59:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:59:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-09-12 19:59:59,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=3643, Unknown=15, NotChecked=0, Total=4032 [2024-09-12 19:59:59,369 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 64 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 55 states have internal predecessors, (80), 18 states have call successors, (28), 11 states have call predecessors, (28), 23 states have return successors, (30), 20 states have call predecessors, (30), 18 states have call successors, (30) [2024-09-12 20:00:04,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:00:08,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:00:12,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:00:16,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:00:20,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:00:24,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:00:28,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:00:32,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:00:36,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:00:40,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=false, quantifiers [] [2024-09-12 20:01:24,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:01:28,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:01:32,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:01:36,901 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 [] [2024-09-12 20:01:40,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:01:44,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:01:48,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:01:52,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:01:56,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:02:00,954 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 [] [2024-09-12 20:02:04,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:02:08,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 20:02:12,986 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 [] [2024-09-12 20:02:16,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []