./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/insertion_sort-2-2.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 19:17:11,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:17:11,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:17:11,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:17:11,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:17:11,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:17:11,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:17:11,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:17:11,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:17:11,450 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:17:11,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:17:11,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:17:11,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:17:11,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:17:11,453 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:17:11,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:17:11,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:17:11,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:17:11,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:17:11,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:17:11,454 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:17:11,456 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:17:11,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:17:11,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:17:11,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:17:11,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:17:11,457 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:17:11,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:17:11,458 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:17:11,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:17:11,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:17:11,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:17:11,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:17:11,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:17:11,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:17:11,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:17:11,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:17:11,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:17:11,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:17:11,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:17:11,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:17:11,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:17:11,460 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.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 [2024-09-11 19:17:11,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:17:11,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:17:11,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:17:11,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:17:11,707 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:17:11,707 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-11 19:17:12,941 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:17:13,098 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:17:13,099 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/insertion_sort-2-2.c [2024-09-11 19:17:13,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/760488851/486d749a2bef4137a9bb52b8e56df324/FLAG91cb96f6c [2024-09-11 19:17:13,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/760488851/486d749a2bef4137a9bb52b8e56df324 [2024-09-11 19:17:13,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:17:13,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:17:13,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:17:13,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:17:13,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:17:13,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbf5fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13, skipping insertion in model container [2024-09-11 19:17:13,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:17:13,314 WARN L247 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-11 19:17:13,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:17:13,344 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:17:13,365 WARN L247 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-11 19:17:13,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:17:13,416 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:17:13,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13 WrapperNode [2024-09-11 19:17:13,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:17:13,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:17:13,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:17:13,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:17:13,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,439 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,460 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2024-09-11 19:17:13,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:17:13,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:17:13,462 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:17:13,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:17:13,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,507 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-11 19:17:13,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,524 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:17:13,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:17:13,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:17:13,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:17:13,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (1/1) ... [2024-09-11 19:17:13,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:17:13,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:13,578 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-11 19:17:13,581 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-11 19:17:13,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:17:13,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:17:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 19:17:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-11 19:17:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 19:17:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 19:17:13,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:17:13,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:17:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 19:17:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 19:17:13,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 19:17:13,688 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:17:13,689 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:17:13,857 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-09-11 19:17:13,857 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:17:13,886 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:17:13,887 INFO L318 CfgBuilder]: Removed 4 assume(true) statements. [2024-09-11 19:17:13,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:17:13 BoogieIcfgContainer [2024-09-11 19:17:13,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:17:13,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:17:13,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:17:13,892 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:17:13,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:17:13" (1/3) ... [2024-09-11 19:17:13,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f064b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:17:13, skipping insertion in model container [2024-09-11 19:17:13,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:17:13" (2/3) ... [2024-09-11 19:17:13,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f064b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:17:13, skipping insertion in model container [2024-09-11 19:17:13,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:17:13" (3/3) ... [2024-09-11 19:17:13,896 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort-2-2.c [2024-09-11 19:17:13,908 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:17:13,909 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:17:13,956 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:17:13,963 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;@7386c2a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:17:13,964 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:17:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 19:17:13,973 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:13,974 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:13,974 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:13,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 438010954, now seen corresponding path program 1 times [2024-09-11 19:17:13,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:13,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107691134] [2024-09-11 19:17:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:14,092 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-11 19:17:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:14,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107691134] [2024-09-11 19:17:14,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107691134] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:17:14,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:17:14,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:17:14,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703882888] [2024-09-11 19:17:14,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:17:14,098 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:17:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:14,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:17:14,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:17:14,118 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:14,136 INFO L93 Difference]: Finished difference Result 33 states and 50 transitions. [2024-09-11 19:17:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:17:14,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-09-11 19:17:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:14,147 INFO L225 Difference]: With dead ends: 33 [2024-09-11 19:17:14,147 INFO L226 Difference]: Without dead ends: 15 [2024-09-11 19:17:14,149 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 19:17:14,152 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:14,154 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:17:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-11 19:17:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-11 19:17:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2024-09-11 19:17:14,175 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2024-09-11 19:17:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:14,176 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2024-09-11 19:17:14,176 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2024-09-11 19:17:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 19:17:14,177 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:14,177 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:14,178 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:17:14,178 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:14,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,178 INFO L85 PathProgramCache]: Analyzing trace with hash -616055382, now seen corresponding path program 1 times [2024-09-11 19:17:14,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:14,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116207709] [2024-09-11 19:17:14,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:14,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:14,395 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-11 19:17:14,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:14,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116207709] [2024-09-11 19:17:14,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116207709] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:17:14,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:17:14,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:17:14,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67893959] [2024-09-11 19:17:14,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:17:14,396 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:17:14,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:14,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:17:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:17:14,403 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:14,469 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2024-09-11 19:17:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:17:14,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-09-11 19:17:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:14,470 INFO L225 Difference]: With dead ends: 27 [2024-09-11 19:17:14,470 INFO L226 Difference]: Without dead ends: 20 [2024-09-11 19:17:14,471 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11 19:17:14,473 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:14,473 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 42 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:17:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-11 19:17:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2024-09-11 19:17:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-09-11 19:17:14,480 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2024-09-11 19:17:14,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:14,480 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-09-11 19:17:14,480 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-09-11 19:17:14,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-11 19:17:14,481 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:14,481 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:14,482 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:17:14,482 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:14,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1413316211, now seen corresponding path program 1 times [2024-09-11 19:17:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:14,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459890221] [2024-09-11 19:17:14,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:17:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:14,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459890221] [2024-09-11 19:17:14,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459890221] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:17:14,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:17:14,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:17:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483221377] [2024-09-11 19:17:14,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:17:14,646 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:17:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:14,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:17:14,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:17:14,647 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:14,683 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-09-11 19:17:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:17:14,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-09-11 19:17:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:14,684 INFO L225 Difference]: With dead ends: 30 [2024-09-11 19:17:14,684 INFO L226 Difference]: Without dead ends: 17 [2024-09-11 19:17:14,684 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11 19:17:14,685 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:14,686 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:17:14,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-11 19:17:14,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-11 19:17:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-09-11 19:17:14,696 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 14 [2024-09-11 19:17:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:14,696 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-09-11 19:17:14,696 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:14,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-09-11 19:17:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 19:17:14,697 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:14,697 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:14,697 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:17:14,697 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:14,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1764545412, now seen corresponding path program 1 times [2024-09-11 19:17:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:14,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213771638] [2024-09-11 19:17:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:14,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:14,831 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-11 19:17:14,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:14,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213771638] [2024-09-11 19:17:14,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213771638] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:14,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907551375] [2024-09-11 19:17:14,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:14,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:14,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:14,837 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-11 19:17:14,838 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-11 19:17:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:14,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 19:17:14,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:14,958 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-11 19:17:14,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:15,040 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-11 19:17:15,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907551375] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:15,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:15,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-09-11 19:17:15,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773060001] [2024-09-11 19:17:15,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:15,045 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:17:15,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:15,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:17:15,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:17:15,046 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:15,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:15,116 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2024-09-11 19:17:15,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:17:15,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-09-11 19:17:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:15,117 INFO L225 Difference]: With dead ends: 35 [2024-09-11 19:17:15,117 INFO L226 Difference]: Without dead ends: 22 [2024-09-11 19:17:15,118 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:17:15,119 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:15,121 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:17:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-11 19:17:15,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2024-09-11 19:17:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-09-11 19:17:15,126 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 15 [2024-09-11 19:17:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:15,127 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-09-11 19:17:15,127 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:15,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-09-11 19:17:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-11 19:17:15,128 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:15,129 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:15,142 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 19:17:15,329 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:15,330 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:15,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:15,331 INFO L85 PathProgramCache]: Analyzing trace with hash -232251245, now seen corresponding path program 2 times [2024-09-11 19:17:15,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:15,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100022197] [2024-09-11 19:17:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:16,156 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-11 19:17:16,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100022197] [2024-09-11 19:17:16,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100022197] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256667652] [2024-09-11 19:17:16,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:17:16,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:16,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:16,159 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-11 19:17:16,161 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-11 19:17:16,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:17:16,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:17:16,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-11 19:17:16,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:16,339 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-11 19:17:16,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:17:16,368 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-11 19:17:16,381 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-11 19:17:16,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:16,488 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-11 19:17:16,504 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-11 19:17:16,505 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-11 19:17:16,561 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-11 19:17:16,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256667652] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:16,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:16,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2024-09-11 19:17:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181071322] [2024-09-11 19:17:16,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:16,563 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 19:17:16,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:16,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 19:17:16,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2024-09-11 19:17:16,564 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:16,896 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2024-09-11 19:17:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 19:17:16,897 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-09-11 19:17:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:16,899 INFO L225 Difference]: With dead ends: 61 [2024-09-11 19:17:16,899 INFO L226 Difference]: Without dead ends: 50 [2024-09-11 19:17:16,899 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2024-09-11 19:17:16,900 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 82 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:16,900 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 77 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:17:16,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-11 19:17:16,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 29. [2024-09-11 19:17:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:16,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-09-11 19:17:16,906 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-09-11 19:17:16,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:16,906 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-09-11 19:17:16,906 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 24 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:16,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:16,907 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-09-11 19:17:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:17:16,907 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:16,907 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:16,926 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 19:17:17,108 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:17,108 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:17,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:17,109 INFO L85 PathProgramCache]: Analyzing trace with hash 200630979, now seen corresponding path program 1 times [2024-09-11 19:17:17,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:17,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61490004] [2024-09-11 19:17:17,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:17,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:17:17,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:17,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61490004] [2024-09-11 19:17:17,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61490004] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:17,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16292822] [2024-09-11 19:17:17,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:17,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:17,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:17,303 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-11 19:17:17,304 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-11 19:17:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:17,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 19:17:17,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:17:17,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:17:17,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16292822] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:17,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:17,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2024-09-11 19:17:17,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306214978] [2024-09-11 19:17:17,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:17,681 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 19:17:17,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:17,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 19:17:17,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:17:17,682 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:17:17,784 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2024-09-11 19:17:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 19:17:17,785 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-09-11 19:17:17,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:17:17,786 INFO L225 Difference]: With dead ends: 89 [2024-09-11 19:17:17,786 INFO L226 Difference]: Without dead ends: 62 [2024-09-11 19:17:17,786 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:17:17,787 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:17:17,787 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 128 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:17:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-11 19:17:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2024-09-11 19:17:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:17,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-09-11 19:17:17,798 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 19 [2024-09-11 19:17:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:17:17,798 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-09-11 19:17:17,799 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:17,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:17,799 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-09-11 19:17:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 19:17:17,799 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:17:17,800 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:17:17,816 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-11 19:17:18,003 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 19:17:18,004 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:17:18,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:17:18,004 INFO L85 PathProgramCache]: Analyzing trace with hash 973872331, now seen corresponding path program 1 times [2024-09-11 19:17:18,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:17:18,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532072964] [2024-09-11 19:17:18,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:18,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:17:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:18,413 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-11 19:17:18,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:17:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532072964] [2024-09-11 19:17:18,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532072964] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:17:18,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721371477] [2024-09-11 19:17:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:17:18,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:17:18,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:17:18,415 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-11 19:17:18,417 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-11 19:17:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:17:18,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-11 19:17:18,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:17:18,521 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-11 19:17:18,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:17:18,605 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-11 19:17:18,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:17:18,650 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-11 19:17:18,674 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-11 19:17:18,675 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:17:18,927 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-11 19:17:18,938 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-09-11 19:17:18,938 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 168 treesize of output 136 [2024-09-11 19:17:19,031 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-11 19:17:19,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721371477] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:17:19,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:17:19,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 10] total 31 [2024-09-11 19:17:19,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679052832] [2024-09-11 19:17:19,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:17:19,032 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-11 19:17:19,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:17:19,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-11 19:17:19,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2024-09-11 19:17:19,033 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 31 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:17:23,771 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-11 19:17:48,498 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-11 19:17:52,611 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-11 19:17:56,671 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-11 19:18:00,785 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-11 19:18:02,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:18:06,564 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-11 19:18:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:18:10,770 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2024-09-11 19:18:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-11 19:18:10,771 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-09-11 19:18:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:18:10,771 INFO L225 Difference]: With dead ends: 123 [2024-09-11 19:18:10,771 INFO L226 Difference]: Without dead ends: 73 [2024-09-11 19:18:10,772 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 25.7s TimeCoverageRelationStatistics Valid=513, Invalid=2905, Unknown=4, NotChecked=0, Total=3422 [2024-09-11 19:18:10,773 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 81 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 21 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.4s IncrementalHoareTripleChecker+Time [2024-09-11 19:18:10,773 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 155 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 556 Invalid, 6 Unknown, 0 Unchecked, 26.4s Time] [2024-09-11 19:18:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-11 19:18:10,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2024-09-11 19:18:10,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:10,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2024-09-11 19:18:10,790 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 19 [2024-09-11 19:18:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:18:10,791 INFO L474 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2024-09-11 19:18:10,791 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:10,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:18:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2024-09-11 19:18:10,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:18:10,791 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:18:10,791 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:18:10,804 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 19:18:10,993 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:18:10,993 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:18:10,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:18:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1273924345, now seen corresponding path program 3 times [2024-09-11 19:18:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:18:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463926903] [2024-09-11 19:18:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:18:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:18:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:18:11,614 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:18:11,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:18:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463926903] [2024-09-11 19:18:11,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463926903] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:18:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088815858] [2024-09-11 19:18:11,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:18:11,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:18:11,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:18:11,616 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-11 19:18:11,617 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-11 19:18:11,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-11 19:18:11,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:18:11,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 19:18:11,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:18:11,734 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-11 19:18:11,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:18:11,776 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 27 treesize of output 18 [2024-09-11 19:18:11,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:18:11,806 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-11 19:18:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:18:11,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:18:16,153 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 51 treesize of output 45 [2024-09-11 19:18:16,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:18:16,169 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 145 treesize of output 139 [2024-09-11 19:18:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:18:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088815858] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:18:20,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:18:20,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 28 [2024-09-11 19:18:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568372940] [2024-09-11 19:18:20,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:18:20,390 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-11 19:18:20,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:18:20,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-11 19:18:20,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=636, Unknown=1, NotChecked=0, Total=756 [2024-09-11 19:18:20,391 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:18:24,837 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-11 19:18:28,979 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-11 19:18:41,380 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-11 19:18:45,408 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-11 19:18:49,461 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-11 19:18:53,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|)) (.cse3 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4))) (and (forall ((v_ArrVal_105 Int)) (let ((.cse0 (store .cse2 .cse3 v_ArrVal_105))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1)))) (= |c_ULTIMATE.start_main_~j~0#1| 2) (<= (select .cse2 0) (select .cse2 4)) (or (< |c_ULTIMATE.start_main_~j~0#1| 0) (forall ((v_ArrVal_103 Int) (v_ArrVal_105 Int)) (or (let ((.cse4 (store .cse2 .cse3 v_ArrVal_103))) (< (select .cse4 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select (store .cse4 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4) 4) v_ArrVal_105) .cse1) 1))) (< v_ArrVal_103 |c_ULTIMATE.start_main_~key~0#1|)))) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0))) is different from false [2024-09-11 19:19:05,981 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-11 19:19:10,124 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-11 19:19:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:19:10,144 INFO L93 Difference]: Finished difference Result 189 states and 256 transitions. [2024-09-11 19:19:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-11 19:19:10,145 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-09-11 19:19:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:19:10,146 INFO L225 Difference]: With dead ends: 189 [2024-09-11 19:19:10,147 INFO L226 Difference]: Without dead ends: 161 [2024-09-11 19:19:10,148 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=459, Invalid=2509, Unknown=6, NotChecked=106, Total=3080 [2024-09-11 19:19:10,148 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 170 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 38 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 28.7s IncrementalHoareTripleChecker+Time [2024-09-11 19:19:10,148 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 88 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 502 Invalid, 7 Unknown, 52 Unchecked, 28.7s Time] [2024-09-11 19:19:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-09-11 19:19:10,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 65. [2024-09-11 19:19:10,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:19:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2024-09-11 19:19:10,165 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 22 [2024-09-11 19:19:10,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:19:10,165 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2024-09-11 19:19:10,165 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:19:10,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2024-09-11 19:19:10,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 19:19:10,166 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:19:10,166 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:19:10,182 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 19:19:10,369 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-11 19:19:10,370 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:19:10,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:10,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1154291357, now seen corresponding path program 2 times [2024-09-11 19:19:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:19:10,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91849192] [2024-09-11 19:19:10,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:19:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:19:10,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:19:10,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91849192] [2024-09-11 19:19:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91849192] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:19:10,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070492507] [2024-09-11 19:19:10,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:19:10,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:10,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:19:10,823 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-11 19:19:10,830 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-11 19:19:10,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:19:10,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:19:10,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 19:19:10,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:19:11,097 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-11 19:19:11,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:19:11,224 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-11 19:19:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 19:19:11,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:19:15,457 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-11 19:19:15,481 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-11 19:19:15,481 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-11 19:19:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:19:15,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070492507] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:19:15,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:19:15,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 26 [2024-09-11 19:19:15,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204714895] [2024-09-11 19:19:15,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:19:15,510 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-11 19:19:15,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:19:15,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-11 19:19:15,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=558, Unknown=1, NotChecked=0, Total=650 [2024-09-11 19:19:15,511 INFO L87 Difference]: Start difference. First operand 65 states and 88 transitions. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:19:19,845 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-11 19:19:24,012 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-11 19:19:28,106 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-11 19:19:32,176 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-11 19:19:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:19:32,287 INFO L93 Difference]: Finished difference Result 125 states and 165 transitions. [2024-09-11 19:19:32,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 19:19:32,287 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-09-11 19:19:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:19:32,288 INFO L225 Difference]: With dead ends: 125 [2024-09-11 19:19:32,288 INFO L226 Difference]: Without dead ends: 123 [2024-09-11 19:19:32,288 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=177, Invalid=1012, Unknown=1, NotChecked=0, Total=1190 [2024-09-11 19:19:32,288 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 92 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 15 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-09-11 19:19:32,289 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 175 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 414 Invalid, 4 Unknown, 0 Unchecked, 16.5s Time] [2024-09-11 19:19:32,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-09-11 19:19:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 91. [2024-09-11 19:19:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:19:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2024-09-11 19:19:32,311 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 25 [2024-09-11 19:19:32,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:19:32,311 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2024-09-11 19:19:32,311 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:19:32,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2024-09-11 19:19:32,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 19:19:32,312 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:19:32,312 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:19:32,324 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-11 19:19:32,512 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:32,512 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:19:32,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:19:32,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1385865277, now seen corresponding path program 2 times [2024-09-11 19:19:32,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:19:32,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111710690] [2024-09-11 19:19:32,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:19:32,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:19:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:19:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:19:33,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:19:33,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111710690] [2024-09-11 19:19:33,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111710690] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:19:33,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137559567] [2024-09-11 19:19:33,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:19:33,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:19:33,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:19:33,253 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-11 19:19:33,255 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-11 19:19:33,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:19:33,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:19:33,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-11 19:19:33,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:19:33,382 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-11 19:19:33,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:19:33,558 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-11 19:19:33,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:19:33,596 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 29 treesize of output 20 [2024-09-11 19:19:33,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-11 19:19:33,624 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-11 19:19:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:19:33,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:19:42,112 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 88 treesize of output 80 [2024-09-11 19:19:42,135 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-09-11 19:19:42,136 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 17050 treesize of output 16278 [2024-09-11 19:19:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 8 refuted. 2 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:19:50,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137559567] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:19:50,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:19:50,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 13] total 31 [2024-09-11 19:19:50,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994517403] [2024-09-11 19:19:50,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:19:50,556 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-11 19:19:50,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:19:50,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-11 19:19:50,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=776, Unknown=4, NotChecked=0, Total=930 [2024-09-11 19:19:50,557 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 31 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 31 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:20:04,008 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-11 19:20:08,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-11 19:20:12,098 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-11 19:20:16,141 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-11 19:20:20,183 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-11 19:20:24,208 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-11 19:20:28,229 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-11 19:20:32,842 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-11 19:21:05,211 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-11 19:21:09,234 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-11 19:21:13,246 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-11 19:21:17,265 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-11 19:21:21,288 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-11 19:21:25,303 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-11 19:21:29,325 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-11 19:21:33,344 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-11 19:21:37,383 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|))) (and (forall ((v_ArrVal_165 Int)) (let ((.cse0 (store .cse2 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_165))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1)))) (forall ((v_ArrVal_165 Int)) (let ((.cse3 (store .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_165))) (< (select .cse3 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse3 .cse1) 1)))) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0) (<= (+ (select .cse2 0) 1) (select .cse2 4)))) is different from false [2024-09-11 19:21:41,690 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-11 19:21:45,794 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|))) (and (forall ((v_ArrVal_165 Int)) (let ((.cse0 (store .cse2 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)) v_ArrVal_165))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 .cse1) 1)))) (forall ((v_ArrVal_165 Int)) (let ((.cse3 (store .cse2 (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_165))) (< (select .cse3 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse3 .cse1) 1)))) (= |c_ULTIMATE.start_main_~#v~0#1.offset| 0) (or (not |c_ULTIMATE.start_main_#t~short9#1|) (< 0 |c_ULTIMATE.start_main_~i~0#1|) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~j~0#1| 0)) (not (= (+ |c_ULTIMATE.start_main_~j~0#1| 1) 0)))))) is different from false [2024-09-11 19:21:49,849 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_165 Int)) (let ((.cse0 (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~#v~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~#v~0#1.offset| 4) v_ArrVal_165))) (< (select .cse0 |c_ULTIMATE.start_main_~#v~0#1.offset|) (+ (select .cse0 (+ |c_ULTIMATE.start_main_~#v~0#1.offset| 4)) 1)))) (or (not |c_ULTIMATE.start_main_#t~short9#1|) (< 0 |c_ULTIMATE.start_main_~i~0#1|) (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (not (= |c_ULTIMATE.start_main_~j~0#1| 0)) (not (= (+ |c_ULTIMATE.start_main_~j~0#1| 1) 0))))) is different from false