./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.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/nla-digbench-scaling/hard2_valuebound100.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 c39f3d25be406fa166da46a61b4a36c0a90262202dfdee83ae8e5211f182a6f7 --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 20:10:58,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:10:58,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:10:58,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:10:58,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:10:58,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:10:58,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:10:58,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:10:58,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:10:58,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:10:58,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:10:58,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:10:58,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:10:58,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:10:58,186 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:10:58,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:10:58,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:10:58,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:10:58,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:10:58,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:10:58,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:10:58,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:10:58,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:10:58,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:10:58,191 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:10:58,192 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:10:58,192 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:10:58,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:10:58,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:10:58,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:10:58,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:10:58,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:10:58,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:10:58,193 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:10:58,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:10:58,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:10:58,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:10:58,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:10:58,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:10:58,194 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:10:58,194 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:10:58,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:10:58,195 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 -> c39f3d25be406fa166da46a61b4a36c0a90262202dfdee83ae8e5211f182a6f7 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 20:10:58,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:10:58,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:10:58,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:10:58,394 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:10:58,394 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:10:58,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c [2024-09-11 20:10:59,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:10:59,763 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:10:59,763 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound100.c [2024-09-11 20:10:59,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5ea851ff4/e87f304426704b9999dd9d158f957e78/FLAG1d49ae980 [2024-09-11 20:10:59,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5ea851ff4/e87f304426704b9999dd9d158f957e78 [2024-09-11 20:10:59,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:10:59,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:10:59,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:10:59,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:10:59,795 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:10:59,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:10:59,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87a0896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59, skipping insertion in model container [2024-09-11 20:10:59,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:10:59,815 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:10:59,938 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/nla-digbench-scaling/hard2_valuebound100.c[526,539] [2024-09-11 20:10:59,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:10:59,968 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:10:59,977 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/nla-digbench-scaling/hard2_valuebound100.c[526,539] [2024-09-11 20:10:59,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:10:59,998 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:10:59,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59 WrapperNode [2024-09-11 20:10:59,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:11:00,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:11:00,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:11:00,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:11:00,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,024 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-09-11 20:11:00,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:11:00,025 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:11:00,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:11:00,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:11:00,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,042 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,054 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 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-11 20:11:00,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,060 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,067 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:11:00,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:11:00,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:11:00,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:11:00,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (1/1) ... [2024-09-11 20:11:00,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:11:00,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:00,104 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 20:11:00,106 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 20:11:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:11:00,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:11:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 20:11:00,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:11:00,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:11:00,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:11:00,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:11:00,199 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:11:00,201 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:11:00,307 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-11 20:11:00,307 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:11:00,336 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:11:00,337 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 20:11:00,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:11:00 BoogieIcfgContainer [2024-09-11 20:11:00,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:11:00,356 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:11:00,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:11:00,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:11:00,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:10:59" (1/3) ... [2024-09-11 20:11:00,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443ad16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:11:00, skipping insertion in model container [2024-09-11 20:11:00,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:10:59" (2/3) ... [2024-09-11 20:11:00,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@443ad16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:11:00, skipping insertion in model container [2024-09-11 20:11:00,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:11:00" (3/3) ... [2024-09-11 20:11:00,365 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound100.c [2024-09-11 20:11:00,379 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:11:00,380 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:11:00,451 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:11:00,457 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;@2bc7dc50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:11:00,461 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:11:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 20:11:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 20:11:00,474 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:00,475 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:00,476 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:00,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:00,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1830609328, now seen corresponding path program 1 times [2024-09-11 20:11:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397030807] [2024-09-11 20:11:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:00,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:00,616 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 20:11:00,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:00,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397030807] [2024-09-11 20:11:00,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397030807] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:00,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:11:00,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:11:00,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184610931] [2024-09-11 20:11:00,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:00,622 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:11:00,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:00,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:11:00,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:11:00,641 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 14 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:00,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:00,664 INFO L93 Difference]: Finished difference Result 44 states and 78 transitions. [2024-09-11 20:11:00,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:11:00,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-09-11 20:11:00,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:00,672 INFO L225 Difference]: With dead ends: 44 [2024-09-11 20:11:00,673 INFO L226 Difference]: Without dead ends: 21 [2024-09-11 20:11:00,675 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 20:11:00,679 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:00,681 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:11:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-11 20:11:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-11 20:11:00,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:11:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2024-09-11 20:11:00,715 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 8 [2024-09-11 20:11:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:00,715 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2024-09-11 20:11:00,715 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:00,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2024-09-11 20:11:00,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 20:11:00,718 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:00,718 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:00,718 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:11:00,718 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:00,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:00,719 INFO L85 PathProgramCache]: Analyzing trace with hash -55601966, now seen corresponding path program 1 times [2024-09-11 20:11:00,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:00,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989781198] [2024-09-11 20:11:00,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:00,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:00,866 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 20:11:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989781198] [2024-09-11 20:11:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989781198] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:00,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:11:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:11:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254937193] [2024-09-11 20:11:00,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:00,871 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:11:00,872 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:00,936 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2024-09-11 20:11:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:00,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-09-11 20:11:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:00,938 INFO L225 Difference]: With dead ends: 34 [2024-09-11 20:11:00,938 INFO L226 Difference]: Without dead ends: 32 [2024-09-11 20:11:00,938 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:11:00,939 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:00,940 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 83 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:11:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-11 20:11:00,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2024-09-11 20:11:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:11:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-09-11 20:11:00,952 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 8 [2024-09-11 20:11:00,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:00,952 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-09-11 20:11:00,952 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:11:00,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:00,953 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-09-11 20:11:00,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 20:11:00,953 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:00,953 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:00,953 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:11:00,954 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:00,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:00,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1587104181, now seen corresponding path program 1 times [2024-09-11 20:11:00,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:00,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692153302] [2024-09-11 20:11:00,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:00,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:01,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:11:01,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:01,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692153302] [2024-09-11 20:11:01,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692153302] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:01,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:11:01,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:11:01,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392389460] [2024-09-11 20:11:01,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:01,040 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:01,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:01,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:01,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:11:01,042 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:11:01,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:01,085 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-09-11 20:11:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:01,086 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-11 20:11:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:01,086 INFO L225 Difference]: With dead ends: 38 [2024-09-11 20:11:01,087 INFO L226 Difference]: Without dead ends: 36 [2024-09-11 20:11:01,087 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:11:01,090 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:01,091 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 80 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:11:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-11 20:11:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-09-11 20:11:01,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-11 20:11:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-09-11 20:11:01,097 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 13 [2024-09-11 20:11:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:01,098 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-09-11 20:11:01,098 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:11:01,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-09-11 20:11:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 20:11:01,099 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:01,099 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:01,099 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:11:01,099 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:01,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1972613170, now seen corresponding path program 1 times [2024-09-11 20:11:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:01,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920571155] [2024-09-11 20:11:01,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:01,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:01,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [755843403] [2024-09-11 20:11:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:01,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:01,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:01,116 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 20:11:01,119 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 20:11:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:01,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 20:11:01,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:11:01,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:11:01,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920571155] [2024-09-11 20:11:01,262 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755843403] [2024-09-11 20:11:01,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755843403] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:01,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:11:01,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:11:01,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45071102] [2024-09-11 20:11:01,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:01,265 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:01,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:01,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:01,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:11:01,268 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:11:01,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:01,336 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2024-09-11 20:11:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:01,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-09-11 20:11:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:01,338 INFO L225 Difference]: With dead ends: 55 [2024-09-11 20:11:01,338 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 20:11:01,339 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:11:01,339 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:01,340 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:11:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 20:11:01,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-11 20:11:01,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 20:11:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-09-11 20:11:01,348 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 18 [2024-09-11 20:11:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:01,349 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-09-11 20:11:01,349 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:11:01,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:01,349 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-09-11 20:11:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 20:11:01,350 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:01,350 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:01,364 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 20:11:01,551 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 20:11:01,551 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:01,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:01,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1810344840, now seen corresponding path program 1 times [2024-09-11 20:11:01,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:01,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252635760] [2024-09-11 20:11:01,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:01,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:01,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886390400] [2024-09-11 20:11:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:01,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:01,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:01,572 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 20:11:01,577 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 20:11:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:01,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-11 20:11:01,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:11:01,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:11:01,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:01,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252635760] [2024-09-11 20:11:01,895 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:01,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886390400] [2024-09-11 20:11:01,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886390400] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:01,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:11:01,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-11 20:11:01,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287974547] [2024-09-11 20:11:01,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:01,897 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:11:01,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:01,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:11:01,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:11:01,899 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:11:01,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:01,995 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2024-09-11 20:11:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:11:01,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 25 [2024-09-11 20:11:01,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:01,997 INFO L225 Difference]: With dead ends: 55 [2024-09-11 20:11:01,997 INFO L226 Difference]: Without dead ends: 53 [2024-09-11 20:11:01,997 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:11:01,998 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:01,998 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 79 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:11:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-11 20:11:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-09-11 20:11:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:11:02,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-09-11 20:11:02,013 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 25 [2024-09-11 20:11:02,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:02,013 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-09-11 20:11:02,013 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-11 20:11:02,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-09-11 20:11:02,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:11:02,016 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:02,016 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:02,032 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 20:11:02,220 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 20:11:02,221 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:02,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:02,221 INFO L85 PathProgramCache]: Analyzing trace with hash -447891575, now seen corresponding path program 1 times [2024-09-11 20:11:02,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:02,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273815566] [2024-09-11 20:11:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:02,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865098213] [2024-09-11 20:11:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:02,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:02,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:02,236 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 20:11:02,237 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 20:11:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:02,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 20:11:02,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-11 20:11:02,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:02,430 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-09-11 20:11:02,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:02,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273815566] [2024-09-11 20:11:02,430 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865098213] [2024-09-11 20:11:02,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865098213] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:02,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:11:02,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-11 20:11:02,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826650363] [2024-09-11 20:11:02,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:02,431 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:02,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:02,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:02,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:11:02,432 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:11:03,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:11:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:03,677 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2024-09-11 20:11:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:03,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-09-11 20:11:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:03,679 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:11:03,679 INFO L226 Difference]: Without dead ends: 60 [2024-09-11 20:11:03,680 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:11:03,680 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:03,680 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-09-11 20:11:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-11 20:11:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-11 20:11:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2) internal successors, (42), 38 states have internal predecessors, (42), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2024-09-11 20:11:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-09-11 20:11:03,692 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 35 [2024-09-11 20:11:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:03,693 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-09-11 20:11:03,693 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:11:03,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-09-11 20:11:03,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-11 20:11:03,694 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:03,694 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:03,710 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:11:03,895 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 20:11:03,895 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:03,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:03,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1669992559, now seen corresponding path program 1 times [2024-09-11 20:11:03,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:03,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245796295] [2024-09-11 20:11:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:03,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:03,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:03,999 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,019 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 20:11:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,025 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-11 20:11:04,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:04,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245796295] [2024-09-11 20:11:04,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245796295] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:04,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:11:04,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:11:04,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140704361] [2024-09-11 20:11:04,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:04,026 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:04,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:04,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:04,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:11:04,028 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-11 20:11:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:04,071 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2024-09-11 20:11:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:04,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2024-09-11 20:11:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:04,072 INFO L225 Difference]: With dead ends: 67 [2024-09-11 20:11:04,074 INFO L226 Difference]: Without dead ends: 55 [2024-09-11 20:11:04,074 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:11:04,075 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:04,075 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:11:04,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-11 20:11:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-11 20:11:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:11:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-09-11 20:11:04,092 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 41 [2024-09-11 20:11:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:04,092 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-09-11 20:11:04,092 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-11 20:11:04,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-09-11 20:11:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-11 20:11:04,096 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:04,097 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:04,097 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 20:11:04,097 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:04,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:04,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1460518785, now seen corresponding path program 1 times [2024-09-11 20:11:04,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:04,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026699914] [2024-09-11 20:11:04,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:04,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199700901] [2024-09-11 20:11:04,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:04,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:04,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:04,133 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 20:11:04,135 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 20:11:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:04,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-11 20:11:04,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-11 20:11:04,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:05,458 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 26 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-09-11 20:11:05,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:05,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026699914] [2024-09-11 20:11:05,459 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:05,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199700901] [2024-09-11 20:11:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199700901] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:05,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:11:05,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-09-11 20:11:05,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869330746] [2024-09-11 20:11:05,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:05,460 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:11:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:05,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:11:05,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:11:05,461 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-11 20:11:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:05,925 INFO L93 Difference]: Finished difference Result 130 states and 175 transitions. [2024-09-11 20:11:05,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:11:05,925 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 55 [2024-09-11 20:11:05,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:05,927 INFO L225 Difference]: With dead ends: 130 [2024-09-11 20:11:05,927 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 20:11:05,927 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:11:05,928 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:05,928 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 171 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:11:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 20:11:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-09-11 20:11:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 68 states have internal predecessors, (77), 31 states have call successors, (31), 10 states have call predecessors, (31), 10 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2024-09-11 20:11:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2024-09-11 20:11:05,949 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 55 [2024-09-11 20:11:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:05,949 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2024-09-11 20:11:05,950 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 14 states have internal predecessors, (33), 7 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-11 20:11:05,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2024-09-11 20:11:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-09-11 20:11:05,951 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:05,951 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:05,963 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 20:11:06,152 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:06,152 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:06,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:06,153 INFO L85 PathProgramCache]: Analyzing trace with hash -814878683, now seen corresponding path program 1 times [2024-09-11 20:11:06,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:06,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580222464] [2024-09-11 20:11:06,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:06,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:06,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124547728] [2024-09-11 20:11:06,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:06,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:06,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:06,178 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 20:11:06,179 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 20:11:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:06,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-11 20:11:06,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-11 20:11:06,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 22 proven. 34 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2024-09-11 20:11:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:06,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580222464] [2024-09-11 20:11:06,795 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:06,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124547728] [2024-09-11 20:11:06,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124547728] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:06,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:11:06,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-09-11 20:11:06,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687737538] [2024-09-11 20:11:06,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:06,796 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-11 20:11:06,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-11 20:11:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:11:06,796 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 16 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-09-11 20:11:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:07,325 INFO L93 Difference]: Finished difference Result 160 states and 213 transitions. [2024-09-11 20:11:07,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:11:07,325 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 66 [2024-09-11 20:11:07,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:07,327 INFO L225 Difference]: With dead ends: 160 [2024-09-11 20:11:07,327 INFO L226 Difference]: Without dead ends: 128 [2024-09-11 20:11:07,327 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:11:07,328 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:07,328 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 187 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:11:07,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-09-11 20:11:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 102. [2024-09-11 20:11:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 67 states have internal predecessors, (73), 28 states have call successors, (28), 11 states have call predecessors, (28), 11 states have return successors, (27), 23 states have call predecessors, (27), 27 states have call successors, (27) [2024-09-11 20:11:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2024-09-11 20:11:07,358 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 128 transitions. Word has length 66 [2024-09-11 20:11:07,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:07,362 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 128 transitions. [2024-09-11 20:11:07,362 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 8 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-09-11 20:11:07,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 128 transitions. [2024-09-11 20:11:07,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-09-11 20:11:07,367 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:07,367 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:07,383 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 20:11:07,571 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:07,572 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:07,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1180146986, now seen corresponding path program 1 times [2024-09-11 20:11:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:07,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778043195] [2024-09-11 20:11:07,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:11:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,741 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:11:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:11:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-11 20:11:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-11 20:11:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-11 20:11:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 20:11:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778043195] [2024-09-11 20:11:07,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778043195] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626789818] [2024-09-11 20:11:07,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:07,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:07,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:07,761 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 20:11:07,762 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 20:11:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:07,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:11:07,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:07,941 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2024-09-11 20:11:07,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:11:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626789818] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:11:07,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:11:07,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-09-11 20:11:07,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552221727] [2024-09-11 20:11:07,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:11:07,947 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:11:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:07,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:11:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:11:07,948 INFO L87 Difference]: Start difference. First operand 102 states and 128 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-11 20:11:08,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:08,032 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2024-09-11 20:11:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:11:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 71 [2024-09-11 20:11:08,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:08,033 INFO L225 Difference]: With dead ends: 139 [2024-09-11 20:11:08,034 INFO L226 Difference]: Without dead ends: 95 [2024-09-11 20:11:08,035 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:11:08,036 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:08,036 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 91 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:11:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-11 20:11:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-09-11 20:11:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 60 states have internal predecessors, (64), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-11 20:11:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2024-09-11 20:11:08,061 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 71 [2024-09-11 20:11:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:08,061 INFO L474 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2024-09-11 20:11:08,062 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-11 20:11:08,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:08,062 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2024-09-11 20:11:08,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-09-11 20:11:08,064 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:08,064 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:08,076 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 20:11:08,268 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-11 20:11:08,269 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:08,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:08,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1399001704, now seen corresponding path program 1 times [2024-09-11 20:11:08,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:08,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032969473] [2024-09-11 20:11:08,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:08,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:11:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:11:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:11:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:11:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,611 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:11:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:11:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:11:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,629 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:11:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-11 20:11:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,634 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-11 20:11:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,636 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-11 20:11:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 20:11:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:08,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032969473] [2024-09-11 20:11:08,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032969473] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:11:08,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565145523] [2024-09-11 20:11:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:08,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:08,640 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 20:11:08,642 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 20:11:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:11:08,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-11 20:11:08,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 20:11:08,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:09,104 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 20:11:09,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565145523] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:09,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:11:09,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-09-11 20:11:09,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185332764] [2024-09-11 20:11:09,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:09,106 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 20:11:09,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:09,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 20:11:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:11:09,106 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-09-11 20:11:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:11:09,242 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-09-11 20:11:09,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:11:09,243 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 71 [2024-09-11 20:11:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:11:09,243 INFO L225 Difference]: With dead ends: 109 [2024-09-11 20:11:09,244 INFO L226 Difference]: Without dead ends: 78 [2024-09-11 20:11:09,244 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:11:09,244 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:11:09,244 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 239 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:11:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-11 20:11:09,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-09-11 20:11:09,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 51 states have internal predecessors, (53), 18 states have call successors, (18), 10 states have call predecessors, (18), 10 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-11 20:11:09,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-09-11 20:11:09,259 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 71 [2024-09-11 20:11:09,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:11:09,259 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-09-11 20:11:09,260 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 12 states have internal predecessors, (40), 8 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-09-11 20:11:09,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:09,260 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-09-11 20:11:09,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-11 20:11:09,261 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:11:09,261 INFO L216 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 20:11:09,274 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 20:11:09,463 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:09,464 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:11:09,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:11:09,464 INFO L85 PathProgramCache]: Analyzing trace with hash -376584808, now seen corresponding path program 2 times [2024-09-11 20:11:09,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:11:09,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228749610] [2024-09-11 20:11:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:11:09,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:11:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:11:09,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [288079418] [2024-09-11 20:11:09,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:11:09,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:11:09,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:11:09,488 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:11:09,489 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-11 20:11:09,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:11:09,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:11:09,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-11 20:11:09,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:11:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-11 20:11:09,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:11:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 46 proven. 40 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-09-11 20:11:25,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:11:25,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228749610] [2024-09-11 20:11:25,450 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:11:25,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288079418] [2024-09-11 20:11:25,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288079418] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:11:25,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:11:25,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2024-09-11 20:11:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331513955] [2024-09-11 20:11:25,451 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:11:25,451 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-11 20:11:25,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:11:25,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-11 20:11:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:11:25,452 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2024-09-11 20:11:37,491 WARN L293 SmtUtils]: Spent 11.55s on a formula simplification. DAG size of input: 177 DAG size of output: 92 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:11:39,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:11:40,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:11:42,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:11:57,944 WARN L293 SmtUtils]: Spent 13.66s on a formula simplification. DAG size of input: 158 DAG size of output: 102 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:12:00,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:12:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:12:00,589 INFO L93 Difference]: Finished difference Result 156 states and 199 transitions. [2024-09-11 20:12:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 20:12:00,590 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 85 [2024-09-11 20:12:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:12:00,592 INFO L225 Difference]: With dead ends: 156 [2024-09-11 20:12:00,592 INFO L226 Difference]: Without dead ends: 137 [2024-09-11 20:12:00,593 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:12:00,593 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:12:00,594 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 341 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2024-09-11 20:12:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-09-11 20:12:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-09-11 20:12:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 87 states have internal predecessors, (93), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (37), 32 states have call predecessors, (37), 37 states have call successors, (37) [2024-09-11 20:12:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 168 transitions. [2024-09-11 20:12:00,643 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 168 transitions. Word has length 85 [2024-09-11 20:12:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:12:00,643 INFO L474 AbstractCegarLoop]: Abstraction has 133 states and 168 transitions. [2024-09-11 20:12:00,643 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 21 states have internal predecessors, (43), 11 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2024-09-11 20:12:00,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:12:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 168 transitions. [2024-09-11 20:12:00,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-09-11 20:12:00,646 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:12:00,646 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:12:00,658 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-11 20:12:00,850 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:12:00,851 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:12:00,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:12:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1552559470, now seen corresponding path program 1 times [2024-09-11 20:12:00,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:12:00,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96582861] [2024-09-11 20:12:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:12:00,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:12:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:12:00,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1015250906] [2024-09-11 20:12:00,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:12:00,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:12:00,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:12:00,877 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:12:00,881 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-11 20:12:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:00,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-11 20:12:00,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:12:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 32 proven. 68 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-11 20:12:01,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:12:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:12:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96582861] [2024-09-11 20:12:01,803 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:12:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015250906] [2024-09-11 20:12:01,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015250906] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:12:01,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:12:01,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-09-11 20:12:01,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679110972] [2024-09-11 20:12:01,804 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:12:01,804 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 20:12:01,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:12:01,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 20:12:01,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:12:01,805 INFO L87 Difference]: Start difference. First operand 133 states and 168 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-11 20:12:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:12:02,046 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2024-09-11 20:12:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:12:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 96 [2024-09-11 20:12:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:12:02,049 INFO L225 Difference]: With dead ends: 145 [2024-09-11 20:12:02,049 INFO L226 Difference]: Without dead ends: 143 [2024-09-11 20:12:02,054 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:12:02,054 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:12:02,055 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 246 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:12:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-09-11 20:12:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2024-09-11 20:12:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.1379310344827587) internal successors, (99), 94 states have internal predecessors, (99), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 32 states have call predecessors, (38), 38 states have call successors, (38) [2024-09-11 20:12:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2024-09-11 20:12:02,105 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 96 [2024-09-11 20:12:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:12:02,106 INFO L474 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2024-09-11 20:12:02,106 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 6 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2024-09-11 20:12:02,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:12:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2024-09-11 20:12:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-09-11 20:12:02,107 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:12:02,107 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:12:02,123 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-11 20:12:02,307 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-11 20:12:02,308 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:12:02,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:12:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1154059924, now seen corresponding path program 2 times [2024-09-11 20:12:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:12:02,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651702901] [2024-09-11 20:12:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:12:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:12:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:12:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1416797325] [2024-09-11 20:12:02,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:12:02,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:12:02,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:12:02,346 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:12:02,348 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-11 20:12:02,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:12:02,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:12:02,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-09-11 20:12:02,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:12:02,729 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-11 20:12:02,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:12:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-11 20:12:05,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:12:05,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651702901] [2024-09-11 20:12:05,189 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:12:05,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416797325] [2024-09-11 20:12:05,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416797325] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:12:05,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:12:05,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-09-11 20:12:05,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274572732] [2024-09-11 20:12:05,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:12:05,191 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-11 20:12:05,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:12:05,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-11 20:12:05,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2024-09-11 20:12:05,192 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand has 27 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) [2024-09-11 20:12:08,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:12:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:12:09,547 INFO L93 Difference]: Finished difference Result 195 states and 251 transitions. [2024-09-11 20:12:09,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-11 20:12:09,547 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) Word has length 96 [2024-09-11 20:12:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:12:09,548 INFO L225 Difference]: With dead ends: 195 [2024-09-11 20:12:09,549 INFO L226 Difference]: Without dead ends: 150 [2024-09-11 20:12:09,549 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=270, Invalid=852, Unknown=0, NotChecked=0, Total=1122 [2024-09-11 20:12:09,549 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-09-11 20:12:09,549 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 349 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-09-11 20:12:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-09-11 20:12:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 128. [2024-09-11 20:12:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 84 states have internal predecessors, (87), 33 states have call successors, (33), 15 states have call predecessors, (33), 15 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-09-11 20:12:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 152 transitions. [2024-09-11 20:12:09,592 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 152 transitions. Word has length 96 [2024-09-11 20:12:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:12:09,592 INFO L474 AbstractCegarLoop]: Abstraction has 128 states and 152 transitions. [2024-09-11 20:12:09,592 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 15 states have call successors, (32), 3 states have call predecessors, (32), 2 states have return successors, (30), 13 states have call predecessors, (30), 13 states have call successors, (30) [2024-09-11 20:12:09,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:12:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 152 transitions. [2024-09-11 20:12:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-09-11 20:12:09,593 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:12:09,593 INFO L216 NwaCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:12:09,605 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-11 20:12:09,797 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-09-11 20:12:09,797 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:12:09,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:12:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2060413457, now seen corresponding path program 1 times [2024-09-11 20:12:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:12:09,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070462132] [2024-09-11 20:12:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:12:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:12:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:12:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,100 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:12:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,104 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:12:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:12:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,108 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:12:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:12:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:12:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:12:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 20:12:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,119 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:12:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 20:12:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,124 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 20:12:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-11 20:12:10,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,128 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-09-11 20:12:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-09-11 20:12:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,133 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-09-11 20:12:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-09-11 20:12:10,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:12:10,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070462132] [2024-09-11 20:12:10,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070462132] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:12:10,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117086762] [2024-09-11 20:12:10,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:12:10,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:12:10,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:12:10,140 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:12:10,141 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-11 20:12:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:10,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-11 20:12:10,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:12:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-09-11 20:12:10,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:12:11,874 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-09-11 20:12:11,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117086762] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:12:11,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:12:11,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 14] total 30 [2024-09-11 20:12:11,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944381492] [2024-09-11 20:12:11,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:12:11,876 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-11 20:12:11,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:12:11,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-11 20:12:11,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2024-09-11 20:12:11,877 INFO L87 Difference]: Start difference. First operand 128 states and 152 transitions. Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 27 states have internal predecessors, (60), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2024-09-11 20:12:13,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:12:13,208 INFO L93 Difference]: Finished difference Result 188 states and 235 transitions. [2024-09-11 20:12:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-11 20:12:13,209 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 27 states have internal predecessors, (60), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) Word has length 101 [2024-09-11 20:12:13,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:12:13,210 INFO L225 Difference]: With dead ends: 188 [2024-09-11 20:12:13,210 INFO L226 Difference]: Without dead ends: 155 [2024-09-11 20:12:13,213 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=343, Invalid=1549, Unknown=0, NotChecked=0, Total=1892 [2024-09-11 20:12:13,213 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 38 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:12:13,214 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 319 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:12:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-09-11 20:12:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2024-09-11 20:12:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 87 states have (on average 1.1264367816091954) internal successors, (98), 92 states have internal predecessors, (98), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-09-11 20:12:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2024-09-11 20:12:13,307 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 101 [2024-09-11 20:12:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:12:13,308 INFO L474 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2024-09-11 20:12:13,308 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.0) internal successors, (60), 27 states have internal predecessors, (60), 17 states have call successors, (49), 3 states have call predecessors, (49), 2 states have return successors, (47), 17 states have call predecessors, (47), 17 states have call successors, (47) [2024-09-11 20:12:13,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:12:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2024-09-11 20:12:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-09-11 20:12:13,310 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:12:13,310 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:12:13,325 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-11 20:12:13,511 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-09-11 20:12:13,512 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:12:13,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:12:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2077808773, now seen corresponding path program 2 times [2024-09-11 20:12:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:12:13,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114068377] [2024-09-11 20:12:13,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:12:13,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:12:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:12:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:12:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,654 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:12:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:12:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:12:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:12:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:12:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:12:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 20:12:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:12:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 20:12:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-09-11 20:12:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-09-11 20:12:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,675 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-11 20:12:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,678 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-09-11 20:12:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,680 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-09-11 20:12:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-09-11 20:12:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-09-11 20:12:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:13,686 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 51 proven. 28 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-11 20:12:13,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:12:13,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114068377] [2024-09-11 20:12:13,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114068377] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:12:13,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258628905] [2024-09-11 20:12:13,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:12:13,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:12:13,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:12:13,688 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:12:13,691 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-11 20:12:13,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:12:13,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:12:13,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:12:13,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:12:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-11 20:12:13,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:12:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-09-11 20:12:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258628905] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:12:13,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:12:13,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 9 [2024-09-11 20:12:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428336550] [2024-09-11 20:12:13,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:12:13,903 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 20:12:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:12:13,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 20:12:13,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:12:13,903 INFO L87 Difference]: Start difference. First operand 146 states and 180 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 8 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2024-09-11 20:12:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:12:14,045 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2024-09-11 20:12:14,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:12:14,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 8 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) Word has length 113 [2024-09-11 20:12:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:12:14,047 INFO L225 Difference]: With dead ends: 155 [2024-09-11 20:12:14,047 INFO L226 Difference]: Without dead ends: 141 [2024-09-11 20:12:14,047 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 255 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:12:14,047 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:12:14,048 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 155 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:12:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-09-11 20:12:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 110. [2024-09-11 20:12:14,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 73 states have internal predecessors, (75), 24 states have call successors, (24), 15 states have call predecessors, (24), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-11 20:12:14,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-09-11 20:12:14,096 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 113 [2024-09-11 20:12:14,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:12:14,097 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-09-11 20:12:14,097 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 8 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (25), 7 states have call predecessors, (25), 7 states have call successors, (25) [2024-09-11 20:12:14,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:12:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-09-11 20:12:14,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-09-11 20:12:14,099 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:12:14,099 INFO L216 NwaCegarLoop]: trace histogram [19, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:12:14,110 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-11 20:12:14,299 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-11 20:12:14,300 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:12:14,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:12:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash 395227745, now seen corresponding path program 1 times [2024-09-11 20:12:14,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:12:14,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449036909] [2024-09-11 20:12:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:12:14,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:12:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:12:14,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833137019] [2024-09-11 20:12:14,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:12:14,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:12:14,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:12:14,334 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:12:14,335 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-11 20:12:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:12:14,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-11 20:12:14,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:12:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-09-11 20:12:14,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:13:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 38 proven. 100 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-09-11 20:13:37,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:13:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449036909] [2024-09-11 20:13:37,024 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:13:37,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833137019] [2024-09-11 20:13:37,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833137019] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:13:37,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:13:37,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2024-09-11 20:13:37,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224306529] [2024-09-11 20:13:37,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:13:37,025 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-11 20:13:37,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:13:37,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-11 20:13:37,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2024-09-11 20:13:37,026 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 27 states have internal predecessors, (53), 15 states have call successors, (38), 3 states have call predecessors, (38), 2 states have return successors, (36), 13 states have call predecessors, (36), 13 states have call successors, (36) [2024-09-11 20:14:19,669 WARN L293 SmtUtils]: Spent 42.09s on a formula simplification. DAG size of input: 569 DAG size of output: 130 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:14:22,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:14:24,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:14:26,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:14:29,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:14:42,215 WARN L293 SmtUtils]: Spent 9.48s on a formula simplification. DAG size of input: 179 DAG size of output: 111 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:14:56,084 WARN L293 SmtUtils]: Spent 12.55s on a formula simplification. DAG size of input: 143 DAG size of output: 113 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:15:12,670 WARN L293 SmtUtils]: Spent 11.48s on a formula simplification. DAG size of input: 176 DAG size of output: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:15:14,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:15:17,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:15:19,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:15:26,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:15:31,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:15:33,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []