./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.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_valuebound1.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 45ff7b74faf4250f77b788e07275d725ea3dbcc73af0b2b0d64dcf5aa7f7b78a --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:09:56,624 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:09:56,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:09:56,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:09:56,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:09:56,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:09:56,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:09:56,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:09:56,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:09:56,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:09:56,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:09:56,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:09:56,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:09:56,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:09:56,735 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:09:56,735 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:09:56,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:09:56,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:09:56,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:09:56,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:09:56,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:09:56,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:09:56,737 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:09:56,737 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:09:56,737 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:09:56,737 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:09:56,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:09:56,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:09:56,738 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:09:56,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:09:56,738 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:09:56,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:09:56,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:09:56,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:09:56,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:09:56,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:09:56,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:09:56,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:09:56,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:09:56,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:09:56,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:09:56,741 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:09:56,742 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 -> 45ff7b74faf4250f77b788e07275d725ea3dbcc73af0b2b0d64dcf5aa7f7b78a 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:09:56,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:09:57,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:09:57,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:09:57,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:09:57,015 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:09:57,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c [2024-09-11 20:09:58,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:09:58,535 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:09:58,535 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard2_valuebound1.c [2024-09-11 20:09:58,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a104d0f14/6886187fa29c4ec7b4281eda89a66134/FLAG892304b9e [2024-09-11 20:09:58,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a104d0f14/6886187fa29c4ec7b4281eda89a66134 [2024-09-11 20:09:58,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:09:58,932 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:09:58,933 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:09:58,933 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:09:58,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:09:58,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:09:58" (1/1) ... [2024-09-11 20:09:58,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9463b14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:58, skipping insertion in model container [2024-09-11 20:09:58,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:09:58" (1/1) ... [2024-09-11 20:09:58,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:09:59,107 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_valuebound1.c[526,539] [2024-09-11 20:09:59,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:09:59,133 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:09:59,146 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_valuebound1.c[526,539] [2024-09-11 20:09:59,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:09:59,167 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:09:59,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59 WrapperNode [2024-09-11 20:09:59,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:09:59,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:09:59,169 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:09:59,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:09:59,177 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:09:59" (1/1) ... [2024-09-11 20:09:59,184 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:09:59" (1/1) ... [2024-09-11 20:09:59,205 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-09-11 20:09:59,207 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:09:59,208 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:09:59,208 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:09:59,208 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:09:59,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,236 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:09:59,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:09:59,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:09:59,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:09:59,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:09:59,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (1/1) ... [2024-09-11 20:09:59,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:09:59,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:09:59,301 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:09:59,310 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:09:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:09:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:09:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 20:09:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:09:59,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:09:59,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:09:59,353 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:09:59,419 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:09:59,424 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:09:59,585 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-11 20:09:59,585 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:09:59,623 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:09:59,624 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 20:09:59,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:09:59 BoogieIcfgContainer [2024-09-11 20:09:59,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:09:59,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:09:59,627 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:09:59,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:09:59,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:09:58" (1/3) ... [2024-09-11 20:09:59,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8c8609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:09:59, skipping insertion in model container [2024-09-11 20:09:59,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:09:59" (2/3) ... [2024-09-11 20:09:59,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d8c8609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:09:59, skipping insertion in model container [2024-09-11 20:09:59,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:09:59" (3/3) ... [2024-09-11 20:09:59,635 INFO L112 eAbstractionObserver]: Analyzing ICFG hard2_valuebound1.c [2024-09-11 20:09:59,652 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:09:59,652 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:09:59,713 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:09:59,719 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;@3a67aa3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:09:59,720 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:09:59,724 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:09:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 20:09:59,731 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:09:59,732 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:09:59,733 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:09:59,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:59,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1830609328, now seen corresponding path program 1 times [2024-09-11 20:09:59,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:09:59,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465394534] [2024-09-11 20:09:59,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:59,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:09:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:59,902 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:09:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:09:59,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465394534] [2024-09-11 20:09:59,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465394534] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:09:59,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:09:59,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:09:59,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807483742] [2024-09-11 20:09:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:09:59,911 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:09:59,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:09:59,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:09:59,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:09:59,937 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:09:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:09:59,972 INFO L93 Difference]: Finished difference Result 44 states and 78 transitions. [2024-09-11 20:09:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:09:59,976 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:09:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:09:59,983 INFO L225 Difference]: With dead ends: 44 [2024-09-11 20:09:59,984 INFO L226 Difference]: Without dead ends: 21 [2024-09-11 20:09:59,988 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:09:59,993 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:09:59,994 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:10:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-11 20:10:00,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-11 20:10:00,031 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:10:00,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2024-09-11 20:10:00,036 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 8 [2024-09-11 20:10:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:00,036 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2024-09-11 20:10:00,036 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:10:00,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2024-09-11 20:10:00,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 20:10:00,039 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:00,039 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:00,039 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:10:00,039 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:00,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,040 INFO L85 PathProgramCache]: Analyzing trace with hash -55601966, now seen corresponding path program 1 times [2024-09-11 20:10:00,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810792840] [2024-09-11 20:10:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,235 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:10:00,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:00,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810792840] [2024-09-11 20:10:00,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810792840] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:00,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:00,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:10:00,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906320378] [2024-09-11 20:10:00,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:00,239 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:00,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:10:00,241 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:10:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:00,325 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2024-09-11 20:10:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:00,326 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:10:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:00,327 INFO L225 Difference]: With dead ends: 34 [2024-09-11 20:10:00,328 INFO L226 Difference]: Without dead ends: 32 [2024-09-11 20:10:00,328 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:10:00,330 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:10:00,331 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:10:00,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-11 20:10:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2024-09-11 20:10:00,343 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:10:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2024-09-11 20:10:00,346 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 8 [2024-09-11 20:10:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:00,346 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2024-09-11 20:10:00,346 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:10:00,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2024-09-11 20:10:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 20:10:00,348 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:00,348 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:00,348 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:10:00,349 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:00,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1587104181, now seen corresponding path program 1 times [2024-09-11 20:10:00,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:00,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36358253] [2024-09-11 20:10:00,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:00,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:10:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,498 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:10:00,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36358253] [2024-09-11 20:10:00,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36358253] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:00,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:00,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:10:00,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637511342] [2024-09-11 20:10:00,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:00,502 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:00,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:00,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:10:00,505 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:10:00,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:00,581 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-09-11 20:10:00,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:00,582 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:10:00,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:00,583 INFO L225 Difference]: With dead ends: 38 [2024-09-11 20:10:00,584 INFO L226 Difference]: Without dead ends: 36 [2024-09-11 20:10:00,584 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:10:00,585 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.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:00,585 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.1s Time] [2024-09-11 20:10:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-11 20:10:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-09-11 20:10:00,595 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:10:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-09-11 20:10:00,598 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 13 [2024-09-11 20:10:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:00,598 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-09-11 20:10:00,598 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:10:00,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-09-11 20:10:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 20:10:00,600 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:00,601 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:00,601 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:10:00,601 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:00,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1972613170, now seen corresponding path program 1 times [2024-09-11 20:10:00,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:00,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116994857] [2024-09-11 20:10:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:00,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:00,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1963133973] [2024-09-11 20:10:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:00,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:00,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:00,627 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:10:00,632 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:10:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:00,683 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 20:10:00,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:00,805 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:10:00,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:10:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116994857] [2024-09-11 20:10:00,806 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963133973] [2024-09-11 20:10:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963133973] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:00,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:00,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:10:00,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765213415] [2024-09-11 20:10:00,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:00,810 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:00,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:00,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:10:00,811 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:10:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:00,898 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2024-09-11 20:10:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:00,899 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:10:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:00,900 INFO L225 Difference]: With dead ends: 55 [2024-09-11 20:10:00,900 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 20:10:00,901 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:10:00,901 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:10:00,902 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:10:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 20:10:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-11 20:10:00,921 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:10:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-09-11 20:10:00,922 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 18 [2024-09-11 20:10:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:00,923 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-09-11 20:10:00,924 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:10:00,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-09-11 20:10:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-11 20:10:00,927 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:00,927 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:10:00,940 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 20:10:01,127 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:10:01,128 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:01,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:01,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1810344840, now seen corresponding path program 1 times [2024-09-11 20:10:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:01,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821186468] [2024-09-11 20:10:01,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:01,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2147378153] [2024-09-11 20:10:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:01,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:01,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:01,156 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:10:01,161 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:10:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:01,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-11 20:10:01,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:01,279 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:10:01,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:01,492 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:10:01,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:01,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821186468] [2024-09-11 20:10:01,492 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:01,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147378153] [2024-09-11 20:10:01,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147378153] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:01,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:10:01,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-11 20:10:01,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086808941] [2024-09-11 20:10:01,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:01,493 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:10:01,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:01,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:10:01,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:10:01,499 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:10:01,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:01,629 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2024-09-11 20:10:01,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:10:01,630 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:10:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:01,631 INFO L225 Difference]: With dead ends: 55 [2024-09-11 20:10:01,632 INFO L226 Difference]: Without dead ends: 53 [2024-09-11 20:10:01,632 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:10:01,633 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:10:01,633 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:10:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-11 20:10:01,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-09-11 20:10:01,645 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:10:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-09-11 20:10:01,648 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 25 [2024-09-11 20:10:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:01,649 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-09-11 20:10:01,649 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:10:01,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:01,649 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-09-11 20:10:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:10:01,654 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:01,654 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:10:01,677 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:10:01,855 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:10:01,855 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:01,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash -447891575, now seen corresponding path program 1 times [2024-09-11 20:10:01,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:01,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135019370] [2024-09-11 20:10:01,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:01,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:01,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [210423425] [2024-09-11 20:10:01,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:01,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:01,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:01,885 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:10:01,886 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:10:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:01,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-11 20:10:01,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:02,040 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:10:02,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:02,113 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:10:02,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:02,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135019370] [2024-09-11 20:10:02,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:02,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210423425] [2024-09-11 20:10:02,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210423425] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:02,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:10:02,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-11 20:10:02,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713129549] [2024-09-11 20:10:02,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:02,115 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:02,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:02,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:10:02,116 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:10:03,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-11 20:10:03,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:03,664 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2024-09-11 20:10:03,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:03,664 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:10:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:03,667 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:10:03,669 INFO L226 Difference]: Without dead ends: 60 [2024-09-11 20:10:03,669 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:10:03,670 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.5s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:03,670 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.5s Time] [2024-09-11 20:10:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-11 20:10:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2024-09-11 20:10:03,696 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:10:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-09-11 20:10:03,701 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 35 [2024-09-11 20:10:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:03,701 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-09-11 20:10:03,701 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:10:03,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-09-11 20:10:03,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-11 20:10:03,702 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:03,703 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:10:03,718 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:10:03,903 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:10:03,903 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:03,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1669992559, now seen corresponding path program 1 times [2024-09-11 20:10:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:03,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939046854] [2024-09-11 20:10:03,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:03,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:04,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:10:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:04,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:10:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:04,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:10:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:04,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:10:04,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:04,121 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:10:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:04,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-11 20:10:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:04,134 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:10:04,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:04,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939046854] [2024-09-11 20:10:04,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939046854] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:04,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:10:04,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:10:04,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919147972] [2024-09-11 20:10:04,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:04,137 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:04,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:04,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:10:04,139 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:10:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:04,204 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2024-09-11 20:10:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:04,204 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:10:04,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:04,206 INFO L225 Difference]: With dead ends: 67 [2024-09-11 20:10:04,206 INFO L226 Difference]: Without dead ends: 55 [2024-09-11 20:10:04,206 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:10:04,207 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:10:04,207 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:10:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-11 20:10:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-09-11 20:10:04,230 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:10:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2024-09-11 20:10:04,231 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 41 [2024-09-11 20:10:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:04,231 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2024-09-11 20:10:04,232 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:10:04,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2024-09-11 20:10:04,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-11 20:10:04,236 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:04,236 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:10:04,237 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-11 20:10:04,237 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:04,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:04,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1460518785, now seen corresponding path program 1 times [2024-09-11 20:10:04,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:04,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023504621] [2024-09-11 20:10:04,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:04,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:04,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038230109] [2024-09-11 20:10:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:04,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:04,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:04,279 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:10:04,280 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:10:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:04,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-11 20:10:04,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:04,659 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:10:04,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:06,011 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:10:06,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023504621] [2024-09-11 20:10:06,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:06,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038230109] [2024-09-11 20:10:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038230109] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:06,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:10:06,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-09-11 20:10:06,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252844004] [2024-09-11 20:10:06,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:06,013 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:10:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:06,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:10:06,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:10:06,017 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:10:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:06,672 INFO L93 Difference]: Finished difference Result 130 states and 175 transitions. [2024-09-11 20:10:06,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:10:06,673 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:10:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:06,674 INFO L225 Difference]: With dead ends: 130 [2024-09-11 20:10:06,674 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 20:10:06,675 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:10:06,676 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 30 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:06,676 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.3s Time] [2024-09-11 20:10:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 20:10:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-09-11 20:10:06,708 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:10:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2024-09-11 20:10:06,709 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 55 [2024-09-11 20:10:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:06,710 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2024-09-11 20:10:06,710 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:10:06,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2024-09-11 20:10:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-09-11 20:10:06,712 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:06,712 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:10:06,729 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:10:06,916 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:10:06,917 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:06,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:06,917 INFO L85 PathProgramCache]: Analyzing trace with hash -814878683, now seen corresponding path program 1 times [2024-09-11 20:10:06,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:06,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630612982] [2024-09-11 20:10:06,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:06,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:10:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056506492] [2024-09-11 20:10:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:06,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:06,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:06,969 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:10:06,975 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:10:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:07,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-11 20:10:07,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:07,271 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:10:07,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:07,783 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:10:07,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:07,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630612982] [2024-09-11 20:10:07,784 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:10:07,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056506492] [2024-09-11 20:10:07,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056506492] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:07,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:10:07,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2024-09-11 20:10:07,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950190246] [2024-09-11 20:10:07,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:07,785 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-11 20:10:07,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:07,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-11 20:10:07,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:10:07,786 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:10:08,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:08,419 INFO L93 Difference]: Finished difference Result 160 states and 213 transitions. [2024-09-11 20:10:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:10:08,420 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:10:08,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:08,421 INFO L225 Difference]: With dead ends: 160 [2024-09-11 20:10:08,421 INFO L226 Difference]: Without dead ends: 128 [2024-09-11 20:10:08,422 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:10:08,423 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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:10:08,423 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:10:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-09-11 20:10:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 102. [2024-09-11 20:10:08,450 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:10:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2024-09-11 20:10:08,452 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 128 transitions. Word has length 66 [2024-09-11 20:10:08,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:08,452 INFO L474 AbstractCegarLoop]: Abstraction has 102 states and 128 transitions. [2024-09-11 20:10:08,452 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:10:08,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:08,453 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 128 transitions. [2024-09-11 20:10:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-09-11 20:10:08,454 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:08,454 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:10:08,470 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 20:10:08,658 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:10:08,659 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:08,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:08,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1180146986, now seen corresponding path program 1 times [2024-09-11 20:10:08,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:08,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107203898] [2024-09-11 20:10:08,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:08,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:10:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:10:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:10:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:10:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:10:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:10:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:10:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:10:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,879 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-11 20:10:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-11 20:10:08,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,890 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-11 20:10:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,892 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:10:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107203898] [2024-09-11 20:10:08,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107203898] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:08,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175817742] [2024-09-11 20:10:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:08,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:08,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:08,895 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:10:08,897 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:10:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:08,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:10:08,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:09,095 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:10:09,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:10:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175817742] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:09,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:10:09,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-09-11 20:10:09,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346462341] [2024-09-11 20:10:09,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:09,096 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:10:09,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:09,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:10:09,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:10:09,097 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:10:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:09,178 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2024-09-11 20:10:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:10:09,179 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:10:09,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:09,180 INFO L225 Difference]: With dead ends: 139 [2024-09-11 20:10:09,180 INFO L226 Difference]: Without dead ends: 95 [2024-09-11 20:10:09,181 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:10:09,181 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.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:09,182 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.0s Time] [2024-09-11 20:10:09,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-11 20:10:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-09-11 20:10:09,222 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:10:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2024-09-11 20:10:09,223 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 71 [2024-09-11 20:10:09,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:09,223 INFO L474 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2024-09-11 20:10:09,223 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:10:09,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2024-09-11 20:10:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-09-11 20:10:09,225 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:09,225 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:10:09,246 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:10:09,425 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:10:09,426 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:09,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:09,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1399001704, now seen corresponding path program 1 times [2024-09-11 20:10:09,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:09,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124314048] [2024-09-11 20:10:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:09,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:09,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:10:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:09,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:10:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:09,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:10:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:10,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:10:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:10,013 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:10:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:10,021 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:10:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:10,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:10:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:10,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:10:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:10,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-09-11 20:10:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:10,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-11 20:10:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:10,054 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-09-11 20:10:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:10,058 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:10:10,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:10,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124314048] [2024-09-11 20:10:10,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124314048] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:10,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053112548] [2024-09-11 20:10:10,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:10,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:10,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:10,061 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:10:10,062 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:10:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:10,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-11 20:10:10,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:10,295 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:10:10,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:10:10,657 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:10:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053112548] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:10:10,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:10:10,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-09-11 20:10:10,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761438886] [2024-09-11 20:10:10,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:10:10,659 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:10:10,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:10,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:10:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:10:10,660 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 9 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2024-09-11 20:10:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:10,920 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2024-09-11 20:10:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:10:10,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 9 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) Word has length 71 [2024-09-11 20:10:10,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:10,922 INFO L225 Difference]: With dead ends: 109 [2024-09-11 20:10:10,922 INFO L226 Difference]: Without dead ends: 78 [2024-09-11 20:10:10,923 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:10:10,923 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:10,923 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 233 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:10:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-11 20:10:10,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-09-11 20:10:10,945 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:10:10,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-09-11 20:10:10,946 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 71 [2024-09-11 20:10:10,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:10,946 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-09-11 20:10:10,946 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 13 states have internal predecessors, (40), 9 states have call successors, (35), 3 states have call predecessors, (35), 1 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2024-09-11 20:10:10,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-09-11 20:10:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-09-11 20:10:10,947 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:10:10,947 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:10:10,966 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:10:11,148 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:10:11,148 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:10:11,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:11,149 INFO L85 PathProgramCache]: Analyzing trace with hash -376584808, now seen corresponding path program 2 times [2024-09-11 20:10:11,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:10:11,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885868251] [2024-09-11 20:10:11,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:10:11,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:10:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,324 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:10:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 20:10:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-11 20:10:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-11 20:10:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-11 20:10:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,356 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 20:10:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:10:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-11 20:10:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-11 20:10:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:10:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 20:10:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 20:10:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-09-11 20:10:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:10:11,377 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2024-09-11 20:10:11,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:10:11,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885868251] [2024-09-11 20:10:11,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885868251] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:10:11,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209569432] [2024-09-11 20:10:11,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:10:11,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:10:11,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:10:11,379 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:10:11,382 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:10:11,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:10:11,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:10:11,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:10:11,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:10:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-09-11 20:10:11,527 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:10:11,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209569432] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:10:11,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:10:11,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2024-09-11 20:10:11,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950844923] [2024-09-11 20:10:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:10:11,528 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:10:11,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:10:11,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:10:11,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:10:11,532 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-11 20:10:11,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:10:11,578 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-09-11 20:10:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:10:11,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 85 [2024-09-11 20:10:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:10:11,580 INFO L225 Difference]: With dead ends: 78 [2024-09-11 20:10:11,580 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:10:11,580 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:10:11,581 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:10:11,581 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:10:11,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:10:11,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:10:11,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:10:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:10:11,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-09-11 20:10:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:10:11,583 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:10:11,583 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-11 20:10:11,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:10:11,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:10:11,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:10:11,586 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:10:11,603 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:10:11,790 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:10:11,793 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:10:11,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:10:12,674 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:10:12,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:10:12 BoogieIcfgContainer [2024-09-11 20:10:12,697 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:10:12,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:10:12,698 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:10:12,698 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:10:12,698 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:09:59" (3/4) ... [2024-09-11 20:10:12,701 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:10:12,705 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 20:10:12,710 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-09-11 20:10:12,710 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-09-11 20:10:12,711 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 20:10:12,711 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:10:12,711 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:10:12,807 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:10:12,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:10:12,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:10:12,809 INFO L158 Benchmark]: Toolchain (without parser) took 13876.71ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 117.5MB in the beginning and 143.9MB in the end (delta: -26.5MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2024-09-11 20:10:12,809 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:10:12,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.25ms. Allocated memory is still 144.7MB. Free memory was 117.5MB in the beginning and 105.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:10:12,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.49ms. Allocated memory is still 144.7MB. Free memory was 105.9MB in the beginning and 104.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:10:12,810 INFO L158 Benchmark]: Boogie Preprocessor took 44.17ms. Allocated memory is still 144.7MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:10:12,810 INFO L158 Benchmark]: RCFGBuilder took 371.27ms. Allocated memory is still 144.7MB. Free memory was 102.3MB in the beginning and 89.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:10:12,810 INFO L158 Benchmark]: TraceAbstraction took 13071.21ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 89.2MB in the beginning and 149.1MB in the end (delta: -59.9MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. [2024-09-11 20:10:12,810 INFO L158 Benchmark]: Witness Printer took 110.49ms. Allocated memory is still 209.7MB. Free memory was 148.1MB in the beginning and 143.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:10:12,812 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.25ms. Allocated memory is still 144.7MB. Free memory was 117.5MB in the beginning and 105.9MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.49ms. Allocated memory is still 144.7MB. Free memory was 105.9MB in the beginning and 104.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.17ms. Allocated memory is still 144.7MB. Free memory was 104.4MB in the beginning and 102.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.27ms. Allocated memory is still 144.7MB. Free memory was 102.3MB in the beginning and 89.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13071.21ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 89.2MB in the beginning and 149.1MB in the end (delta: -59.9MB). Peak memory consumption was 97.7MB. Max. memory is 16.1GB. * Witness Printer took 110.49ms. Allocated memory is still 209.7MB. Free memory was 148.1MB in the beginning and 143.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.1s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 1249 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 953 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1077 IncrementalHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 296 mSDtfsCounter, 1077 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 807 GetRequests, 701 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=8, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 922 NumberOfCodeBlocks, 922 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 955 ConstructedInterpolants, 0 QuantifiedInterpolants, 5261 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1185 ConjunctsInSsa, 139 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 2724/2893 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (((((((d == 1) && (p == 1)) && (q == 1)) && (((long long) r + 1) == A)) && (B == 1)) || (((((d == 1) && (p == 1)) && (q == 0)) && (A == r)) && (B == 1))) || ((((((2 == p) && (q == 0)) && (A == r)) && (r == 1)) && (B == 1)) && (2 == d))) - InvariantResult [Line: 59]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((d == 1) && (p == 1)) && (A <= 1)) && (q == 0)) && (A == r)) && (B == 1)) && (0 <= A)) || ((((((2 == p) && (q == 0)) && (A == r)) && (r == 1)) && (B == 1)) && (2 == d))) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:10:12,836 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE