./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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:15:57,536 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:15:57,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:15:57,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:15:57,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:15:57,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:15:57,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:15:57,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:15:57,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:15:57,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:15:57,635 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:15:57,635 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:15:57,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:15:57,640 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:15:57,640 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:15:57,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:15:57,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:15:57,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:15:57,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:15:57,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:15:57,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:15:57,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:15:57,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:15:57,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:15:57,643 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:15:57,643 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:15:57,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:15:57,644 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:15:57,644 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:15:57,644 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:15:57,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:15:57,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:15:57,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:15:57,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:15:57,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:15:57,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:15:57,645 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:15:57,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:15:57,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:15:57,645 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:15:57,645 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:15:57,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:15:57,647 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.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 15:15:57,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:15:57,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:15:57,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:15:57,898 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:15:57,900 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:15:57,901 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-10-15 15:15:59,232 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:15:59,417 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:15:59,417 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i [2024-10-15 15:15:59,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e6ee32b41/92aae60394044b12ba4dfd4684539c4d/FLAG46fb98ff5 [2024-10-15 15:15:59,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e6ee32b41/92aae60394044b12ba4dfd4684539c4d [2024-10-15 15:15:59,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:15:59,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:15:59,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:15:59,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:15:59,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:15:59,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:15:59" (1/1) ... [2024-10-15 15:15:59,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63841735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:15:59, skipping insertion in model container [2024-10-15 15:15:59,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:15:59" (1/1) ... [2024-10-15 15:15:59,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:15:59,988 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2024-10-15 15:16:00,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:16:00,016 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:16:00,027 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_array_index_value_4.i[1803,1816] [2024-10-15 15:16:00,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:16:00,054 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:16:00,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00 WrapperNode [2024-10-15 15:16:00,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:16:00,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:16:00,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:16:00,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:16:00,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,094 INFO L138 Inliner]: procedures = 20, calls = 62, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:16:00,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:16:00,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:16:00,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:16:00,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:16:00,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,123 INFO L175 MemorySlicer]: Split 37 memory accesses to 6 slices as follows [2, 5, 11, 3, 5, 11]. 30 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 0, 1, 0, 0]. The 9 writes are split as follows [0, 1, 3, 1, 1, 3]. [2024-10-15 15:16:00,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:16:00,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:16:00,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:16:00,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:16:00,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (1/1) ... [2024-10-15 15:16:00,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:16:00,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:16:00,197 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-10-15 15:16:00,199 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-10-15 15:16:00,235 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_40_to_41_0 [2024-10-15 15:16:00,235 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_40_to_41_0 [2024-10-15 15:16:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:16:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_49_to_54_0 [2024-10-15 15:16:00,236 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_49_to_54_0 [2024-10-15 15:16:00,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 15:16:00,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 15:16:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:16:00,237 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:16:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:16:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 15:16:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-15 15:16:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-15 15:16:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-15 15:16:00,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-15 15:16:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 15:16:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 15:16:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 15:16:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-15 15:16:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-15 15:16:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-15 15:16:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-15 15:16:00,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:16:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:16:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_58_to_61_0 [2024-10-15 15:16:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_58_to_61_0 [2024-10-15 15:16:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:16:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:16:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 15:16:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 15:16:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-15 15:16:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-15 15:16:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-15 15:16:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-15 15:16:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 15:16:00,240 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 15:16:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 15:16:00,341 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:16:00,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:16:00,553 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-15 15:16:00,554 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:16:00,584 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:16:00,586 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:16:00,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:16:00 BoogieIcfgContainer [2024-10-15 15:16:00,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:16:00,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:16:00,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:16:00,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:16:00,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:15:59" (1/3) ... [2024-10-15 15:16:00,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159656c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:16:00, skipping insertion in model container [2024-10-15 15:16:00,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:16:00" (2/3) ... [2024-10-15 15:16:00,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159656c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:16:00, skipping insertion in model container [2024-10-15 15:16:00,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:16:00" (3/3) ... [2024-10-15 15:16:00,593 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_array_index_value_4.i [2024-10-15 15:16:00,610 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:16:00,610 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:16:00,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:16:00,673 INFO L333 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;@53162823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:16:00,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:16:00,677 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-10-15 15:16:00,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-15 15:16:00,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:16:00,685 INFO L215 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-10-15 15:16:00,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:16:00,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1822521200, now seen corresponding path program 1 times [2024-10-15 15:16:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:16:00,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416105962] [2024-10-15 15:16:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:16:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:16:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:16:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:16:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:00,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 15:16:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:16:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:16:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416105962] [2024-10-15 15:16:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416105962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:16:00,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:16:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 15:16:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841794180] [2024-10-15 15:16:00,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:16:00,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 15:16:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:16:00,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 15:16:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 15:16:00,973 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-10-15 15:16:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:16:01,151 INFO L93 Difference]: Finished difference Result 102 states and 142 transitions. [2024-10-15 15:16:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 15:16:01,153 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-10-15 15:16:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:16:01,159 INFO L225 Difference]: With dead ends: 102 [2024-10-15 15:16:01,160 INFO L226 Difference]: Without dead ends: 56 [2024-10-15 15:16:01,162 INFO L431 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-10-15 15:16:01,165 INFO L432 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-10-15 15:16:01,166 INFO L433 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-10-15 15:16:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-15 15:16:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-10-15 15:16:01,196 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-10-15 15:16:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-10-15 15:16:01,200 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 31 [2024-10-15 15:16:01,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:16:01,201 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-10-15 15:16:01,201 INFO L472 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-10-15 15:16:01,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-10-15 15:16:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-15 15:16:01,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:16:01,204 INFO L215 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-10-15 15:16:01,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:16:01,204 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:16:01,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:01,205 INFO L85 PathProgramCache]: Analyzing trace with hash 86541932, now seen corresponding path program 1 times [2024-10-15 15:16:01,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:16:01,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850594829] [2024-10-15 15:16:01,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:16:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:16:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:16:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:01,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-15 15:16:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:01,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-15 15:16:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:01,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:16:01,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:16:01,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850594829] [2024-10-15 15:16:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850594829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:16:01,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:16:01,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-15 15:16:01,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713368575] [2024-10-15 15:16:01,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:16:01,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 15:16:01,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:16:01,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 15:16:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-15 15:16:01,590 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-10-15 15:16:01,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:16:01,824 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-10-15 15:16:01,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 15:16:01,825 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-10-15 15:16:01,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:16:01,826 INFO L225 Difference]: With dead ends: 81 [2024-10-15 15:16:01,828 INFO L226 Difference]: Without dead ends: 47 [2024-10-15 15:16:01,829 INFO L431 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-10-15 15:16:01,830 INFO L432 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-10-15 15:16:01,830 INFO L433 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-10-15 15:16:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-15 15:16:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-15 15:16:01,844 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-10-15 15:16:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2024-10-15 15:16:01,845 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 31 [2024-10-15 15:16:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:16:01,846 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2024-10-15 15:16:01,846 INFO L472 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-10-15 15:16:01,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2024-10-15 15:16:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-15 15:16:01,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:16:01,848 INFO L215 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-10-15 15:16:01,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 15:16:01,848 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:16:01,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash -685815108, now seen corresponding path program 1 times [2024-10-15 15:16:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:16:01,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995661809] [2024-10-15 15:16:01,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:16:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:02,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:16:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:16:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:02,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:16:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:02,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-15 15:16:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-15 15:16:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-15 15:16:02,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:16:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995661809] [2024-10-15 15:16:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995661809] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:16:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011778272] [2024-10-15 15:16:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:02,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:16:02,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:16:02,462 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-10-15 15:16:02,463 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 15:16:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:02,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-15 15:16:02,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:16:02,635 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-10-15 15:16:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-15 15:16:02,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:16:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-15 15:16:03,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011778272] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:16:03,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:16:03,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 23 [2024-10-15 15:16:03,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953716784] [2024-10-15 15:16:03,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:16:03,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-15 15:16:03,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:16:03,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-15 15:16:03,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-10-15 15:16:03,225 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 23 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-15 15:16:07,289 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-10-15 15:16:11,409 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-10-15 15:16:15,525 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-10-15 15:16:19,706 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-10-15 15:16:24,210 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-10-15 15:16:28,254 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-10-15 15:16:32,284 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-10-15 15:16:36,397 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-10-15 15:16:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:16:36,397 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2024-10-15 15:16:36,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-15 15:16:36,401 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) Word has length 36 [2024-10-15 15:16:36,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:16:36,402 INFO L225 Difference]: With dead ends: 116 [2024-10-15 15:16:36,402 INFO L226 Difference]: Without dead ends: 80 [2024-10-15 15:16:36,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1461, Unknown=0, NotChecked=0, Total=1640 [2024-10-15 15:16:36,403 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 73 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 37 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2024-10-15 15:16:36,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 156 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 826 Invalid, 8 Unknown, 0 Unchecked, 32.7s Time] [2024-10-15 15:16:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-15 15:16:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-10-15 15:16:36,414 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-10-15 15:16:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-10-15 15:16:36,415 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 36 [2024-10-15 15:16:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:16:36,415 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-10-15 15:16:36,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 20 states have internal predecessors, (45), 8 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2024-10-15 15:16:36,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2024-10-15 15:16:36,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-15 15:16:36,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:16:36,417 INFO L215 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-10-15 15:16:36,431 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 15:16:36,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:16:36,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:16:36,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:36,618 INFO L85 PathProgramCache]: Analyzing trace with hash -908744810, now seen corresponding path program 1 times [2024-10-15 15:16:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:16:36,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236732868] [2024-10-15 15:16:36,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:36,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:16:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:16:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:36,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:16:36,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:16:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:16:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 15:16:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:37,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 15:16:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-15 15:16:37,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:16:37,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236732868] [2024-10-15 15:16:37,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236732868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:16:37,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736220667] [2024-10-15 15:16:37,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:37,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:16:37,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:16:37,284 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-10-15 15:16:37,285 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 15:16:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:37,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-15 15:16:37,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:16:37,484 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-10-15 15:16:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-15 15:16:37,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:16:37,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736220667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:16:37,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 15:16:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-10-15 15:16:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701946262] [2024-10-15 15:16:37,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:16:37,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-15 15:16:37,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:16:37,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-15 15:16:37,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2024-10-15 15:16:37,633 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-10-15 15:16:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:16:37,896 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2024-10-15 15:16:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 15:16:37,896 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-10-15 15:16:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:16:37,897 INFO L225 Difference]: With dead ends: 81 [2024-10-15 15:16:37,897 INFO L226 Difference]: Without dead ends: 79 [2024-10-15 15:16:37,898 INFO L431 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-10-15 15:16:37,898 INFO L432 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.2s IncrementalHoareTripleChecker+Time [2024-10-15 15:16:37,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 349 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 15:16:37,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-15 15:16:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-10-15 15:16:37,909 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-10-15 15:16:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-10-15 15:16:37,910 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 41 [2024-10-15 15:16:37,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:16:37,910 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-10-15 15:16:37,910 INFO L472 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-10-15 15:16:37,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-10-15 15:16:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-15 15:16:37,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:16:37,912 INFO L215 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-10-15 15:16:37,926 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 15:16:38,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:16:38,116 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:16:38,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:38,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1404730042, now seen corresponding path program 1 times [2024-10-15 15:16:38,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:16:38,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139306168] [2024-10-15 15:16:38,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:38,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:16:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:38,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:16:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:38,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:16:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:16:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:38,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:16:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:38,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 15:16:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 15:16:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-15 15:16:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-15 15:16:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:16:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139306168] [2024-10-15 15:16:38,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139306168] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:16:38,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826604075] [2024-10-15 15:16:38,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:38,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:16:38,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:16:38,771 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-10-15 15:16:38,772 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 15:16:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:38,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-15 15:16:38,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:16:39,103 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-15 15:16:39,104 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-15 15:16:39,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826604075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:16:39,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-15 15:16:39,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2024-10-15 15:16:39,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275474341] [2024-10-15 15:16:39,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:16:39,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-15 15:16:39,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:16:39,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-15 15:16:39,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-10-15 15:16:39,105 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-10-15 15:16:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:16:39,260 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-10-15 15:16:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 15:16:39,261 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-10-15 15:16:39,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:16:39,262 INFO L225 Difference]: With dead ends: 96 [2024-10-15 15:16:39,262 INFO L226 Difference]: Without dead ends: 73 [2024-10-15 15:16:39,263 INFO L431 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-10-15 15:16:39,263 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:16:39,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 71 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:16:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-15 15:16:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-10-15 15:16:39,273 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-10-15 15:16:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2024-10-15 15:16:39,274 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 47 [2024-10-15 15:16:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:16:39,274 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2024-10-15 15:16:39,275 INFO L472 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-10-15 15:16:39,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2024-10-15 15:16:39,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-15 15:16:39,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:16:39,276 INFO L215 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-10-15 15:16:39,293 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-15 15:16:39,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:16:39,479 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:16:39,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:16:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1142626696, now seen corresponding path program 1 times [2024-10-15 15:16:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:16:39,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807881979] [2024-10-15 15:16:39,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:39,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:16:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:16:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:16:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:39,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:16:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:40,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:16:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:40,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-15 15:16:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 15:16:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:40,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-15 15:16:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-15 15:16:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:40,132 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-15 15:16:40,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:16:40,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807881979] [2024-10-15 15:16:40,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807881979] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:16:40,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377543315] [2024-10-15 15:16:40,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:16:40,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:16:40,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:16:40,138 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-10-15 15:16:40,158 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 15:16:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:16:40,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-15 15:16:40,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:16:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-15 15:16:40,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:16:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-15 15:16:45,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377543315] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:16:45,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:16:45,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 32 [2024-10-15 15:16:45,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224081606] [2024-10-15 15:16:45,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:16:45,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-15 15:16:45,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:16:45,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-15 15:16:45,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=857, Unknown=1, NotChecked=0, Total=992 [2024-10-15 15:16:45,727 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-10-15 15:16:50,022 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-10-15 15:16:54,036 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-10-15 15:17:06,081 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-10-15 15:17:10,089 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-10-15 15:17:14,139 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-10-15 15:17:18,151 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-10-15 15:17:18,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:17:18,657 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2024-10-15 15:17:18,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-15 15:17:18,657 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-10-15 15:17:18,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:17:18,658 INFO L225 Difference]: With dead ends: 147 [2024-10-15 15:17:18,658 INFO L226 Difference]: Without dead ends: 89 [2024-10-15 15:17:18,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=333, Invalid=1920, Unknown=3, NotChecked=0, Total=2256 [2024-10-15 15:17:18,660 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 105 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 73 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2024-10-15 15:17:18,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 134 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 622 Invalid, 6 Unknown, 0 Unchecked, 24.5s Time] [2024-10-15 15:17:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-15 15:17:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2024-10-15 15:17:18,674 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-10-15 15:17:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2024-10-15 15:17:18,675 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 57 [2024-10-15 15:17:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:17:18,675 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2024-10-15 15:17:18,675 INFO L472 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-10-15 15:17:18,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2024-10-15 15:17:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-15 15:17:18,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:17:18,677 INFO L215 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-10-15 15:17:18,690 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-15 15:17:18,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:18,880 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:17:18,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:17:18,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1504077856, now seen corresponding path program 2 times [2024-10-15 15:17:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:17:18,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287402419] [2024-10-15 15:17:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:17:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:17:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:19,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:17:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:19,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-15 15:17:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:20,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:20,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-15 15:17:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 15:17:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-15 15:17:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-15 15:17:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-15 15:17:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:17:21,646 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-15 15:17:21,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:17:21,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287402419] [2024-10-15 15:17:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287402419] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:17:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101429382] [2024-10-15 15:17:21,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:17:21,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:17:21,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:17:21,648 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-10-15 15:17:21,651 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 15:17:21,811 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:17:21,811 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:17:21,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-15 15:17:21,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:17:22,419 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-15 15:17:22,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:18:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 99 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-15 15:18:25,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101429382] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:18:25,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:18:25,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14, 30] total 64 [2024-10-15 15:18:25,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159546093] [2024-10-15 15:18:25,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:18:25,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-10-15 15:18:25,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:18:25,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-10-15 15:18:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=3643, Unknown=15, NotChecked=0, Total=4032 [2024-10-15 15:18:25,919 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-10-15 15:18:31,326 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-10-15 15:18:35,408 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-10-15 15:18:39,418 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-10-15 15:18:43,425 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-10-15 15:18:47,439 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-10-15 15:18:51,451 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-10-15 15:18:55,467 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-10-15 15:18:59,476 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-10-15 15:19:03,485 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-10-15 15:19:07,494 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-10-15 15:19:51,609 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-10-15 15:19:55,625 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-10-15 15:19:59,636 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-10-15 15:20:03,646 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-10-15 15:20:07,654 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-10-15 15:20:11,663 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-10-15 15:20:15,672 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-10-15 15:20:19,680 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-10-15 15:20:23,688 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-10-15 15:20:27,695 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-10-15 15:20:31,707 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-10-15 15:20:35,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-15 15:20:39,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []