./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-crafted/simple_array_index_value_2.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 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/loop-crafted/simple_array_index_value_2.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 6dcb150490c6daa5a1cdb1426c8815f073186f609bef3d7e722a6c72be49ca91 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:19:55,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:19:55,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:19:55,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:19:55,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:19:55,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:19:55,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:19:55,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:19:55,703 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:19:55,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:19:55,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:19:55,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:19:55,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:19:55,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:19:55,704 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:19:55,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:19:55,708 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:19:55,708 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:19:55,708 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:19:55,708 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:19:55,708 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:19:55,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:19:55,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:19:55,711 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:19:55,712 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:19:55,712 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:19:55,712 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:19:55,712 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:19:55,712 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:19:55,713 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:19:55,713 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:19:55,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:19:55,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:19:55,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:19:55,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:19:55,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:19:55,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:19:55,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:19:55,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:19:55,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:19:55,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:19:55,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:19:55,715 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 -> 6dcb150490c6daa5a1cdb1426c8815f073186f609bef3d7e722a6c72be49ca91 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:19:55,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:19:55,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:19:55,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:19:55,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:19:55,978 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:19:55,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-crafted/simple_array_index_value_2.i [2024-09-25 10:19:57,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:19:57,414 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:19:57,417 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_2.i [2024-09-25 10:19:57,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0da10f9f9/6cdc452a45484ba7831b9f343feb0cdb/FLAG0e8a35c2a [2024-09-25 10:19:57,810 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0da10f9f9/6cdc452a45484ba7831b9f343feb0cdb [2024-09-25 10:19:57,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:19:57,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:19:57,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:19:57,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:19:57,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:19:57,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:19:57" (1/1) ... [2024-09-25 10:19:57,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc1351c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:57, skipping insertion in model container [2024-09-25 10:19:57,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:19:57" (1/1) ... [2024-09-25 10:19:57,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:19:57,957 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/loop-crafted/simple_array_index_value_2.i[919,932] [2024-09-25 10:19:57,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:19:57,982 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:19:57,993 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/loop-crafted/simple_array_index_value_2.i[919,932] [2024-09-25 10:19:57,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:19:58,012 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:19:58,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58 WrapperNode [2024-09-25 10:19:58,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:19:58,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:19:58,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:19:58,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:19:58,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,025 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,030 INFO L138 Inliner]: procedures = 17, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:19:58,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:19:58,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:19:58,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:19:58,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:19:58,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,055 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-25 10:19:58,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:19:58,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:19:58,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:19:58,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:19:58,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (1/1) ... [2024-09-25 10:19:58,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:19:58,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:19:58,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:19:58,101 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:19:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:19:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:19:58,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:19:58,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:19:58,145 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:19:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:19:58,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 10:19:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 10:19:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 10:19:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 10:19:58,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:19:58,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:19:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:19:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:19:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 10:19:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 10:19:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:19:58,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:19:58,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 10:19:58,209 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:19:58,210 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:19:58,308 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-25 10:19:58,309 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:19:58,332 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:19:58,333 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:19:58,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:19:58 BoogieIcfgContainer [2024-09-25 10:19:58,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:19:58,334 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:19:58,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:19:58,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:19:58,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:19:57" (1/3) ... [2024-09-25 10:19:58,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4234a3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:19:58, skipping insertion in model container [2024-09-25 10:19:58,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:19:58" (2/3) ... [2024-09-25 10:19:58,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4234a3ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:19:58, skipping insertion in model container [2024-09-25 10:19:58,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:19:58" (3/3) ... [2024-09-25 10:19:58,339 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_2.i [2024-09-25 10:19:58,351 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:19:58,351 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:19:58,399 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:19:58,405 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1bcf2ca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:19:58,405 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:19:58,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:19:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 10:19:58,414 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:19:58,415 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:19:58,415 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:19:58,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:19:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash 302093044, now seen corresponding path program 1 times [2024-09-25 10:19:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:19:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136119461] [2024-09-25 10:19:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:19:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:19:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:58,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:19:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:19:58,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:19:58,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136119461] [2024-09-25 10:19:58,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136119461] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:19:58,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:19:58,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:19:58,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55821831] [2024-09-25 10:19:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:19:58,573 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:19:58,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:19:58,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:19:58,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:19:58,594 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:19:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:19:58,615 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-09-25 10:19:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:19:58,617 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-25 10:19:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:19:58,621 INFO L225 Difference]: With dead ends: 47 [2024-09-25 10:19:58,626 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:19:58,629 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:19:58,632 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:19:58,633 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:19:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:19:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 10:19:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:19:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-09-25 10:19:58,657 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2024-09-25 10:19:58,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:19:58,657 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-09-25 10:19:58,657 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:19:58,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:19:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-09-25 10:19:58,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 10:19:58,658 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:19:58,659 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:19:58,659 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:19:58,659 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:19:58,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:19:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1791998188, now seen corresponding path program 1 times [2024-09-25 10:19:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:19:58,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660722380] [2024-09-25 10:19:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:19:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:19:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:58,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:19:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:58,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:19:58,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:19:58,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660722380] [2024-09-25 10:19:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660722380] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:19:58,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:19:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:19:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961814817] [2024-09-25 10:19:58,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:19:58,753 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:19:58,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:19:58,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:19:58,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:19:58,754 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:19:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:19:58,778 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-09-25 10:19:58,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:19:58,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-25 10:19:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:19:58,780 INFO L225 Difference]: With dead ends: 38 [2024-09-25 10:19:58,780 INFO L226 Difference]: Without dead ends: 28 [2024-09-25 10:19:58,780 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:19:58,781 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:19:58,781 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:19:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-25 10:19:58,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-09-25 10:19:58,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:19:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-09-25 10:19:58,791 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 12 [2024-09-25 10:19:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:19:58,791 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-09-25 10:19:58,791 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:19:58,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:19:58,792 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-09-25 10:19:58,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 10:19:58,793 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:19:58,793 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:19:58,794 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:19:58,794 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:19:58,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:19:58,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1348305993, now seen corresponding path program 1 times [2024-09-25 10:19:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:19:58,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396917779] [2024-09-25 10:19:58,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:19:58,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:19:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:58,912 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:19:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:58,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:19:58,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:19:58,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:19:58,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396917779] [2024-09-25 10:19:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396917779] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:19:58,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497376283] [2024-09-25 10:19:58,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:19:58,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:19:58,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:19:58,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:19:58,944 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:19:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:58,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-25 10:19:59,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:19:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:19:59,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:19:59,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:19:59,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497376283] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:19:59,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:19:59,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:19:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750879971] [2024-09-25 10:19:59,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:19:59,076 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:19:59,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:19:59,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:19:59,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:19:59,079 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:19:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:19:59,177 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-09-25 10:19:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:19:59,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 19 [2024-09-25 10:19:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:19:59,178 INFO L225 Difference]: With dead ends: 52 [2024-09-25 10:19:59,178 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 10:19:59,179 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:19:59,180 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:19:59,181 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 82 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:19:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 10:19:59,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2024-09-25 10:19:59,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:19:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-25 10:19:59,188 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2024-09-25 10:19:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:19:59,188 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-25 10:19:59,188 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:19:59,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:19:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-25 10:19:59,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-25 10:19:59,190 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:19:59,190 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:19:59,203 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:19:59,395 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:19:59,396 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:19:59,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:19:59,396 INFO L85 PathProgramCache]: Analyzing trace with hash 142257068, now seen corresponding path program 2 times [2024-09-25 10:19:59,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:19:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964366759] [2024-09-25 10:19:59,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:19:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:19:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:59,616 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:19:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:59,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:19:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:59,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:19:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:59,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 10:19:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:59,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-25 10:19:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:19:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:19:59,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:19:59,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964366759] [2024-09-25 10:19:59,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964366759] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:19:59,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093207470] [2024-09-25 10:19:59,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:19:59,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:19:59,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:19:59,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:19:59,652 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:19:59,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:19:59,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:19:59,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 10:19:59,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:19:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:19:59,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:19:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-25 10:19:59,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093207470] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:19:59,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:19:59,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-25 10:19:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646252048] [2024-09-25 10:19:59,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:19:59,893 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:19:59,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:19:59,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:19:59,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:19:59,896 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 10:20:00,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:20:00,234 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2024-09-25 10:20:00,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 10:20:00,234 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 40 [2024-09-25 10:20:00,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:20:00,235 INFO L225 Difference]: With dead ends: 88 [2024-09-25 10:20:00,235 INFO L226 Difference]: Without dead ends: 78 [2024-09-25 10:20:00,236 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:20:00,236 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:20:00,237 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 160 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:20:00,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-25 10:20:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2024-09-25 10:20:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:20:00,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-09-25 10:20:00,257 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 40 [2024-09-25 10:20:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:20:00,257 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-09-25 10:20:00,257 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 10 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 10:20:00,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:20:00,257 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-09-25 10:20:00,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-25 10:20:00,263 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:20:00,264 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:20:00,278 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:20:00,464 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:20:00,465 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:20:00,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:20:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1112716340, now seen corresponding path program 3 times [2024-09-25 10:20:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:20:00,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005188654] [2024-09-25 10:20:00,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:20:00,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:20:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:20:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:20:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:20:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 10:20:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-25 10:20:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-25 10:20:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 10:20:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-25 10:20:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-25 10:20:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 10:20:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-09-25 10:20:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-09-25 10:20:00,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:20:00,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005188654] [2024-09-25 10:20:00,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005188654] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:20:00,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1730299189] [2024-09-25 10:20:00,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:20:00,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:20:00,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:20:00,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:20:00,849 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:20:10,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-25 10:20:10,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:20:10,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-25 10:20:10,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:20:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-09-25 10:20:10,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:20:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-09-25 10:20:10,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1730299189] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:20:10,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:20:10,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-09-25 10:20:10,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271303374] [2024-09-25 10:20:10,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:20:10,501 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 10:20:10,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:20:10,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 10:20:10,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2024-09-25 10:20:10,502 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:20:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:20:13,282 INFO L93 Difference]: Finished difference Result 160 states and 215 transitions. [2024-09-25 10:20:13,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-25 10:20:13,282 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Word has length 82 [2024-09-25 10:20:13,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:20:13,283 INFO L225 Difference]: With dead ends: 160 [2024-09-25 10:20:13,284 INFO L226 Difference]: Without dead ends: 150 [2024-09-25 10:20:13,284 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=440, Invalid=750, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 10:20:13,285 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 96 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:20:13,285 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 586 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 10:20:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-09-25 10:20:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 86. [2024-09-25 10:20:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.0350877192982457) internal successors, (59), 57 states have internal predecessors, (59), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-25 10:20:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2024-09-25 10:20:13,308 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 82 [2024-09-25 10:20:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:20:13,309 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2024-09-25 10:20:13,309 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 25 states have internal predecessors, (55), 22 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 10:20:13,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:20:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2024-09-25 10:20:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-09-25 10:20:13,312 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:20:13,312 INFO L216 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:20:13,328 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:20:13,513 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:20:13,513 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:20:13,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:20:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1141500916, now seen corresponding path program 4 times [2024-09-25 10:20:13,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:20:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058421826] [2024-09-25 10:20:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:20:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:20:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:20:14,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:20:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:20:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 10:20:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-25 10:20:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-25 10:20:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 10:20:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-25 10:20:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-25 10:20:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 10:20:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-09-25 10:20:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-25 10:20:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-25 10:20:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,317 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-25 10:20:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-09-25 10:20:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,321 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-09-25 10:20:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-25 10:20:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-25 10:20:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-09-25 10:20:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-09-25 10:20:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-09-25 10:20:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-09-25 10:20:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-09-25 10:20:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-09-25 10:20:14,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:20:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058421826] [2024-09-25 10:20:14,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058421826] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:20:14,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126296836] [2024-09-25 10:20:14,341 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:20:14,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:20:14,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:20:14,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:20:14,343 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:20:14,458 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:20:14,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:20:14,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 191 conjuncts are in the unsatisfiable core [2024-09-25 10:20:14,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:20:14,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-25 10:20:14,909 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:14,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:15,179 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:15,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:15,404 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:15,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:15,647 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:15,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:15,851 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:15,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:15,996 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:15,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:16,294 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:16,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:16,482 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:16,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:16,891 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:16,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:17,206 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:17,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:17,340 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:17,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:17,663 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:17,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:17,918 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:17,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:18,036 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:18,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:18,156 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:18,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:18,519 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:18,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:18,799 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:18,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:18,969 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:18,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:19,272 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:19,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:19,407 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:19,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:19,524 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-25 10:20:19,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-09-25 10:20:19,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-09-25 10:20:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 84 proven. 64 refuted. 0 times theorem prover too weak. 1491 trivial. 0 not checked. [2024-09-25 10:20:19,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:20:23,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126296836] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:20:23,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:20:23,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16] total 38 [2024-09-25 10:20:23,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616559893] [2024-09-25 10:20:23,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:20:23,940 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-25 10:20:23,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:20:23,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-25 10:20:23,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1751, Unknown=1, NotChecked=0, Total=1892 [2024-09-25 10:20:23,941 INFO L87 Difference]: Start difference. First operand 86 states and 108 transitions. Second operand has 38 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 34 states have internal predecessors, (69), 26 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 24 states have call successors, (25) [2024-09-25 10:20:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:20:26,648 INFO L93 Difference]: Finished difference Result 180 states and 228 transitions. [2024-09-25 10:20:26,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-09-25 10:20:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 34 states have internal predecessors, (69), 26 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 24 states have call successors, (25) Word has length 166 [2024-09-25 10:20:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:20:26,651 INFO L225 Difference]: With dead ends: 180 [2024-09-25 10:20:26,651 INFO L226 Difference]: Without dead ends: 170 [2024-09-25 10:20:26,656 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 171 SyntacticMatches, 32 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1731 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=667, Invalid=7522, Unknown=1, NotChecked=0, Total=8190 [2024-09-25 10:20:26,657 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 118 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 4536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-09-25 10:20:26,657 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 798 Invalid, 4536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-09-25 10:20:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-09-25 10:20:26,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 102. [2024-09-25 10:20:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 69 states have internal predecessors, (70), 28 states have call successors, (28), 6 states have call predecessors, (28), 5 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-25 10:20:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-09-25 10:20:26,689 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 166 [2024-09-25 10:20:26,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:20:26,689 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-09-25 10:20:26,689 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 34 states have internal predecessors, (69), 26 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 25 states have call predecessors, (25), 24 states have call successors, (25) [2024-09-25 10:20:26,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:20:26,690 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-09-25 10:20:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-09-25 10:20:26,694 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:20:26,694 INFO L216 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:20:26,708 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:20:26,895 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:20:26,895 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:20:26,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:20:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1553173923, now seen corresponding path program 1 times [2024-09-25 10:20:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:20:26,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349400502] [2024-09-25 10:20:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:20:26,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:20:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:20:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:20:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:20:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 10:20:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-25 10:20:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-25 10:20:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 10:20:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-25 10:20:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-25 10:20:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 10:20:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-09-25 10:20:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-25 10:20:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,740 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-25 10:20:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,743 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-25 10:20:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,744 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-09-25 10:20:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-09-25 10:20:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,751 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-25 10:20:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,753 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-25 10:20:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,756 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-09-25 10:20:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-09-25 10:20:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-09-25 10:20:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,762 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-09-25 10:20:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-09-25 10:20:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,766 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-09-25 10:20:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-09-25 10:20:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-09-25 10:20:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1960 backedges. 2 proven. 852 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2024-09-25 10:20:27,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:20:27,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349400502] [2024-09-25 10:20:27,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349400502] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:20:27,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673419031] [2024-09-25 10:20:27,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:20:27,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:20:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:20:27,777 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:20:27,777 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:20:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:27,905 INFO L262 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 198 conjuncts are in the unsatisfiable core [2024-09-25 10:20:27,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:20:27,998 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 19 treesize of output 1 [2024-09-25 10:20:28,245 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:28,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:28,654 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:28,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:29,002 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:29,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:29,326 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:29,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:29,472 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:29,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:29,572 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:29,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:29,801 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:29,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:29,933 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:29,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:30,401 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:30,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:30,600 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:30,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:30,882 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:30,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:31,098 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:31,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:31,409 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:31,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:31,781 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:31,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:31,937 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:31,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:32,277 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:32,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:32,663 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:32,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:32,767 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:32,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:33,106 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:33,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:33,316 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:33,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:33,597 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:33,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:33,815 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-09-25 10:20:33,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-09-25 10:20:34,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-09-25 10:20:34,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1960 backedges. 179 proven. 141 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-09-25 10:20:34,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:20:42,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673419031] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:20:42,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 10:20:42,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 41 [2024-09-25 10:20:42,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268260950] [2024-09-25 10:20:42,698 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 10:20:42,699 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-25 10:20:42,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:20:42,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-25 10:20:42,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1916, Unknown=2, NotChecked=0, Total=2070 [2024-09-25 10:20:42,701 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 41 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 29 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 28 states have call successors, (29) [2024-09-25 10:20:46,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 10:20:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:20:50,212 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2024-09-25 10:20:50,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-09-25 10:20:50,212 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 29 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 28 states have call successors, (29) Word has length 187 [2024-09-25 10:20:50,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:20:50,215 INFO L225 Difference]: With dead ends: 206 [2024-09-25 10:20:50,216 INFO L226 Difference]: Without dead ends: 190 [2024-09-25 10:20:50,218 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 198 SyntacticMatches, 40 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=700, Invalid=8228, Unknown=2, NotChecked=0, Total=8930 [2024-09-25 10:20:50,218 INFO L434 NwaCegarLoop]: 64 mSDtfsCounter, 141 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 4702 mSolverCounterSat, 171 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 4874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 4702 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:20:50,219 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1185 Invalid, 4874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 4702 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2024-09-25 10:20:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-09-25 10:20:50,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 119. [2024-09-25 10:20:50,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.025) internal successors, (82), 81 states have internal predecessors, (82), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-25 10:20:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2024-09-25 10:20:50,241 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 143 transitions. Word has length 187 [2024-09-25 10:20:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:20:50,242 INFO L474 AbstractCegarLoop]: Abstraction has 119 states and 143 transitions. [2024-09-25 10:20:50,242 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 29 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 28 states have call successors, (29) [2024-09-25 10:20:50,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:20:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2024-09-25 10:20:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-09-25 10:20:50,244 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:20:50,244 INFO L216 NwaCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:20:50,257 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:20:50,448 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-25 10:20:50,448 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:20:50,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:20:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash 772297452, now seen corresponding path program 2 times [2024-09-25 10:20:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:20:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405657476] [2024-09-25 10:20:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:20:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:20:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:20:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,271 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 10:20:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-25 10:20:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,275 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 10:20:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,278 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-25 10:20:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-25 10:20:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-25 10:20:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-25 10:20:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,284 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-25 10:20:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-25 10:20:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-09-25 10:20:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-25 10:20:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-25 10:20:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-25 10:20:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-09-25 10:20:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-09-25 10:20:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-25 10:20:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-25 10:20:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-09-25 10:20:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,304 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-09-25 10:20:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,306 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-09-25 10:20:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,307 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-09-25 10:20:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,309 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-09-25 10:20:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-09-25 10:20:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-09-25 10:20:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-09-25 10:20:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,316 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-09-25 10:20:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-09-25 10:20:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,320 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-09-25 10:20:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:20:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2316 backedges. 4 proven. 1001 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2024-09-25 10:20:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:20:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405657476] [2024-09-25 10:20:51,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405657476] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:20:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338263934] [2024-09-25 10:20:51,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:20:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:20:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:20:51,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:20:51,327 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:20:51,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:20:51,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:20:51,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 232 conjuncts are in the unsatisfiable core [2024-09-25 10:20:51,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:20:51,832 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 19 treesize of output 1 [2024-09-25 10:20:52,065 INFO L349 Elim1Store]: treesize reduction 39, result has 32.8 percent of original size [2024-09-25 10:20:52,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2024-09-25 10:20:52,450 INFO L349 Elim1Store]: treesize reduction 104, result has 27.3 percent of original size [2024-09-25 10:20:52,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 77 [2024-09-25 10:20:54,470 INFO L349 Elim1Store]: treesize reduction 1316, result has 21.5 percent of original size [2024-09-25 10:20:54,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 6 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 110 case distinctions, treesize of input 190 treesize of output 467 [2024-09-25 10:22:03,746 WARN L293 SmtUtils]: Spent 24.34s on a formula simplification. DAG size of input: 1089 DAG size of output: 1056 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)