./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/insertion_sort-2-2.c --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 6908dde5 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/loops/insertion_sort-2-2.c -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 f08b02f494e898be2e8c5098de245f701022f3f8b39ac6682b3bca3a03512826 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 22:58:13,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 22:58:13,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 22:58:13,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 22:58:13,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 22:58:13,524 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 22:58:13,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 22:58:13,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 22:58:13,525 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 22:58:13,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 22:58:13,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 22:58:13,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 22:58:13,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 22:58:13,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 22:58:13,526 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 22:58:13,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 22:58:13,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 22:58:13,527 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 22:58:13,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 22:58:13,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 22:58:13,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 22:58:13,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 22:58:13,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 22:58:13,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 22:58:13,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 22:58:13,532 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 22:58:13,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 22:58:13,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 22:58:13,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 22:58:13,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 22:58:13,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 22:58:13,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 22:58:13,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 22:58:13,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 22:58:13,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 22:58:13,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 22:58:13,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 22:58:13,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 22:58:13,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 22:58:13,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 22:58:13,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 22:58:13,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 22:58:13,539 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 -> f08b02f494e898be2e8c5098de245f701022f3f8b39ac6682b3bca3a03512826 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 22:58:13,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 22:58:13,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 22:58:13,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 22:58:13,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 22:58:13,833 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 22:58:13,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/insertion_sort-2-2.c [2024-09-24 22:58:15,093 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 22:58:15,290 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 22:58:15,291 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/insertion_sort-2-2.c [2024-09-24 22:58:15,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6067c1287/f488b2475a1f4da6982f858999768dde/FLAG09bd43d56 [2024-09-24 22:58:15,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6067c1287/f488b2475a1f4da6982f858999768dde [2024-09-24 22:58:15,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 22:58:15,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 22:58:15,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 22:58:15,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 22:58:15,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 22:58:15,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 10:58:15" (1/1) ... [2024-09-24 22:58:15,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75015fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:15, skipping insertion in model container [2024-09-24 22:58:15,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 10:58:15" (1/1) ... [2024-09-24 22:58:15,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 22:58:15,916 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/loops/insertion_sort-2-2.c[330,343] [2024-09-24 22:58:15,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 22:58:15,964 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 22:58:15,983 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/loops/insertion_sort-2-2.c[330,343] [2024-09-24 22:58:15,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 22:58:16,031 INFO L204 MainTranslator]: Completed translation [2024-09-24 22:58:16,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16 WrapperNode [2024-09-24 22:58:16,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 22:58:16,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 22:58:16,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 22:58:16,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 22:58:16,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,073 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 22:58:16,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 22:58:16,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 22:58:16,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 22:58:16,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 22:58:16,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,123 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-09-24 22:58:16,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 22:58:16,147 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 22:58:16,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 22:58:16,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 22:58:16,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (1/1) ... [2024-09-24 22:58:16,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 22:58:16,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:58:16,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-24 22:58:16,196 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-24 22:58:16,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 22:58:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 22:58:16,268 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 22:58:16,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 22:58:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-24 22:58:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-24 22:58:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-24 22:58:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-24 22:58:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 22:58:16,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 22:58:16,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 22:58:16,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 22:58:16,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-24 22:58:16,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-24 22:58:16,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 22:58:16,274 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 22:58:16,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-24 22:58:16,393 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 22:58:16,399 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 22:58:16,786 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-09-24 22:58:16,786 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 22:58:16,830 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 22:58:16,833 INFO L317 CfgBuilder]: Removed 4 assume(true) statements. [2024-09-24 22:58:16,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:58:16 BoogieIcfgContainer [2024-09-24 22:58:16,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 22:58:16,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 22:58:16,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 22:58:16,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 22:58:16,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 10:58:15" (1/3) ... [2024-09-24 22:58:16,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663bea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 10:58:16, skipping insertion in model container [2024-09-24 22:58:16,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 10:58:16" (2/3) ... [2024-09-24 22:58:16,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663bea03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 10:58:16, skipping insertion in model container [2024-09-24 22:58:16,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 10:58:16" (3/3) ... [2024-09-24 22:58:16,850 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort-2-2.c [2024-09-24 22:58:16,868 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 22:58:16,868 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 22:58:16,931 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 22:58:16,942 INFO L336 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6e9ad09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 22:58:16,942 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 22:58:16,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-24 22:58:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-24 22:58:16,956 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:16,957 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:16,959 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:16,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:16,968 INFO L85 PathProgramCache]: Analyzing trace with hash 921479043, now seen corresponding path program 1 times [2024-09-24 22:58:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:16,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395562879] [2024-09-24 22:58:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:16,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:17,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:17,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395562879] [2024-09-24 22:58:17,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395562879] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 22:58:17,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 22:58:17,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-24 22:58:17,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727753285] [2024-09-24 22:58:17,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 22:58:17,258 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-24 22:58:17,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:17,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-24 22:58:17,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 22:58:17,317 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:17,367 INFO L93 Difference]: Finished difference Result 49 states and 67 transitions. [2024-09-24 22:58:17,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-24 22:58:17,372 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2024-09-24 22:58:17,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:17,384 INFO L225 Difference]: With dead ends: 49 [2024-09-24 22:58:17,385 INFO L226 Difference]: Without dead ends: 23 [2024-09-24 22:58:17,388 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-24 22:58:17,399 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:17,400 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 30 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 22:58:17,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-24 22:58:17,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-24 22:58:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 22:58:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-24 22:58:17,449 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2024-09-24 22:58:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:17,450 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-24 22:58:17,450 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:17,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-24 22:58:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-24 22:58:17,453 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:17,453 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:17,453 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 22:58:17,454 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:17,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1576012003, now seen corresponding path program 1 times [2024-09-24 22:58:17,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:17,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208035687] [2024-09-24 22:58:17,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:17,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:17,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:17,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:17,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208035687] [2024-09-24 22:58:17,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208035687] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 22:58:17,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 22:58:17,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 22:58:17,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506316875] [2024-09-24 22:58:17,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 22:58:17,979 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 22:58:17,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:17,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 22:58:17,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 22:58:17,982 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:18,078 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2024-09-24 22:58:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 22:58:18,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2024-09-24 22:58:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:18,080 INFO L225 Difference]: With dead ends: 43 [2024-09-24 22:58:18,080 INFO L226 Difference]: Without dead ends: 24 [2024-09-24 22:58:18,080 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 22:58:18,081 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:18,081 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 22:58:18,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-24 22:58:18,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-24 22:58:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 22:58:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-24 22:58:18,097 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2024-09-24 22:58:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:18,097 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-24 22:58:18,097 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:18,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-24 22:58:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-24 22:58:18,098 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:18,098 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:18,098 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 22:58:18,098 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:18,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1045249472, now seen corresponding path program 1 times [2024-09-24 22:58:18,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:18,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683854459] [2024-09-24 22:58:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:18,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:18,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:18,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683854459] [2024-09-24 22:58:18,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683854459] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:58:18,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835762451] [2024-09-24 22:58:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:18,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:18,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:58:18,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 22:58:18,578 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-24 22:58:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:18,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-24 22:58:18,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:58:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 22:58:18,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 22:58:18,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835762451] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 22:58:18,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 22:58:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2024-09-24 22:58:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242149645] [2024-09-24 22:58:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 22:58:18,698 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 22:58:18,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 22:58:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-24 22:58:18,700 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:18,746 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-09-24 22:58:18,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-24 22:58:18,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 16 [2024-09-24 22:58:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:18,748 INFO L225 Difference]: With dead ends: 40 [2024-09-24 22:58:18,748 INFO L226 Difference]: Without dead ends: 29 [2024-09-24 22:58:18,749 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-24 22:58:18,750 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:18,750 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 22:58:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-24 22:58:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-09-24 22:58:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 22:58:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-24 22:58:18,765 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2024-09-24 22:58:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:18,765 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-24 22:58:18,766 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:18,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:18,766 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-24 22:58:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-24 22:58:18,766 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:18,767 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:18,782 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-24 22:58:18,967 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:18,968 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:18,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash 530421245, now seen corresponding path program 1 times [2024-09-24 22:58:18,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:18,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547791956] [2024-09-24 22:58:18,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:19,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547791956] [2024-09-24 22:58:19,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547791956] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:58:19,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380624923] [2024-09-24 22:58:19,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:19,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:19,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:58:19,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 22:58:19,232 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-24 22:58:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:19,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 22:58:19,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:58:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:19,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 22:58:19,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380624923] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 22:58:19,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 22:58:19,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-09-24 22:58:19,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452430645] [2024-09-24 22:58:19,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 22:58:19,454 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 22:58:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:19,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 22:58:19,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-24 22:58:19,455 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:19,495 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-09-24 22:58:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 22:58:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 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 21 [2024-09-24 22:58:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:19,497 INFO L225 Difference]: With dead ends: 47 [2024-09-24 22:58:19,497 INFO L226 Difference]: Without dead ends: 30 [2024-09-24 22:58:19,497 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-24 22:58:19,498 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:19,498 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 22:58:19,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-24 22:58:19,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-09-24 22:58:19,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-24 22:58:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-24 22:58:19,502 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 21 [2024-09-24 22:58:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:19,502 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-24 22:58:19,502 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:19,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-24 22:58:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-24 22:58:19,503 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:19,503 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:19,517 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 22:58:19,703 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:19,704 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:19,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1034611302, now seen corresponding path program 2 times [2024-09-24 22:58:19,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:19,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095402024] [2024-09-24 22:58:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:20,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:20,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:20,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:20,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095402024] [2024-09-24 22:58:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095402024] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:58:20,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281180971] [2024-09-24 22:58:20,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 22:58:20,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:20,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:58:20,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 22:58:20,324 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-24 22:58:20,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 22:58:20,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 22:58:20,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-24 22:58:20,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:58:20,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-24 22:58:20,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 22:58:20,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-09-24 22:58:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 22:58:20,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 22:58:20,684 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 43 treesize of output 37 [2024-09-24 22:58:20,704 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-24 22:58:20,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 66 [2024-09-24 22:58:20,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 22:58:20,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281180971] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 22:58:20,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 22:58:20,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 23 [2024-09-24 22:58:20,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947783588] [2024-09-24 22:58:20,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 22:58:20,776 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-24 22:58:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-24 22:58:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2024-09-24 22:58:20,777 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:21,291 INFO L93 Difference]: Finished difference Result 76 states and 98 transitions. [2024-09-24 22:58:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-24 22:58:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-24 22:58:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:21,294 INFO L225 Difference]: With dead ends: 76 [2024-09-24 22:58:21,294 INFO L226 Difference]: Without dead ends: 61 [2024-09-24 22:58:21,295 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=288, Invalid=1352, Unknown=0, NotChecked=0, Total=1640 [2024-09-24 22:58:21,295 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 75 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:21,296 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 169 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-24 22:58:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-24 22:58:21,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2024-09-24 22:58:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-24 22:58:21,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2024-09-24 22:58:21,305 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 22 [2024-09-24 22:58:21,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:21,305 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2024-09-24 22:58:21,305 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 21 states have internal predecessors, (36), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:21,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:21,306 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-09-24 22:58:21,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-24 22:58:21,306 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:21,306 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:21,319 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-24 22:58:21,507 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:21,508 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:21,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:21,508 INFO L85 PathProgramCache]: Analyzing trace with hash -78593507, now seen corresponding path program 1 times [2024-09-24 22:58:21,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:21,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686927226] [2024-09-24 22:58:21,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:21,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:21,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:21,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:21,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:21,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686927226] [2024-09-24 22:58:21,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686927226] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:58:21,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771447712] [2024-09-24 22:58:21,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:21,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:21,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:58:21,906 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 22:58:21,907 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-24 22:58:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:21,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-24 22:58:21,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:58:22,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 22 [2024-09-24 22:58:22,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 22:58:22,125 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 1 case distinctions, treesize of input 42 treesize of output 22 [2024-09-24 22:58:22,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 22:58:22,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-09-24 22:58:22,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 22:58:22,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 22:58:22,459 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 64 treesize of output 56 [2024-09-24 22:58:22,473 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-09-24 22:58:22,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 334 treesize of output 282 [2024-09-24 22:58:22,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-24 22:58:22,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771447712] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 22:58:22,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 22:58:22,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 12] total 32 [2024-09-24 22:58:22,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103765165] [2024-09-24 22:58:22,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 22:58:22,530 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-24 22:58:22,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:22,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-24 22:58:22,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2024-09-24 22:58:22,531 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:23,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:23,516 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2024-09-24 22:58:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-24 22:58:23,516 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-09-24 22:58:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:23,519 INFO L225 Difference]: With dead ends: 107 [2024-09-24 22:58:23,519 INFO L226 Difference]: Without dead ends: 76 [2024-09-24 22:58:23,520 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=375, Invalid=2487, Unknown=0, NotChecked=0, Total=2862 [2024-09-24 22:58:23,523 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 74 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:23,523 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 253 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-24 22:58:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-24 22:58:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 38. [2024-09-24 22:58:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-24 22:58:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-09-24 22:58:23,537 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2024-09-24 22:58:23,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:23,537 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-09-24 22:58:23,537 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 30 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-24 22:58:23,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-09-24 22:58:23,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-24 22:58:23,538 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:23,538 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:23,557 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-24 22:58:23,738 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:23,739 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:23,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:23,739 INFO L85 PathProgramCache]: Analyzing trace with hash -80162640, now seen corresponding path program 1 times [2024-09-24 22:58:23,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:23,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22833439] [2024-09-24 22:58:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:23,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:23,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:23,854 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-24 22:58:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 22:58:23,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:23,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22833439] [2024-09-24 22:58:23,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22833439] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:58:23,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548358744] [2024-09-24 22:58:23,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:23,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:23,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:58:23,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 22:58:23,864 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-24 22:58:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:23,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-24 22:58:23,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:58:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 22:58:23,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 22:58:24,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 22:58:24,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548358744] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 22:58:24,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 22:58:24,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-09-24 22:58:24,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165345029] [2024-09-24 22:58:24,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 22:58:24,093 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-24 22:58:24,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:24,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-24 22:58:24,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-24 22:58:24,094 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-24 22:58:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:58:24,221 INFO L93 Difference]: Finished difference Result 81 states and 96 transitions. [2024-09-24 22:58:24,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-24 22:58:24,222 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 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 29 [2024-09-24 22:58:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:58:24,223 INFO L225 Difference]: With dead ends: 81 [2024-09-24 22:58:24,223 INFO L226 Difference]: Without dead ends: 45 [2024-09-24 22:58:24,224 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-09-24 22:58:24,224 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 44 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 22:58:24,225 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 207 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 22:58:24,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-24 22:58:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2024-09-24 22:58:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-24 22:58:24,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2024-09-24 22:58:24,239 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 29 [2024-09-24 22:58:24,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:58:24,239 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2024-09-24 22:58:24,239 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-24 22:58:24,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:24,240 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2024-09-24 22:58:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-24 22:58:24,240 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:58:24,240 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:58:24,257 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-24 22:58:24,440 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-24 22:58:24,441 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:58:24,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:58:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash 485904074, now seen corresponding path program 2 times [2024-09-24 22:58:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:58:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441695069] [2024-09-24 22:58:24,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:58:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:58:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:25,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:58:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:25,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-24 22:58:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:58:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:58:25,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:58:25,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441695069] [2024-09-24 22:58:25,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441695069] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:58:25,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91158847] [2024-09-24 22:58:25,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 22:58:25,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:58:25,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:58:25,182 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 22:58:25,183 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-24 22:58:25,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 22:58:25,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 22:58:25,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-24 22:58:25,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:58:25,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-24 22:58:25,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 22:58:25,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-09-24 22:58:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 22:58:25,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 22:58:34,048 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 45 treesize of output 39 [2024-09-24 22:58:34,061 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-24 22:58:34,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 58 [2024-09-24 22:58:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 22:58:34,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91158847] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 22:58:34,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 22:58:34,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 13] total 31 [2024-09-24 22:58:34,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250912746] [2024-09-24 22:58:34,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 22:58:34,080 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-24 22:58:34,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:58:34,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-24 22:58:34,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=823, Unknown=2, NotChecked=0, Total=930 [2024-09-24 22:58:34,082 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-24 22:58:38,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:58:42,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:58:46,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:58:50,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:58:54,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:58:58,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:59:02,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:59:06,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:59:10,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:59:14,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:59:18,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:59:22,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:59:26,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:59:30,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:59:34,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 22:59:34,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:59:34,835 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2024-09-24 22:59:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-24 22:59:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 35 [2024-09-24 22:59:34,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:59:34,836 INFO L225 Difference]: With dead ends: 89 [2024-09-24 22:59:34,836 INFO L226 Difference]: Without dead ends: 87 [2024-09-24 22:59:34,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=222, Invalid=1668, Unknown=2, NotChecked=0, Total=1892 [2024-09-24 22:59:34,838 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 83 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 21 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.5s IncrementalHoareTripleChecker+Time [2024-09-24 22:59:34,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 438 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 738 Invalid, 15 Unknown, 0 Unchecked, 60.5s Time] [2024-09-24 22:59:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-24 22:59:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2024-09-24 22:59:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 50 states have internal predecessors, (61), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-24 22:59:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2024-09-24 22:59:34,853 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 35 [2024-09-24 22:59:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:59:34,854 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2024-09-24 22:59:34,854 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 29 states have internal predecessors, (68), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-24 22:59:34,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:59:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2024-09-24 22:59:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-24 22:59:34,855 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:59:34,855 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:59:34,868 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-24 22:59:35,055 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:59:35,060 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:59:35,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:59:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash -178294159, now seen corresponding path program 1 times [2024-09-24 22:59:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:59:35,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201327255] [2024-09-24 22:59:35,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:59:35,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:59:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:35,586 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:59:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:35,588 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-24 22:59:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:59:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:59:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201327255] [2024-09-24 22:59:35,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201327255] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:59:35,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064530998] [2024-09-24 22:59:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:59:35,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:59:35,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:59:35,594 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 22:59:35,598 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-24 22:59:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:35,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-09-24 22:59:35,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:59:35,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-09-24 22:59:35,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 22:59:35,898 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 1 case distinctions, treesize of input 40 treesize of output 20 [2024-09-24 22:59:36,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 22:59:36,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-09-24 22:59:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 22:59:36,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 22:59:36,450 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 74 treesize of output 66 [2024-09-24 22:59:36,464 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-09-24 22:59:36,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 494 treesize of output 426 [2024-09-24 22:59:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 22:59:36,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064530998] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 22:59:36,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 22:59:36,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 15] total 44 [2024-09-24 22:59:36,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295943156] [2024-09-24 22:59:36,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 22:59:36,608 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-24 22:59:36,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:59:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-24 22:59:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1705, Unknown=0, NotChecked=0, Total=1892 [2024-09-24 22:59:36,610 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 44 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-24 22:59:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:59:38,146 INFO L93 Difference]: Finished difference Result 166 states and 206 transitions. [2024-09-24 22:59:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-09-24 22:59:38,147 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2024-09-24 22:59:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:59:38,148 INFO L225 Difference]: With dead ends: 166 [2024-09-24 22:59:38,148 INFO L226 Difference]: Without dead ends: 130 [2024-09-24 22:59:38,150 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=657, Invalid=5663, Unknown=0, NotChecked=0, Total=6320 [2024-09-24 22:59:38,150 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 115 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-24 22:59:38,150 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 567 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-24 22:59:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-09-24 22:59:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2024-09-24 22:59:38,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 81 states have internal predecessors, (100), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (7), 4 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 22:59:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 115 transitions. [2024-09-24 22:59:38,171 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 115 transitions. Word has length 38 [2024-09-24 22:59:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:59:38,171 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 115 transitions. [2024-09-24 22:59:38,171 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 6 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-24 22:59:38,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:59:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2024-09-24 22:59:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-24 22:59:38,176 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:59:38,176 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:59:38,201 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-24 22:59:38,376 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:59:38,377 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:59:38,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:59:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash 917365120, now seen corresponding path program 3 times [2024-09-24 22:59:38,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:59:38,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113191667] [2024-09-24 22:59:38,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:59:38,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:59:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:38,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:59:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:38,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-24 22:59:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:38,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-24 22:59:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-24 22:59:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:59:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113191667] [2024-09-24 22:59:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113191667] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:59:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482097990] [2024-09-24 22:59:38,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-24 22:59:38,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:59:38,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:59:38,580 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 22:59:38,581 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-24 22:59:38,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-24 22:59:38,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 22:59:38,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-24 22:59:38,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:59:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-24 22:59:38,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 22:59:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-24 22:59:38,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482097990] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 22:59:38,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 22:59:38,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2024-09-24 22:59:38,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840107711] [2024-09-24 22:59:38,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 22:59:38,977 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-24 22:59:38,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:59:38,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-24 22:59:38,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2024-09-24 22:59:38,978 INFO L87 Difference]: Start difference. First operand 93 states and 115 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-24 22:59:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 22:59:39,181 INFO L93 Difference]: Finished difference Result 212 states and 275 transitions. [2024-09-24 22:59:39,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-24 22:59:39,181 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 42 [2024-09-24 22:59:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 22:59:39,183 INFO L225 Difference]: With dead ends: 212 [2024-09-24 22:59:39,183 INFO L226 Difference]: Without dead ends: 135 [2024-09-24 22:59:39,184 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2024-09-24 22:59:39,185 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-24 22:59:39,186 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 340 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-24 22:59:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-24 22:59:39,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 118. [2024-09-24 22:59:39,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 103 states have (on average 1.2524271844660195) internal successors, (129), 106 states have internal predecessors, (129), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-24 22:59:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2024-09-24 22:59:39,219 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 42 [2024-09-24 22:59:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 22:59:39,219 INFO L474 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2024-09-24 22:59:39,219 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 6 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-24 22:59:39,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:59:39,219 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2024-09-24 22:59:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-24 22:59:39,222 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 22:59:39,222 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 22:59:39,236 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-24 22:59:39,422 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:59:39,423 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 22:59:39,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 22:59:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1981868692, now seen corresponding path program 1 times [2024-09-24 22:59:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 22:59:39,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578930110] [2024-09-24 22:59:39,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:59:39,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 22:59:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:40,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 22:59:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:40,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-24 22:59:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 22:59:40,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 22:59:40,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578930110] [2024-09-24 22:59:40,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578930110] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 22:59:40,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469080072] [2024-09-24 22:59:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 22:59:40,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 22:59:40,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 22:59:40,458 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-24 22:59:40,459 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-24 22:59:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 22:59:40,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-24 22:59:40,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 22:59:40,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-24 22:59:40,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 22:59:40,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-09-24 22:59:40,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 22:59:40,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 28 [2024-09-24 22:59:40,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 22:59:40,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-24 22:59:40,873 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2024-09-24 22:59:40,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 34 [2024-09-24 22:59:49,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 22:59:49,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-09-24 22:59:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-24 22:59:49,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 22:59:53,784 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 114 treesize of output 104 [2024-09-24 22:59:53,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-24 22:59:53,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 3498 treesize of output 3289 [2024-09-24 22:59:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 22:59:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469080072] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 22:59:59,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 22:59:59,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 20] total 52 [2024-09-24 22:59:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107264800] [2024-09-24 22:59:59,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 22:59:59,261 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-09-24 22:59:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 22:59:59,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-09-24 22:59:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=2359, Unknown=3, NotChecked=0, Total=2652 [2024-09-24 22:59:59,262 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 52 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 49 states have internal predecessors, (83), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-24 23:00:03,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:00:07,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:00:11,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:00:15,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:00:19,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:00:23,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:00:28,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:00:36,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:00:40,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:00:44,677 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, 1] [2024-09-24 23:00:48,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:00:52,709 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 [1] [2024-09-24 23:00:56,975 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| |c_main_~#v~0.base|))) (let ((.cse6 (* c_main_~i~0 4)) (.cse2 (= c_main_~i~0 0)) (.cse0 (= 2 c_main_~j~0)) (.cse1 (not |c_main_#t~short9|)) (.cse4 (select .cse3 8))) (and .cse0 (or .cse1 (and .cse2 (<= (select .cse3 0) .cse4))) (forall ((main_~key~0 Int)) (let ((.cse5 (store .cse3 (+ .cse6 |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse5 (+ |c_main_~#v~0.offset| 4)) (+ 1 (select .cse5 (+ |c_main_~#v~0.offset| 8)))))) (let ((.cse7 (store .cse3 (+ .cse6 4) c_main_~key~0))) (<= (select .cse7 4) (select .cse7 8))) (or (let ((.cse8 (= c_main_~j~0 1))) (and (or .cse2 (not .cse8)) (or .cse8 (= c_main_~i~0 1)) (not .cse0))) .cse1 (< c_main_~j~0 1)) (<= (select .cse3 4) .cse4) (= |c_main_~#v~0.offset| 0)))) is different from false [2024-09-24 23:01:01,161 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int#1| |c_main_~#v~0.base|)) (.cse2 (* c_main_~i~0 4))) (and (forall ((main_~key~0 Int)) (let ((.cse0 (store .cse1 (+ .cse2 |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 (+ |c_main_~#v~0.offset| 4)) (+ 1 (select .cse0 (+ |c_main_~#v~0.offset| 8)))))) (let ((.cse3 (store .cse1 (+ .cse2 4) c_main_~key~0))) (<= (select .cse3 4) (select .cse3 8))) (= |c_main_~#v~0.offset| 0))) is different from false [2024-09-24 23:01:05,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:09,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:13,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:17,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:21,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:25,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:29,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:33,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:37,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:41,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:45,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:01:49,456 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int#1| |c_main_~#v~0.base|))) (let ((.cse5 (* c_main_~i~0 4)) (.cse1 (= c_main_~i~0 0)) (.cse0 (not |c_main_#t~short9|)) (.cse3 (select .cse2 8))) (and (or .cse0 (and .cse1 (<= (select .cse2 0) .cse3))) (forall ((main_~key~0 Int)) (let ((.cse4 (store .cse2 (+ .cse5 |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse4 (+ |c_main_~#v~0.offset| 4)) (+ 1 (select .cse4 (+ |c_main_~#v~0.offset| 8)))))) (let ((.cse6 (store .cse2 (+ .cse5 4) c_main_~key~0))) (<= (select .cse6 4) (select .cse6 8))) (or (let ((.cse7 (= c_main_~j~0 1))) (and (or .cse1 (not .cse7)) (or .cse7 (= c_main_~i~0 1)) (not (= 2 c_main_~j~0)))) .cse0 (< c_main_~j~0 1)) (<= (select .cse2 4) .cse3) (= |c_main_~#v~0.offset| 0)))) is different from false [2024-09-24 23:01:53,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:01:57,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:02:01,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:02:05,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:02:09,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:02:22,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:02:26,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:02:30,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-24 23:02:34,862 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 [1] [2024-09-24 23:02:38,934 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, 1] [2024-09-24 23:02:42,941 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 [1] [2024-09-24 23:02:46,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:02:51,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:02:55,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-24 23:02:59,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]