./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 e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 14:14:21,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 14:14:21,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 14:14:21,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 14:14:21,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 14:14:21,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 14:14:21,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 14:14:21,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 14:14:21,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 14:14:21,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 14:14:21,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 14:14:21,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 14:14:21,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 14:14:21,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 14:14:21,234 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 14:14:21,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 14:14:21,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 14:14:21,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 14:14:21,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 14:14:21,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 14:14:21,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 14:14:21,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 14:14:21,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 14:14:21,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 14:14:21,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 14:14:21,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 14:14:21,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 14:14:21,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 14:14:21,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 14:14:21,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 14:14:21,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 14:14:21,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 14:14:21,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:14:21,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 14:14:21,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 14:14:21,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 14:14:21,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 14:14:21,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 14:14:21,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 14:14:21,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 14:14:21,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 14:14:21,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 14:14:21,248 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-10-15 14:14:21,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 14:14:21,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 14:14:21,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 14:14:21,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 14:14:21,499 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 14:14:21,500 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-10-15 14:14:22,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 14:14:22,881 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 14:14:22,881 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-crafted/simple_array_index_value_2.i [2024-10-15 14:14:22,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/238dbde4c/06bd04c875744fdd8470e4de5a71c00a/FLAGfee4424c0 [2024-10-15 14:14:23,306 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/238dbde4c/06bd04c875744fdd8470e4de5a71c00a [2024-10-15 14:14:23,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 14:14:23,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 14:14:23,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 14:14:23,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 14:14:23,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 14:14:23,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbf11bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23, skipping insertion in model container [2024-10-15 14:14:23,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 14:14:23,497 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-10-15 14:14:23,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:14:23,527 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 14:14:23,546 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-10-15 14:14:23,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 14:14:23,573 INFO L204 MainTranslator]: Completed translation [2024-10-15 14:14:23,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23 WrapperNode [2024-10-15 14:14:23,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 14:14:23,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 14:14:23,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 14:14:23,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 14:14:23,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,591 INFO L138 Inliner]: procedures = 17, calls = 12, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 14:14:23,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 14:14:23,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 14:14:23,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 14:14:23,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 14:14:23,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,613 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-15 14:14:23,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,621 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 14:14:23,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 14:14:23,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 14:14:23,643 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 14:14:23,643 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (1/1) ... [2024-10-15 14:14:23,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 14:14:23,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:14:23,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-15 14:14:23,671 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-15 14:14:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 14:14:23,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-15 14:14:23,706 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-15 14:14:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 14:14:23,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 14:14:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 14:14:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 14:14:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 14:14:23,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 14:14:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 14:14:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 14:14:23,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 14:14:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 14:14:23,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 14:14:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 14:14:23,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 14:14:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-15 14:14:23,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-15 14:14:23,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 14:14:23,762 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 14:14:23,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 14:14:23,964 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-10-15 14:14:23,964 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 14:14:23,982 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 14:14:23,985 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-15 14:14:23,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:14:23 BoogieIcfgContainer [2024-10-15 14:14:23,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 14:14:23,987 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 14:14:23,987 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 14:14:23,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 14:14:23,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:14:23" (1/3) ... [2024-10-15 14:14:23,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9c5a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:14:23, skipping insertion in model container [2024-10-15 14:14:23,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:14:23" (2/3) ... [2024-10-15 14:14:23,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f9c5a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:14:23, skipping insertion in model container [2024-10-15 14:14:23,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:14:23" (3/3) ... [2024-10-15 14:14:23,993 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_2.i [2024-10-15 14:14:24,006 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 14:14:24,006 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 14:14:24,041 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 14:14:24,045 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d9aec4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 14:14:24,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 14:14:24,048 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-10-15 14:14:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-15 14:14:24,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:14:24,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:14:24,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:14:24,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:24,057 INFO L85 PathProgramCache]: Analyzing trace with hash 302093044, now seen corresponding path program 1 times [2024-10-15 14:14:24,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:14:24,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176633960] [2024-10-15 14:14:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:14:24,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:14:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:14:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:14:24,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:14:24,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176633960] [2024-10-15 14:14:24,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176633960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:14:24,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:14:24,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-15 14:14:24,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386614291] [2024-10-15 14:14:24,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:14:24,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-15 14:14:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:14:24,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-15 14:14:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-15 14:14:24,219 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-10-15 14:14:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:14:24,243 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-10-15 14:14:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-15 14:14:24,245 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-10-15 14:14:24,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:14:24,249 INFO L225 Difference]: With dead ends: 47 [2024-10-15 14:14:24,249 INFO L226 Difference]: Without dead ends: 22 [2024-10-15 14:14:24,253 INFO L431 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-10-15 14:14:24,255 INFO L432 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-10-15 14:14:24,256 INFO L433 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-10-15 14:14:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-15 14:14:24,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-15 14:14:24,281 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-10-15 14:14:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-10-15 14:14:24,284 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2024-10-15 14:14:24,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:14:24,285 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-10-15 14:14:24,285 INFO L472 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-10-15 14:14:24,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-10-15 14:14:24,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-15 14:14:24,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:14:24,287 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:14:24,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 14:14:24,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:14:24,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:24,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1791998188, now seen corresponding path program 1 times [2024-10-15 14:14:24,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:14:24,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616061879] [2024-10-15 14:14:24,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:14:24,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:14:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:24,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:14:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:14:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:14:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616061879] [2024-10-15 14:14:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616061879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 14:14:24,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 14:14:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-15 14:14:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995427235] [2024-10-15 14:14:24,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 14:14:24,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-15 14:14:24,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:14:24,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-15 14:14:24,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-15 14:14:24,403 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-10-15 14:14:24,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:14:24,426 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-15 14:14:24,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-15 14:14:24,426 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-10-15 14:14:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:14:24,428 INFO L225 Difference]: With dead ends: 38 [2024-10-15 14:14:24,428 INFO L226 Difference]: Without dead ends: 28 [2024-10-15 14:14:24,428 INFO L431 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-10-15 14:14:24,430 INFO L432 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-10-15 14:14:24,430 INFO L433 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-10-15 14:14:24,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-15 14:14:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2024-10-15 14:14:24,441 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-10-15 14:14:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-10-15 14:14:24,441 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 12 [2024-10-15 14:14:24,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:14:24,442 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-10-15 14:14:24,442 INFO L472 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-10-15 14:14:24,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:24,442 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-10-15 14:14:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-15 14:14:24,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:14:24,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:14:24,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-15 14:14:24,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:14:24,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1348305993, now seen corresponding path program 1 times [2024-10-15 14:14:24,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:14:24,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574075220] [2024-10-15 14:14:24,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:14:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:14:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:14:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:24,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:14:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:14:24,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:14:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574075220] [2024-10-15 14:14:24,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574075220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:14:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953788592] [2024-10-15 14:14:24,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:14:24,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:14:24,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:14:24,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:14:24,576 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 14:14:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:24,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-15 14:14:24,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:14:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:14:24,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:14:24,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 14:14:24,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953788592] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:14:24,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:14:24,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-15 14:14:24,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620743354] [2024-10-15 14:14:24,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:14:24,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-15 14:14:24,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:14:24,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-15 14:14:24,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-10-15 14:14:24,686 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-10-15 14:14:24,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:14:24,757 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2024-10-15 14:14:24,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-15 14:14:24,758 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-10-15 14:14:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:14:24,759 INFO L225 Difference]: With dead ends: 52 [2024-10-15 14:14:24,759 INFO L226 Difference]: Without dead ends: 42 [2024-10-15 14:14:24,759 INFO L431 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-10-15 14:14:24,760 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 8 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-10-15 14:14:24,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 82 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 14:14:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-15 14:14:24,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2024-10-15 14:14:24,767 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-10-15 14:14:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-15 14:14:24,768 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2024-10-15 14:14:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:14:24,768 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-15 14:14:24,768 INFO L472 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-10-15 14:14:24,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-10-15 14:14:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-15 14:14:24,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:14:24,770 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:14:24,783 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 14:14:24,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:14:24,975 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:14:24,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash 142257068, now seen corresponding path program 2 times [2024-10-15 14:14:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:14:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984815438] [2024-10-15 14:14:24,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:14:24,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:14:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:25,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:14:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:25,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:14:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:25,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-15 14:14:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:25,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 14:14:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:25,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 14:14:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:14:25,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:14:25,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984815438] [2024-10-15 14:14:25,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984815438] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:14:25,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760737326] [2024-10-15 14:14:25,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:14:25,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:14:25,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:14:25,210 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:14:25,219 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 14:14:25,288 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:14:25,288 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:14:25,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-15 14:14:25,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:14:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:14:25,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:14:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-15 14:14:25,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760737326] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:14:25,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:14:25,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-15 14:14:25,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008862737] [2024-10-15 14:14:25,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:14:25,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-15 14:14:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:14:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-15 14:14:25,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-10-15 14:14:25,454 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-10-15 14:14:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:14:25,782 INFO L93 Difference]: Finished difference Result 88 states and 113 transitions. [2024-10-15 14:14:25,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-15 14:14:25,783 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-10-15 14:14:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:14:25,786 INFO L225 Difference]: With dead ends: 88 [2024-10-15 14:14:25,786 INFO L226 Difference]: Without dead ends: 78 [2024-10-15 14:14:25,787 INFO L431 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-10-15 14:14:25,788 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 39 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-15 14:14:25,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 160 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-15 14:14:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-15 14:14:25,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2024-10-15 14:14:25,801 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-10-15 14:14:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2024-10-15 14:14:25,805 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 40 [2024-10-15 14:14:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:14:25,805 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2024-10-15 14:14:25,809 INFO L472 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-10-15 14:14:25,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2024-10-15 14:14:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-15 14:14:25,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:14:25,811 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:14:25,825 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 14:14:26,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:14:26,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:14:26,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:26,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1112716340, now seen corresponding path program 3 times [2024-10-15 14:14:26,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:14:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926811899] [2024-10-15 14:14:26,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:14:26,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:14:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:14:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:14:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-15 14:14:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 14:14:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 14:14:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:14:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 14:14:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-15 14:14:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-15 14:14:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:14:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-15 14:14:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-15 14:14:26,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:14:26,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926811899] [2024-10-15 14:14:26,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926811899] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:14:26,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224288778] [2024-10-15 14:14:26,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 14:14:26,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:14:26,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:14:26,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:14:26,402 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 14:14:36,048 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-15 14:14:36,048 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:14:36,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-15 14:14:36,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:14:36,153 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-15 14:14:36,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:14:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-15 14:14:36,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224288778] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 14:14:36,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 14:14:36,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-10-15 14:14:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21972873] [2024-10-15 14:14:36,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 14:14:36,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-15 14:14:36,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:14:36,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-15 14:14:36,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2024-10-15 14:14:36,451 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-10-15 14:14:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:14:39,286 INFO L93 Difference]: Finished difference Result 160 states and 215 transitions. [2024-10-15 14:14:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-15 14:14:39,286 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-10-15 14:14:39,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:14:39,288 INFO L225 Difference]: With dead ends: 160 [2024-10-15 14:14:39,288 INFO L226 Difference]: Without dead ends: 150 [2024-10-15 14:14:39,289 INFO L431 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-10-15 14:14:39,289 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 96 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-15 14:14:39,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 586 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-15 14:14:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-15 14:14:39,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 86. [2024-10-15 14:14:39,302 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-10-15 14:14:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2024-10-15 14:14:39,303 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 82 [2024-10-15 14:14:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:14:39,304 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2024-10-15 14:14:39,304 INFO L472 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-10-15 14:14:39,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2024-10-15 14:14:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-15 14:14:39,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:14:39,306 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:14:39,321 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 14:14:39,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:14:39,511 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:14:39,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1141500916, now seen corresponding path program 4 times [2024-10-15 14:14:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:14:39,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185299524] [2024-10-15 14:14:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:14:39,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:14:39,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:14:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:14:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-15 14:14:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 14:14:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 14:14:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:14:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 14:14:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-15 14:14:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-15 14:14:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:14:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-15 14:14:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:14:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-15 14:14:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-15 14:14:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-15 14:14:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-15 14:14:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-15 14:14:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-15 14:14:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-15 14:14:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-15 14:14:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-15 14:14:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-15 14:14:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-15 14:14:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-15 14:14:40,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:14:40,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185299524] [2024-10-15 14:14:40,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185299524] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:14:40,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823576355] [2024-10-15 14:14:40,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-15 14:14:40,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:14:40,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:14:40,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:14:40,265 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-15 14:14:40,368 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-15 14:14:40,369 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:14:40,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 191 conjuncts are in the unsatisfiable core [2024-10-15 14:14:40,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:14:40,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-15 14:14:40,814 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:40,814 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-10-15 14:14:41,130 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:41,130 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-10-15 14:14:41,340 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:41,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-10-15 14:14:41,565 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:41,565 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-10-15 14:14:41,762 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:41,762 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-10-15 14:14:41,898 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:41,898 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-10-15 14:14:42,192 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:42,192 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-10-15 14:14:42,362 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:42,362 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-10-15 14:14:42,777 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:42,778 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-10-15 14:14:43,110 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:43,111 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-10-15 14:14:43,245 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:43,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2024-10-15 14:14:43,589 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:43,589 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-10-15 14:14:43,848 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:43,849 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-10-15 14:14:44,043 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:44,047 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-10-15 14:14:44,163 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:44,163 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-10-15 14:14:44,517 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:44,517 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-10-15 14:14:44,794 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:44,795 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-10-15 14:14:44,970 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:44,971 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-10-15 14:14:45,312 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:45,313 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-10-15 14:14:45,466 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:45,467 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-10-15 14:14:45,574 INFO L349 Elim1Store]: treesize reduction 48, result has 47.3 percent of original size [2024-10-15 14:14:45,575 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-10-15 14:14:45,650 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-10-15 14:14:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1639 backedges. 84 proven. 64 refuted. 0 times theorem prover too weak. 1491 trivial. 0 not checked. [2024-10-15 14:14:45,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:14:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823576355] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:14:49,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:14:49,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16] total 38 [2024-10-15 14:14:49,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918509294] [2024-10-15 14:14:49,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:14:49,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-15 14:14:49,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:14:49,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-15 14:14:49,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1751, Unknown=1, NotChecked=0, Total=1892 [2024-10-15 14:14:49,995 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-10-15 14:14:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:14:53,023 INFO L93 Difference]: Finished difference Result 180 states and 228 transitions. [2024-10-15 14:14:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-15 14:14:53,028 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-10-15 14:14:53,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:14:53,030 INFO L225 Difference]: With dead ends: 180 [2024-10-15 14:14:53,030 INFO L226 Difference]: Without dead ends: 170 [2024-10-15 14:14:53,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 171 SyntacticMatches, 32 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1731 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=667, Invalid=7522, Unknown=1, NotChecked=0, Total=8190 [2024-10-15 14:14:53,032 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 118 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 4536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-15 14:14:53,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 798 Invalid, 4536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-15 14:14:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-15 14:14:53,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 102. [2024-10-15 14:14:53,069 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-10-15 14:14:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2024-10-15 14:14:53,072 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 166 [2024-10-15 14:14:53,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:14:53,073 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2024-10-15 14:14:53,073 INFO L472 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-10-15 14:14:53,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2024-10-15 14:14:53,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-15 14:14:53,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:14:53,075 INFO L215 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-10-15 14:14:53,094 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-15 14:14:53,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:14:53,285 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:14:53,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:14:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1553173923, now seen corresponding path program 1 times [2024-10-15 14:14:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:14:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325297874] [2024-10-15 14:14:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:14:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:14:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:14:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:14:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-15 14:14:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 14:14:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 14:14:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:14:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 14:14:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-15 14:14:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-15 14:14:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:14:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-15 14:14:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:14:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-15 14:14:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-15 14:14:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-15 14:14:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-15 14:14:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-15 14:14:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-15 14:14:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-15 14:14:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-15 14:14:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-15 14:14:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-15 14:14:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-15 14:14:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-15 14:14:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-15 14:14:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-15 14:14:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1960 backedges. 2 proven. 852 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2024-10-15 14:14:54,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:14:54,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325297874] [2024-10-15 14:14:54,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325297874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:14:54,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144498444] [2024-10-15 14:14:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:14:54,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:14:54,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:14:54,133 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:14:54,136 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-15 14:14:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:14:54,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 198 conjuncts are in the unsatisfiable core [2024-10-15 14:14:54,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:14:54,351 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-10-15 14:14:54,620 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:54,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:55,054 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:55,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:55,521 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:55,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:55,898 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:55,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:56,056 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:56,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:56,177 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:56,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:56,433 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:56,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:56,580 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:56,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:57,097 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:57,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 46 treesize of output 59 [2024-10-15 14:14:57,313 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:57,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:57,632 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:57,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:57,885 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:57,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:58,241 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:58,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:58,613 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:58,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:58,778 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:58,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:59,129 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:59,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:59,533 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:59,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:14:59,646 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:14:59,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:15:00,025 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:15:00,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:15:00,256 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:15:00,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:15:00,543 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:15:00,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:15:00,798 INFO L349 Elim1Store]: treesize reduction 54, result has 47.6 percent of original size [2024-10-15 14:15:00,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-10-15 14:15:01,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-15 14:15:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1960 backedges. 179 proven. 141 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2024-10-15 14:15:01,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 14:15:09,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144498444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:15:09,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-15 14:15:09,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 41 [2024-10-15 14:15:09,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616704004] [2024-10-15 14:15:09,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-15 14:15:09,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-15 14:15:09,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 14:15:09,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-15 14:15:09,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1916, Unknown=2, NotChecked=0, Total=2070 [2024-10-15 14:15:09,831 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 41 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 29 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-15 14:15:13,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-15 14:15:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 14:15:17,787 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2024-10-15 14:15:17,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-10-15 14:15:17,787 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 29 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 28 states have call successors, (29) Word has length 187 [2024-10-15 14:15:17,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 14:15:17,789 INFO L225 Difference]: With dead ends: 206 [2024-10-15 14:15:17,789 INFO L226 Difference]: Without dead ends: 190 [2024-10-15 14:15:17,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 198 SyntacticMatches, 40 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1958 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=700, Invalid=8228, Unknown=2, NotChecked=0, Total=8930 [2024-10-15 14:15:17,791 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 141 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 4702 mSolverCounterSat, 171 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 4874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 4702 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-15 14:15:17,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1185 Invalid, 4874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 4702 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2024-10-15 14:15:17,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-15 14:15:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 119. [2024-10-15 14:15:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 80 states have (on average 1.025) internal successors, (82), 81 states have internal predecessors, (82), 31 states have call successors, (31), 8 states have call predecessors, (31), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-15 14:15:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 143 transitions. [2024-10-15 14:15:17,814 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 143 transitions. Word has length 187 [2024-10-15 14:15:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 14:15:17,815 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 143 transitions. [2024-10-15 14:15:17,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 2.1025641025641026) internal successors, (82), 38 states have internal predecessors, (82), 29 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (29), 29 states have call predecessors, (29), 28 states have call successors, (29) [2024-10-15 14:15:17,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:15:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 143 transitions. [2024-10-15 14:15:17,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-15 14:15:17,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 14:15:17,821 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 14:15:17,849 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-15 14:15:18,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-15 14:15:18,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 14:15:18,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 14:15:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash 772297452, now seen corresponding path program 2 times [2024-10-15 14:15:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 14:15:18,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077995900] [2024-10-15 14:15:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 14:15:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 14:15:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 14:15:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-15 14:15:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-15 14:15:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-15 14:15:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-15 14:15:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-15 14:15:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-15 14:15:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-15 14:15:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-15 14:15:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-15 14:15:18,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-15 14:15:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-15 14:15:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-15 14:15:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-15 14:15:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-15 14:15:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-15 14:15:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-15 14:15:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-15 14:15:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-15 14:15:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-15 14:15:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-15 14:15:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-15 14:15:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-15 14:15:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-15 14:15:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-15 14:15:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-15 14:15:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-15 14:15:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-15 14:15:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-15 14:15:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 14:15:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2316 backedges. 4 proven. 1001 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2024-10-15 14:15:18,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 14:15:18,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077995900] [2024-10-15 14:15:18,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077995900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 14:15:18,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716992964] [2024-10-15 14:15:18,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 14:15:18,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 14:15:18,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 14:15:18,960 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-15 14:15:18,971 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-15 14:15:19,434 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 14:15:19,434 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 14:15:19,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 232 conjuncts are in the unsatisfiable core [2024-10-15 14:15:19,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 14:15:19,539 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-10-15 14:15:19,801 INFO L349 Elim1Store]: treesize reduction 39, result has 32.8 percent of original size [2024-10-15 14:15:19,801 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-10-15 14:15:20,170 INFO L349 Elim1Store]: treesize reduction 104, result has 27.3 percent of original size [2024-10-15 14:15:20,170 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-10-15 14:15:22,489 INFO L349 Elim1Store]: treesize reduction 1316, result has 21.5 percent of original size [2024-10-15 14:15:22,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 6 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 110 case distinctions, treesize of input 190 treesize of output 467 [2024-10-15 14:16:41,778 WARN L286 SmtUtils]: Spent 25.96s on a formula simplification. DAG size of input: 1089 DAG size of output: 1056 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)