./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 --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/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 --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 11:59:09,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 11:59:09,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 11:59:09,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 11:59:09,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 11:59:09,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 11:59:09,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 11:59:09,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 11:59:09,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 11:59:09,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 11:59:09,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 11:59:09,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 11:59:09,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 11:59:09,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 11:59:09,819 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 11:59:09,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 11:59:09,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 11:59:09,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 11:59:09,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 11:59:09,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 11:59:09,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 11:59:09,825 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 11:59:09,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 11:59:09,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 11:59:09,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 11:59:09,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 11:59:09,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 11:59:09,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 11:59:09,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 11:59:09,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 11:59:09,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 11:59:09,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 11:59:09,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 11:59:09,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 11:59:09,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 11:59:09,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 11:59:09,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 11:59:09,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 11:59:09,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 11:59:09,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 11:59:09,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 11:59:09,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 11:59:09,830 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 11:59:10,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 11:59:10,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 11:59:10,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 11:59:10,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 11:59:10,146 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 11:59:10,147 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-20 11:59:11,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 11:59:11,750 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 11:59:11,751 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_2.i [2024-09-20 11:59:11,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7ae862a6a/153226900c40431b806171bea835fb1e/FLAGf293a1371 [2024-09-20 11:59:12,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7ae862a6a/153226900c40431b806171bea835fb1e [2024-09-20 11:59:12,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 11:59:12,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 11:59:12,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 11:59:12,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 11:59:12,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 11:59:12,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@188ea456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12, skipping insertion in model container [2024-09-20 11:59:12,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 11:59:12,313 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-20 11:59:12,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 11:59:12,334 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 11:59:12,346 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-20 11:59:12,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 11:59:12,366 INFO L204 MainTranslator]: Completed translation [2024-09-20 11:59:12,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12 WrapperNode [2024-09-20 11:59:12,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 11:59:12,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 11:59:12,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 11:59:12,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 11:59:12,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,389 INFO L138 Inliner]: procedures = 17, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 11:59:12,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 11:59:12,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 11:59:12,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 11:59:12,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 11:59:12,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,422 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 [0, 2]. The 1 writes are split as follows [1, 0]. [2024-09-20 11:59:12,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 11:59:12,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 11:59:12,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 11:59:12,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 11:59:12,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (1/1) ... [2024-09-20 11:59:12,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 11:59:12,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:59:12,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 11:59:12,489 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 11:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 11:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 11:59:12,531 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 11:59:12,531 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 11:59:12,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 11:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 11:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-20 11:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-20 11:59:12,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-20 11:59:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-20 11:59:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 11:59:12,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 11:59:12,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 11:59:12,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 11:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-20 11:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-20 11:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 11:59:12,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 11:59:12,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-20 11:59:12,603 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 11:59:12,613 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 11:59:12,781 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-20 11:59:12,782 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 11:59:12,812 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 11:59:12,813 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-20 11:59:12,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:59:12 BoogieIcfgContainer [2024-09-20 11:59:12,813 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 11:59:12,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 11:59:12,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 11:59:12,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 11:59:12,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 11:59:12" (1/3) ... [2024-09-20 11:59:12,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b8fdde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:59:12, skipping insertion in model container [2024-09-20 11:59:12,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:59:12" (2/3) ... [2024-09-20 11:59:12,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24b8fdde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:59:12, skipping insertion in model container [2024-09-20 11:59:12,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:59:12" (3/3) ... [2024-09-20 11:59:12,824 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_2.i [2024-09-20 11:59:12,840 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 11:59:12,840 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 11:59:12,886 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 11:59:12,892 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;@1ccdef1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 11:59:12,893 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 11:59:12,897 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-20 11:59:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-20 11:59:12,909 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:59:12,910 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:59:12,910 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:59:12,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash 302093044, now seen corresponding path program 1 times [2024-09-20 11:59:12,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:59:12,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538242005] [2024-09-20 11:59:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:59:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:59:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:13,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:59:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:59:13,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:59:13,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538242005] [2024-09-20 11:59:13,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538242005] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:59:13,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:59:13,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 11:59:13,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383794240] [2024-09-20 11:59:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:59:13,105 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 11:59:13,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:59:13,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 11:59:13,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 11:59:13,134 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-20 11:59:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:59:13,169 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-09-20 11:59:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 11:59:13,172 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-20 11:59:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:59:13,177 INFO L225 Difference]: With dead ends: 47 [2024-09-20 11:59:13,177 INFO L226 Difference]: Without dead ends: 22 [2024-09-20 11:59:13,181 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-20 11:59:13,185 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-20 11:59:13,186 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-20 11:59:13,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-20 11:59:13,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-20 11:59:13,216 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-20 11:59:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-09-20 11:59:13,219 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2024-09-20 11:59:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:59:13,219 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-09-20 11:59:13,220 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-20 11:59:13,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-09-20 11:59:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-20 11:59:13,222 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:59:13,222 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 11:59:13,223 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 11:59:13,223 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:59:13,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:13,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1791998188, now seen corresponding path program 1 times [2024-09-20 11:59:13,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:59:13,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667006985] [2024-09-20 11:59:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:59:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:59:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:13,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:59:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:13,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 11:59:13,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:59:13,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667006985] [2024-09-20 11:59:13,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667006985] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 11:59:13,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 11:59:13,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 11:59:13,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148715995] [2024-09-20 11:59:13,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 11:59:13,415 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 11:59:13,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:59:13,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 11:59:13,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 11:59:13,416 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-20 11:59:13,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:59:13,462 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-09-20 11:59:13,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 11:59:13,467 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-20 11:59:13,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:59:13,469 INFO L225 Difference]: With dead ends: 38 [2024-09-20 11:59:13,469 INFO L226 Difference]: Without dead ends: 28 [2024-09-20 11:59:13,469 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 11:59:13,470 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-20 11:59:13,471 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-20 11:59:13,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-20 11:59:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-09-20 11:59:13,482 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-20 11:59:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-09-20 11:59:13,483 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 12 [2024-09-20 11:59:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:59:13,483 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-09-20 11:59:13,483 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-20 11:59:13,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:13,484 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-09-20 11:59:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-20 11:59:13,484 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:59:13,484 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-20 11:59:13,484 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 11:59:13,485 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:59:13,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:13,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1348305993, now seen corresponding path program 1 times [2024-09-20 11:59:13,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:59:13,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899305607] [2024-09-20 11:59:13,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:59:13,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:59:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:13,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:59:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:13,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:59:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:13,681 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-20 11:59:13,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:59:13,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899305607] [2024-09-20 11:59:13,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899305607] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:59:13,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540637349] [2024-09-20 11:59:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:59:13,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:59:13,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:59:13,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 11:59:13,689 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 11:59:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:13,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-20 11:59:13,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 11:59:13,781 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-20 11:59:13,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 11:59:13,834 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-20 11:59:13,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540637349] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 11:59:13,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 11:59:13,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-20 11:59:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035629579] [2024-09-20 11:59:13,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 11:59:13,836 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-20 11:59:13,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:59:13,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-20 11:59:13,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-09-20 11:59:13,838 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-20 11:59:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:59:13,946 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-09-20 11:59:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-20 11:59:13,947 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-20 11:59:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:59:13,948 INFO L225 Difference]: With dead ends: 52 [2024-09-20 11:59:13,949 INFO L226 Difference]: Without dead ends: 42 [2024-09-20 11:59:13,949 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-20 11:59:13,950 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-20 11:59:13,951 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-20 11:59:13,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-20 11:59:13,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2024-09-20 11:59:13,959 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-20 11:59:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-09-20 11:59:13,961 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2024-09-20 11:59:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:59:13,961 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-09-20 11:59:13,961 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-20 11:59:13,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-09-20 11:59:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-20 11:59:13,964 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:59:13,964 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-20 11:59:13,979 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 11:59:14,168 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-20 11:59:14,169 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:59:14,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash 142257068, now seen corresponding path program 2 times [2024-09-20 11:59:14,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:59:14,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758773705] [2024-09-20 11:59:14,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:59:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:59:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:14,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:59:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:14,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:59:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:14,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 11:59:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:14,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 11:59:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:14,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 11:59:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:14,484 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-20 11:59:14,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:59:14,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758773705] [2024-09-20 11:59:14,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758773705] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:59:14,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597163027] [2024-09-20 11:59:14,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 11:59:14,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:59:14,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:59:14,492 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 11:59:14,494 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-20 11:59:14,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 11:59:14,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 11:59:14,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-20 11:59:14,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 11:59:14,652 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-20 11:59:14,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 11:59:14,813 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-20 11:59:14,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597163027] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 11:59:14,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 11:59:14,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-20 11:59:14,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307118762] [2024-09-20 11:59:14,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 11:59:14,814 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-20 11:59:14,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:59:14,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-20 11:59:14,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-09-20 11:59:14,818 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-20 11:59:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:59:15,255 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2024-09-20 11:59:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-20 11:59:15,256 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-20 11:59:15,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:59:15,257 INFO L225 Difference]: With dead ends: 88 [2024-09-20 11:59:15,258 INFO L226 Difference]: Without dead ends: 78 [2024-09-20 11:59:15,258 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-20 11:59:15,259 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.3s IncrementalHoareTripleChecker+Time [2024-09-20 11:59:15,259 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.3s Time] [2024-09-20 11:59:15,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-20 11:59:15,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2024-09-20 11:59:15,271 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-20 11:59:15,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-09-20 11:59:15,272 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 40 [2024-09-20 11:59:15,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:59:15,273 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-09-20 11:59:15,273 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-20 11:59:15,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-09-20 11:59:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-20 11:59:15,275 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:59:15,275 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-20 11:59:15,292 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 11:59:15,479 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:59:15,480 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:59:15,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1112716340, now seen corresponding path program 3 times [2024-09-20 11:59:15,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:59:15,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521640328] [2024-09-20 11:59:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:59:15,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:59:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:15,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:59:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:59:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,013 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 11:59:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 11:59:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,029 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 11:59:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-20 11:59:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,042 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-20 11:59:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-20 11:59:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-20 11:59:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,059 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-20 11:59:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,065 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-09-20 11:59:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:16,073 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-20 11:59:16,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:59:16,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521640328] [2024-09-20 11:59:16,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521640328] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:59:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404899663] [2024-09-20 11:59:16,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-20 11:59:16,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:59:16,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:59:16,077 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 11:59:16,079 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-20 11:59:25,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-09-20 11:59:25,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 11:59:25,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-20 11:59:25,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 11:59:25,972 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-20 11:59:25,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 11:59:26,356 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-20 11:59:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404899663] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 11:59:26,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 11:59:26,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-09-20 11:59:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710618434] [2024-09-20 11:59:26,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 11:59:26,359 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-20 11:59:26,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:59:26,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-20 11:59:26,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2024-09-20 11:59:26,362 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-20 11:59:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:59:29,296 INFO L93 Difference]: Finished difference Result 160 states and 215 transitions. [2024-09-20 11:59:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-20 11:59:29,297 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-20 11:59:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:59:29,300 INFO L225 Difference]: With dead ends: 160 [2024-09-20 11:59:29,300 INFO L226 Difference]: Without dead ends: 150 [2024-09-20 11:59:29,304 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-20 11:59:29,305 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 96 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.8s IncrementalHoareTripleChecker+Time [2024-09-20 11:59:29,305 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.8s Time] [2024-09-20 11:59:29,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-09-20 11:59:29,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 86. [2024-09-20 11:59:29,339 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-20 11:59:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2024-09-20 11:59:29,341 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 82 [2024-09-20 11:59:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:59:29,342 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2024-09-20 11:59:29,342 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-20 11:59:29,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:29,342 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2024-09-20 11:59:29,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-09-20 11:59:29,347 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:59:29,347 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-20 11:59:29,368 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 11:59:29,547 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:59:29,548 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:59:29,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:29,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1141500916, now seen corresponding path program 4 times [2024-09-20 11:59:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:59:29,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19854038] [2024-09-20 11:59:29,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:59:29,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:59:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:59:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:59:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 11:59:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,489 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 11:59:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 11:59:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-20 11:59:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-20 11:59:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-20 11:59:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,506 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-20 11:59:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,509 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-20 11:59:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-09-20 11:59:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-20 11:59:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,518 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-20 11:59:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-20 11:59:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-09-20 11:59:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-09-20 11:59:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-20 11:59:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-20 11:59:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-09-20 11:59:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-09-20 11:59:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-09-20 11:59:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,546 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-09-20 11:59:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-09-20 11:59:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:30,553 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-20 11:59:30,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:59:30,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19854038] [2024-09-20 11:59:30,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19854038] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:59:30,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548545589] [2024-09-20 11:59:30,554 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-20 11:59:30,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:59:30,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:59:30,556 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 11:59:30,557 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-20 11:59:30,688 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-20 11:59:30,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 11:59:30,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 191 conjuncts are in the unsatisfiable core [2024-09-20 11:59:30,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 11:59:30,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-20 11:59:31,297 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:31,297 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-20 11:59:31,618 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:31,618 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-20 11:59:31,939 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:31,939 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-20 11:59:32,220 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:32,221 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-20 11:59:32,470 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:32,470 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-20 11:59:33,181 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:33,182 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-20 11:59:33,694 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:33,694 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-20 11:59:33,946 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:33,947 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-20 11:59:34,510 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:34,510 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-20 11:59:34,665 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:34,665 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-20 11:59:35,098 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:35,098 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-20 11:59:35,531 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:35,531 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-20 11:59:36,012 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:36,012 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-20 11:59:36,532 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:36,533 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-20 11:59:36,842 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:36,842 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-20 11:59:37,397 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:37,398 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-20 11:59:37,893 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:37,893 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-20 11:59:38,272 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:38,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-20 11:59:38,746 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:38,747 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-20 11:59:38,894 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:38,895 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-20 11:59:39,057 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-09-20 11:59:39,057 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-20 11:59:39,397 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-20 11:59:39,487 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-20 11:59:39,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 11:59:43,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548545589] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:59:43,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 11:59:43,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16] total 38 [2024-09-20 11:59:43,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995436950] [2024-09-20 11:59:43,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 11:59:43,806 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-20 11:59:43,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 11:59:43,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-20 11:59:43,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1751, Unknown=1, NotChecked=0, Total=1892 [2024-09-20 11:59:43,808 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-20 11:59:47,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 11:59:47,123 INFO L93 Difference]: Finished difference Result 180 states and 228 transitions. [2024-09-20 11:59:47,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-09-20 11:59:47,124 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-20 11:59:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 11:59:47,126 INFO L225 Difference]: With dead ends: 180 [2024-09-20 11:59:47,126 INFO L226 Difference]: Without dead ends: 170 [2024-09-20 11:59:47,129 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 164 SyntacticMatches, 39 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1780 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=667, Invalid=7522, Unknown=1, NotChecked=0, Total=8190 [2024-09-20 11:59:47,130 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 118 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2024-09-20 11:59:47,130 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 798 Invalid, 4536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-09-20 11:59:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-09-20 11:59:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 102. [2024-09-20 11:59:47,181 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-20 11:59:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-09-20 11:59:47,185 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 166 [2024-09-20 11:59:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 11:59:47,186 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-09-20 11:59:47,186 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-20 11:59:47,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-09-20 11:59:47,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-09-20 11:59:47,191 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 11:59:47,192 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-20 11:59:47,209 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-20 11:59:47,392 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:59:47,393 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 11:59:47,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 11:59:47,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1553173923, now seen corresponding path program 1 times [2024-09-20 11:59:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 11:59:47,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738340094] [2024-09-20 11:59:47,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:59:47,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 11:59:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 11:59:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-20 11:59:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-20 11:59:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-20 11:59:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-20 11:59:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-20 11:59:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-20 11:59:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,406 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-20 11:59:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-20 11:59:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,413 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-20 11:59:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,416 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-09-20 11:59:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,420 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-20 11:59:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-20 11:59:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-20 11:59:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-09-20 11:59:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-09-20 11:59:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-09-20 11:59:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-09-20 11:59:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,448 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-09-20 11:59:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-09-20 11:59:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-09-20 11:59:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-09-20 11:59:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,461 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-09-20 11:59:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-09-20 11:59:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-09-20 11:59:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-09-20 11:59:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,474 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-20 11:59:48,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 11:59:48,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738340094] [2024-09-20 11:59:48,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738340094] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 11:59:48,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886514554] [2024-09-20 11:59:48,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 11:59:48,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 11:59:48,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 11:59:48,476 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 11:59:48,479 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-20 11:59:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 11:59:48,637 WARN L260 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 240 conjuncts are in the unsatisfiable core [2024-09-20 11:59:48,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 11:59:48,742 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-20 11:59:48,960 INFO L349 Elim1Store]: treesize reduction 39, result has 32.8 percent of original size [2024-09-20 11:59:48,960 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-20 11:59:49,332 INFO L349 Elim1Store]: treesize reduction 104, result has 27.3 percent of original size [2024-09-20 11:59:49,332 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-20 11:59:49,786 INFO L349 Elim1Store]: treesize reduction 198, result has 22.7 percent of original size [2024-09-20 11:59:49,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 115 [2024-09-20 11:59:53,179 INFO L349 Elim1Store]: treesize reduction 2324, result has 17.5 percent of original size [2024-09-20 11:59:53,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 10 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 195 case distinctions, treesize of input 245 treesize of output 633 [2024-09-20 12:02:08,988 WARN L293 SmtUtils]: Spent 33.75s on a formula simplification. DAG size of input: 516 DAG size of output: 532 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)