./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gr2006.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 27b49876 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/loop-lit/gr2006.i -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ef045eb54c58e8ecfe4972142a43378e1f3b08091dc3d5b7e399cf5703f1724 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-27b4987-m [2024-09-21 11:25:18,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 11:25:18,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-21 11:25:18,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 11:25:18,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 11:25:18,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 11:25:18,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 11:25:18,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 11:25:18,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 11:25:18,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 11:25:18,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 11:25:18,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 11:25:18,110 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 11:25:18,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 11:25:18,110 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 11:25:18,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 11:25:18,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 11:25:18,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 11:25:18,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-21 11:25:18,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 11:25:18,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 11:25:18,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 11:25:18,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 11:25:18,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 11:25:18,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 11:25:18,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 11:25:18,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 11:25:18,116 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 11:25:18,116 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 11:25:18,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 11:25:18,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 11:25:18,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 11:25:18,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:25:18,119 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 11:25:18,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 11:25:18,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 11:25:18,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-21 11:25:18,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-21 11:25:18,120 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 11:25:18,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 11:25:18,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 11:25:18,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 11:25:18,122 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 -> 3ef045eb54c58e8ecfe4972142a43378e1f3b08091dc3d5b7e399cf5703f1724 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-21 11:25:18,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 11:25:18,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 11:25:18,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 11:25:18,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 11:25:18,405 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 11:25:18,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/gr2006.i [2024-09-21 11:25:19,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 11:25:19,977 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 11:25:19,979 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gr2006.i [2024-09-21 11:25:19,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e3fc61890/0fd83adba2924ecf9f044c120d0fdb27/FLAG831168a71 [2024-09-21 11:25:20,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e3fc61890/0fd83adba2924ecf9f044c120d0fdb27 [2024-09-21 11:25:20,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 11:25:20,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 11:25:20,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 11:25:20,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 11:25:20,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 11:25:20,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ba57dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20, skipping insertion in model container [2024-09-21 11:25:20,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 11:25:20,547 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gr2006.i[895,908] [2024-09-21 11:25:20,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:25:20,564 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 11:25:20,575 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/gr2006.i[895,908] [2024-09-21 11:25:20,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:25:20,589 INFO L204 MainTranslator]: Completed translation [2024-09-21 11:25:20,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20 WrapperNode [2024-09-21 11:25:20,590 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 11:25:20,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 11:25:20,591 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 11:25:20,591 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 11:25:20,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,607 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 11:25:20,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 11:25:20,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 11:25:20,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 11:25:20,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 11:25:20,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,628 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-21 11:25:20,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,633 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 11:25:20,640 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 11:25:20,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 11:25:20,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 11:25:20,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (1/1) ... [2024-09-21 11:25:20,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:25:20,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:20,668 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-21 11:25:20,670 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-21 11:25:20,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 11:25:20,706 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 11:25:20,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 11:25:20,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-21 11:25:20,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 11:25:20,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 11:25:20,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 11:25:20,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 11:25:20,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-21 11:25:20,707 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-21 11:25:20,772 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 11:25:20,773 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 11:25:20,857 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-21 11:25:20,857 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 11:25:20,874 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 11:25:20,874 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-21 11:25:20,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:25:20 BoogieIcfgContainer [2024-09-21 11:25:20,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 11:25:20,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 11:25:20,878 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 11:25:20,881 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 11:25:20,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 11:25:20" (1/3) ... [2024-09-21 11:25:20,882 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fceaeda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:25:20, skipping insertion in model container [2024-09-21 11:25:20,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:25:20" (2/3) ... [2024-09-21 11:25:20,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fceaeda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:25:20, skipping insertion in model container [2024-09-21 11:25:20,883 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:25:20" (3/3) ... [2024-09-21 11:25:20,885 INFO L112 eAbstractionObserver]: Analyzing ICFG gr2006.i [2024-09-21 11:25:20,900 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 11:25:20,901 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 11:25:20,950 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 11:25:20,956 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;@37a0657e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 11:25:20,956 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 11:25:20,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-21 11:25:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-21 11:25:20,968 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:20,968 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:20,969 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:20,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:20,975 INFO L85 PathProgramCache]: Analyzing trace with hash 798663313, now seen corresponding path program 1 times [2024-09-21 11:25:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:20,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548158728] [2024-09-21 11:25:20,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:20,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:21,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:21,138 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-21 11:25:21,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:21,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548158728] [2024-09-21 11:25:21,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548158728] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:25:21,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:25:21,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-21 11:25:21,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190478854] [2024-09-21 11:25:21,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:21,146 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-21 11:25:21,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:21,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-21 11:25:21,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-21 11:25:21,171 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:21,195 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-09-21 11:25:21,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-21 11:25:21,197 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-21 11:25:21,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:21,202 INFO L225 Difference]: With dead ends: 30 [2024-09-21 11:25:21,202 INFO L226 Difference]: Without dead ends: 13 [2024-09-21 11:25:21,206 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-21 11:25:21,211 INFO L434 NwaCegarLoop]: 18 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, 18 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-21 11:25:21,212 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-09-21 11:25:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-09-21 11:25:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-09-21 11:25:21,243 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2024-09-21 11:25:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:21,244 INFO L474 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-09-21 11:25:21,244 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-09-21 11:25:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-21 11:25:21,245 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:21,246 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:21,246 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-21 11:25:21,247 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:21,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:21,248 INFO L85 PathProgramCache]: Analyzing trace with hash -803180566, now seen corresponding path program 1 times [2024-09-21 11:25:21,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:21,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328774478] [2024-09-21 11:25:21,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:21,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:21,379 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:21,410 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-21 11:25:21,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:21,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328774478] [2024-09-21 11:25:21,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328774478] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:25:21,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:25:21,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-21 11:25:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773208221] [2024-09-21 11:25:21,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:21,416 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-21 11:25:21,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:21,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-21 11:25:21,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-21 11:25:21,419 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:21,468 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-09-21 11:25:21,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-21 11:25:21,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-21 11:25:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:21,470 INFO L225 Difference]: With dead ends: 23 [2024-09-21 11:25:21,470 INFO L226 Difference]: Without dead ends: 18 [2024-09-21 11:25:21,471 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-21 11:25:21,473 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:21,473 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 27 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-21 11:25:21,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2024-09-21 11:25:21,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-09-21 11:25:21,478 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2024-09-21 11:25:21,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:21,479 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-09-21 11:25:21,479 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-09-21 11:25:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-21 11:25:21,483 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:21,483 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:21,484 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-21 11:25:21,485 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:21,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:21,485 INFO L85 PathProgramCache]: Analyzing trace with hash -745922264, now seen corresponding path program 1 times [2024-09-21 11:25:21,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:21,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790159203] [2024-09-21 11:25:21,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:21,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:21,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:21,571 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-21 11:25:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790159203] [2024-09-21 11:25:21,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790159203] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:25:21,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:25:21,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-21 11:25:21,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968480733] [2024-09-21 11:25:21,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:21,573 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-21 11:25:21,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:21,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-21 11:25:21,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 11:25:21,574 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:21,588 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-21 11:25:21,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-21 11:25:21,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-21 11:25:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:21,590 INFO L225 Difference]: With dead ends: 27 [2024-09-21 11:25:21,590 INFO L226 Difference]: Without dead ends: 19 [2024-09-21 11:25:21,590 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 11:25:21,591 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:21,592 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 20 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-21 11:25:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-09-21 11:25:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-09-21 11:25:21,597 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2024-09-21 11:25:21,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:21,597 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-09-21 11:25:21,598 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-09-21 11:25:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-21 11:25:21,602 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:21,602 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:21,602 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-21 11:25:21,603 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:21,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash -704564148, now seen corresponding path program 1 times [2024-09-21 11:25:21,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:21,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978498194] [2024-09-21 11:25:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:21,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:21,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:21,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978498194] [2024-09-21 11:25:21,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978498194] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:21,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281338551] [2024-09-21 11:25:21,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:21,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:21,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:21,663 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-21 11:25:21,665 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-21 11:25:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:21,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-21 11:25:21,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:21,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:21,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:21,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281338551] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:21,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:21,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-21 11:25:21,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052017727] [2024-09-21 11:25:21,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:21,818 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-21 11:25:21,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:21,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-21 11:25:21,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:25:21,819 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:21,853 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-09-21 11:25:21,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 11:25:21,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-21 11:25:21,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:21,855 INFO L225 Difference]: With dead ends: 37 [2024-09-21 11:25:21,856 INFO L226 Difference]: Without dead ends: 29 [2024-09-21 11:25:21,856 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:25:21,857 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:21,857 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-21 11:25:21,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-21 11:25:21,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2024-09-21 11:25:21,865 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2024-09-21 11:25:21,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:21,865 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2024-09-21 11:25:21,865 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:21,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:21,866 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2024-09-21 11:25:21,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-21 11:25:21,867 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:21,867 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:21,883 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-21 11:25:22,069 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-21 11:25:22,069 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:22,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash -369296344, now seen corresponding path program 2 times [2024-09-21 11:25:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:22,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009802577] [2024-09-21 11:25:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:22,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:22,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009802577] [2024-09-21 11:25:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009802577] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:22,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905435353] [2024-09-21 11:25:22,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-21 11:25:22,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:22,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:22,231 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 11:25:22,231 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-21 11:25:22,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-21 11:25:22,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:25:22,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-21 11:25:22,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:22,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:22,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:22,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905435353] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:22,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:22,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-21 11:25:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785295793] [2024-09-21 11:25:22,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:22,417 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-21 11:25:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:22,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-21 11:25:22,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-21 11:25:22,421 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:22,479 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-09-21 11:25:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-21 11:25:22,481 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-09-21 11:25:22,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:22,482 INFO L225 Difference]: With dead ends: 55 [2024-09-21 11:25:22,482 INFO L226 Difference]: Without dead ends: 47 [2024-09-21 11:25:22,483 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-09-21 11:25:22,484 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:22,484 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-21 11:25:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2024-09-21 11:25:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:22,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2024-09-21 11:25:22,502 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 24 [2024-09-21 11:25:22,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:22,502 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2024-09-21 11:25:22,502 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:22,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:22,502 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2024-09-21 11:25:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-21 11:25:22,506 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:22,506 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:22,523 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-21 11:25:22,706 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-21 11:25:22,707 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:22,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:22,707 INFO L85 PathProgramCache]: Analyzing trace with hash -2112727896, now seen corresponding path program 3 times [2024-09-21 11:25:22,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:22,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671096195] [2024-09-21 11:25:22,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:22,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:22,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 10 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:22,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:22,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671096195] [2024-09-21 11:25:22,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671096195] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:22,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851092433] [2024-09-21 11:25:22,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-21 11:25:22,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:22,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:22,972 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-21 11:25:22,974 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-21 11:25:23,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-21 11:25:23,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:25:23,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-21 11:25:23,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-09-21 11:25:23,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-09-21 11:25:23,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851092433] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:23,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:23,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 15 [2024-09-21 11:25:23,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233924378] [2024-09-21 11:25:23,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:23,102 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-21 11:25:23,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:23,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-21 11:25:23,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2024-09-21 11:25:23,103 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:23,263 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2024-09-21 11:25:23,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-21 11:25:23,264 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2024-09-21 11:25:23,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:23,265 INFO L225 Difference]: With dead ends: 61 [2024-09-21 11:25:23,267 INFO L226 Difference]: Without dead ends: 53 [2024-09-21 11:25:23,267 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2024-09-21 11:25:23,268 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:23,270 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:23,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-09-21 11:25:23,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2024-09-21 11:25:23,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:23,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2024-09-21 11:25:23,286 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 42 [2024-09-21 11:25:23,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:23,287 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2024-09-21 11:25:23,287 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:23,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:23,288 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2024-09-21 11:25:23,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-21 11:25:23,289 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:23,289 INFO L216 NwaCegarLoop]: trace histogram [13, 12, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:23,301 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-21 11:25:23,489 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-21 11:25:23,490 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:23,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash -690352086, now seen corresponding path program 4 times [2024-09-21 11:25:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:23,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439522329] [2024-09-21 11:25:23,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:23,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:23,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 46 proven. 187 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 11:25:23,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439522329] [2024-09-21 11:25:23,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439522329] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:23,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394465500] [2024-09-21 11:25:23,716 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-21 11:25:23,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:23,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:23,717 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-21 11:25:23,719 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-21 11:25:23,773 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-21 11:25:23,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:25:23,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-21 11:25:23,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 46 proven. 187 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 11:25:23,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 46 proven. 187 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 11:25:24,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394465500] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:24,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:24,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2024-09-21 11:25:24,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545700392] [2024-09-21 11:25:24,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:24,174 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-21 11:25:24,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-21 11:25:24,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2024-09-21 11:25:24,176 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:24,286 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2024-09-21 11:25:24,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-21 11:25:24,290 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-09-21 11:25:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:24,291 INFO L225 Difference]: With dead ends: 100 [2024-09-21 11:25:24,291 INFO L226 Difference]: Without dead ends: 88 [2024-09-21 11:25:24,292 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2024-09-21 11:25:24,292 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:24,293 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 67 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 11:25:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-21 11:25:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-21 11:25:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.036144578313253) internal successors, (86), 83 states have internal predecessors, (86), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2024-09-21 11:25:24,316 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 48 [2024-09-21 11:25:24,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:24,316 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2024-09-21 11:25:24,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.111111111111111) internal successors, (84), 27 states have internal predecessors, (84), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:24,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2024-09-21 11:25:24,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-21 11:25:24,319 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:24,319 INFO L216 NwaCegarLoop]: trace histogram [26, 25, 24, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:24,335 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-21 11:25:24,522 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:24,523 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:24,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:24,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2106249138, now seen corresponding path program 5 times [2024-09-21 11:25:24,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:24,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318589928] [2024-09-21 11:25:24,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:24,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:25,161 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 98 proven. 876 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 11:25:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318589928] [2024-09-21 11:25:25,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318589928] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:25,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364954125] [2024-09-21 11:25:25,167 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-21 11:25:25,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:25,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:25,169 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-21 11:25:25,170 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-21 11:25:25,242 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2024-09-21 11:25:25,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:25:25,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-21 11:25:25,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:25,362 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 98 proven. 876 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 11:25:25,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 98 proven. 876 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 11:25:26,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364954125] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:26,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2024-09-21 11:25:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155922794] [2024-09-21 11:25:26,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:26,293 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-09-21 11:25:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-09-21 11:25:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2024-09-21 11:25:26,296 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand has 53 states, 53 states have (on average 3.056603773584906) internal successors, (162), 53 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:26,460 INFO L93 Difference]: Finished difference Result 178 states and 208 transitions. [2024-09-21 11:25:26,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-09-21 11:25:26,461 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.056603773584906) internal successors, (162), 53 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2024-09-21 11:25:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:26,462 INFO L225 Difference]: With dead ends: 178 [2024-09-21 11:25:26,463 INFO L226 Difference]: Without dead ends: 166 [2024-09-21 11:25:26,464 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2024-09-21 11:25:26,464 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:26,465 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 125 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 11:25:26,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-09-21 11:25:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-09-21 11:25:26,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.0186335403726707) internal successors, (164), 161 states have internal predecessors, (164), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2024-09-21 11:25:26,490 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 87 [2024-09-21 11:25:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:26,490 INFO L474 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2024-09-21 11:25:26,491 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.056603773584906) internal successors, (162), 53 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:26,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2024-09-21 11:25:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-09-21 11:25:26,497 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:26,497 INFO L216 NwaCegarLoop]: trace histogram [52, 51, 50, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:26,513 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-21 11:25:26,700 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-21 11:25:26,701 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:26,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash -751902514, now seen corresponding path program 6 times [2024-09-21 11:25:26,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:26,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328710343] [2024-09-21 11:25:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:26,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:26,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:26,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 585 proven. 6 refuted. 0 times theorem prover too weak. 3387 trivial. 0 not checked. [2024-09-21 11:25:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328710343] [2024-09-21 11:25:26,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328710343] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:26,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733526844] [2024-09-21 11:25:26,902 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-21 11:25:26,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:26,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:26,904 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-21 11:25:26,905 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-21 11:25:26,966 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-09-21 11:25:26,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:25:26,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-21 11:25:26,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 585 proven. 6 refuted. 0 times theorem prover too weak. 3387 trivial. 0 not checked. [2024-09-21 11:25:26,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:27,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3978 backedges. 585 proven. 6 refuted. 0 times theorem prover too weak. 3387 trivial. 0 not checked. [2024-09-21 11:25:27,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733526844] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:27,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:27,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-09-21 11:25:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41088471] [2024-09-21 11:25:27,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:27,038 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-21 11:25:27,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:27,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-21 11:25:27,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-21 11:25:27,039 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:27,067 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2024-09-21 11:25:27,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-21 11:25:27,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 165 [2024-09-21 11:25:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:27,071 INFO L225 Difference]: With dead ends: 178 [2024-09-21 11:25:27,071 INFO L226 Difference]: Without dead ends: 173 [2024-09-21 11:25:27,072 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 331 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-21 11:25:27,072 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:27,073 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:25:27,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-09-21 11:25:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2024-09-21 11:25:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 164 states have (on average 1.024390243902439) internal successors, (168), 164 states have internal predecessors, (168), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 172 transitions. [2024-09-21 11:25:27,091 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 172 transitions. Word has length 165 [2024-09-21 11:25:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:27,092 INFO L474 AbstractCegarLoop]: Abstraction has 169 states and 172 transitions. [2024-09-21 11:25:27,092 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:27,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 172 transitions. [2024-09-21 11:25:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-09-21 11:25:27,096 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:27,097 INFO L216 NwaCegarLoop]: trace histogram [53, 52, 50, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:27,114 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-21 11:25:27,297 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:27,297 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:27,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2088474392, now seen corresponding path program 7 times [2024-09-21 11:25:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:27,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864031313] [2024-09-21 11:25:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:27,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 868 proven. 17 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2024-09-21 11:25:27,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:27,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864031313] [2024-09-21 11:25:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864031313] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:27,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844598994] [2024-09-21 11:25:27,474 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-21 11:25:27,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:27,476 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-21 11:25:27,478 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-21 11:25:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:27,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-09-21 11:25:27,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 4110 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-21 11:25:28,876 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4134 backedges. 4110 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-21 11:25:30,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844598994] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:30,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:30,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 53, 53] total 100 [2024-09-21 11:25:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165141121] [2024-09-21 11:25:30,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:30,158 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2024-09-21 11:25:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:30,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2024-09-21 11:25:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2024-09-21 11:25:30,164 INFO L87 Difference]: Start difference. First operand 169 states and 172 transitions. Second operand has 100 states, 100 states have (on average 3.11) internal successors, (311), 100 states have internal predecessors, (311), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:30,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:30,801 INFO L93 Difference]: Finished difference Result 654 states and 848 transitions. [2024-09-21 11:25:30,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-09-21 11:25:30,802 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 3.11) internal successors, (311), 100 states have internal predecessors, (311), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 168 [2024-09-21 11:25:30,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:30,805 INFO L225 Difference]: With dead ends: 654 [2024-09-21 11:25:30,805 INFO L226 Difference]: Without dead ends: 649 [2024-09-21 11:25:30,807 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 242 SyntacticMatches, 6 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4991 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2024-09-21 11:25:30,808 INFO L434 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:30,808 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-21 11:25:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-09-21 11:25:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 313. [2024-09-21 11:25:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 308 states have (on average 1.1688311688311688) internal successors, (360), 308 states have internal predecessors, (360), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 364 transitions. [2024-09-21 11:25:30,850 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 364 transitions. Word has length 168 [2024-09-21 11:25:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:30,851 INFO L474 AbstractCegarLoop]: Abstraction has 313 states and 364 transitions. [2024-09-21 11:25:30,851 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 3.11) internal successors, (311), 100 states have internal predecessors, (311), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:30,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 364 transitions. [2024-09-21 11:25:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-09-21 11:25:30,855 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:30,856 INFO L216 NwaCegarLoop]: trace histogram [101, 100, 51, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:30,872 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-21 11:25:31,056 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:31,057 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:31,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 532070120, now seen corresponding path program 8 times [2024-09-21 11:25:31,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:31,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021696763] [2024-09-21 11:25:31,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:36,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:36,442 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:36,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:36,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021696763] [2024-09-21 11:25:36,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021696763] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:36,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073636937] [2024-09-21 11:25:36,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-21 11:25:36,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:36,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:36,445 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-21 11:25:36,446 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-21 11:25:36,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-21 11:25:36,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:25:36,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 155 conjuncts are in the unsatisfiable core [2024-09-21 11:25:36,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:37,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:37,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:38,740 INFO L134 CoverageAnalysis]: Checked inductivity of 15150 backedges. 0 proven. 15150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:25:38,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073636937] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:38,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:38,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 109 [2024-09-21 11:25:38,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751814132] [2024-09-21 11:25:38,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:38,742 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2024-09-21 11:25:38,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:38,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2024-09-21 11:25:38,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1544, Invalid=10228, Unknown=0, NotChecked=0, Total=11772 [2024-09-21 11:25:38,746 INFO L87 Difference]: Start difference. First operand 313 states and 364 transitions. Second operand has 109 states, 109 states have (on average 2.8807339449541285) internal successors, (314), 107 states have internal predecessors, (314), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:41,239 INFO L93 Difference]: Finished difference Result 4398 states and 5825 transitions. [2024-09-21 11:25:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-09-21 11:25:41,240 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 2.8807339449541285) internal successors, (314), 107 states have internal predecessors, (314), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 312 [2024-09-21 11:25:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:41,256 INFO L225 Difference]: With dead ends: 4398 [2024-09-21 11:25:41,257 INFO L226 Difference]: Without dead ends: 4236 [2024-09-21 11:25:41,262 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 571 SyntacticMatches, 53 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4442 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1550, Invalid=10440, Unknown=0, NotChecked=0, Total=11990 [2024-09-21 11:25:41,263 INFO L434 NwaCegarLoop]: 157 mSDtfsCounter, 52 mSDsluCounter, 8636 mSDsCounter, 0 mSdLazyCounter, 6144 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 8793 SdHoareTripleChecker+Invalid, 6197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 6144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:41,263 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 8793 Invalid, 6197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 6144 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-09-21 11:25:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4236 states. [2024-09-21 11:25:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4236 to 4187. [2024-09-21 11:25:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4187 states, 4182 states have (on average 1.0241511238641798) internal successors, (4283), 4182 states have internal predecessors, (4283), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4187 states to 4187 states and 4287 transitions. [2024-09-21 11:25:41,670 INFO L78 Accepts]: Start accepts. Automaton has 4187 states and 4287 transitions. Word has length 312 [2024-09-21 11:25:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:41,671 INFO L474 AbstractCegarLoop]: Abstraction has 4187 states and 4287 transitions. [2024-09-21 11:25:41,671 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 2.8807339449541285) internal successors, (314), 107 states have internal predecessors, (314), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:41,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4187 states and 4287 transitions. [2024-09-21 11:25:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-09-21 11:25:41,675 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:41,676 INFO L216 NwaCegarLoop]: trace histogram [102, 101, 52, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:41,694 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-21 11:25:41,880 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:41,881 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:41,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2056494222, now seen corresponding path program 9 times [2024-09-21 11:25:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:41,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725037254] [2024-09-21 11:25:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:41,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:44,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7403 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-09-21 11:25:44,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725037254] [2024-09-21 11:25:44,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725037254] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:44,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108402709] [2024-09-21 11:25:44,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-21 11:25:44,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:44,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:44,919 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 11:25:44,919 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-21 11:25:45,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2024-09-21 11:25:45,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:25:45,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 103 conjuncts are in the unsatisfiable core [2024-09-21 11:25:45,095 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-09-21 11:25:45,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:25:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15453 backedges. 7903 proven. 7401 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-09-21 11:25:47,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108402709] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:25:47,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-21 11:25:47,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 55 [2024-09-21 11:25:47,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796718534] [2024-09-21 11:25:47,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-21 11:25:47,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-09-21 11:25:47,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:47,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-09-21 11:25:47,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2024-09-21 11:25:47,430 INFO L87 Difference]: Start difference. First operand 4187 states and 4287 transitions. Second operand has 55 states, 55 states have (on average 3.909090909090909) internal successors, (215), 55 states have internal predecessors, (215), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:48,146 INFO L93 Difference]: Finished difference Result 8374 states and 8575 transitions. [2024-09-21 11:25:48,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-09-21 11:25:48,147 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.909090909090909) internal successors, (215), 55 states have internal predecessors, (215), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 315 [2024-09-21 11:25:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:48,168 INFO L225 Difference]: With dead ends: 8374 [2024-09-21 11:25:48,169 INFO L226 Difference]: Without dead ends: 4190 [2024-09-21 11:25:48,181 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 580 SyntacticMatches, 102 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3338 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1484, Invalid=1486, Unknown=0, NotChecked=0, Total=2970 [2024-09-21 11:25:48,181 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:48,182 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-21 11:25:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2024-09-21 11:25:48,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4190. [2024-09-21 11:25:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4185 states have (on average 1.0241338112305853) internal successors, (4286), 4185 states have internal predecessors, (4286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 4290 transitions. [2024-09-21 11:25:48,662 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 4290 transitions. Word has length 315 [2024-09-21 11:25:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:48,663 INFO L474 AbstractCegarLoop]: Abstraction has 4190 states and 4290 transitions. [2024-09-21 11:25:48,663 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.909090909090909) internal successors, (215), 55 states have internal predecessors, (215), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:48,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 4290 transitions. [2024-09-21 11:25:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2024-09-21 11:25:48,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:25:48,668 INFO L216 NwaCegarLoop]: trace histogram [103, 102, 52, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:25:48,686 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-21 11:25:48,868 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-21 11:25:48,868 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:25:48,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash 620457194, now seen corresponding path program 10 times [2024-09-21 11:25:48,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:25:48,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958798768] [2024-09-21 11:25:48,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:25:48,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:25:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:50,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:25:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:25:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15759 backedges. 11580 proven. 149 refuted. 0 times theorem prover too weak. 4030 trivial. 0 not checked. [2024-09-21 11:25:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:25:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958798768] [2024-09-21 11:25:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958798768] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:25:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148862814] [2024-09-21 11:25:50,617 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-21 11:25:50,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-21 11:25:50,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:25:50,620 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-21 11:25:50,621 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-21 11:25:50,745 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-21 11:25:50,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-21 11:25:50,747 INFO L262 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-09-21 11:25:50,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:25:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 15759 backedges. 11729 proven. 0 refuted. 0 times theorem prover too weak. 4030 trivial. 0 not checked. [2024-09-21 11:25:50,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-21 11:25:50,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148862814] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:25:50,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-21 11:25:50,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [53] total 54 [2024-09-21 11:25:50,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120159256] [2024-09-21 11:25:50,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:25:50,899 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-09-21 11:25:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:25:50,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-09-21 11:25:50,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2024-09-21 11:25:50,901 INFO L87 Difference]: Start difference. First operand 4190 states and 4290 transitions. Second operand has 53 states, 53 states have (on average 3.0377358490566038) internal successors, (161), 53 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:51,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:25:51,197 INFO L93 Difference]: Finished difference Result 4190 states and 4290 transitions. [2024-09-21 11:25:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-09-21 11:25:51,198 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.0377358490566038) internal successors, (161), 53 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 318 [2024-09-21 11:25:51,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:25:51,206 INFO L225 Difference]: With dead ends: 4190 [2024-09-21 11:25:51,206 INFO L226 Difference]: Without dead ends: 0 [2024-09-21 11:25:51,214 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2024-09-21 11:25:51,214 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-21 11:25:51,214 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-21 11:25:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-21 11:25:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-21 11:25:51,215 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-21 11:25:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-21 11:25:51,222 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 318 [2024-09-21 11:25:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:25:51,223 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-21 11:25:51,223 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.0377358490566038) internal successors, (161), 53 states have internal predecessors, (161), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-21 11:25:51,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:25:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-21 11:25:51,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-21 11:25:51,228 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-21 11:25:51,246 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-21 11:25:51,429 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-21 11:25:51,432 INFO L408 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2024-09-21 11:25:51,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-21 11:25:55,567 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-21 11:25:55,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 11:25:55 BoogieIcfgContainer [2024-09-21 11:25:55,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-21 11:25:55,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-21 11:25:55,599 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-21 11:25:55,599 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-21 11:25:55,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:25:20" (3/4) ... [2024-09-21 11:25:55,601 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-21 11:25:55,646 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-21 11:25:55,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-21 11:25:55,647 INFO L158 Benchmark]: Toolchain (without parser) took 35263.31ms. Allocated memory was 165.7MB in the beginning and 893.4MB in the end (delta: 727.7MB). Free memory was 96.2MB in the beginning and 360.3MB in the end (delta: -264.1MB). Peak memory consumption was 464.8MB. Max. memory is 16.1GB. [2024-09-21 11:25:55,647 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:25:55,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.30ms. Allocated memory is still 165.7MB. Free memory was 96.0MB in the beginning and 84.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-21 11:25:55,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.65ms. Allocated memory is still 165.7MB. Free memory was 84.7MB in the beginning and 83.8MB in the end (delta: 918.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:25:55,648 INFO L158 Benchmark]: Boogie Preprocessor took 31.60ms. Allocated memory is still 165.7MB. Free memory was 83.8MB in the beginning and 82.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 11:25:55,648 INFO L158 Benchmark]: RCFGBuilder took 234.61ms. Allocated memory is still 165.7MB. Free memory was 82.1MB in the beginning and 128.8MB in the end (delta: -46.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-09-21 11:25:55,648 INFO L158 Benchmark]: TraceAbstraction took 34720.62ms. Allocated memory was 165.7MB in the beginning and 893.4MB in the end (delta: 727.7MB). Free memory was 128.8MB in the beginning and 363.5MB in the end (delta: -234.7MB). Peak memory consumption was 542.2MB. Max. memory is 16.1GB. [2024-09-21 11:25:55,649 INFO L158 Benchmark]: Witness Printer took 47.72ms. Allocated memory is still 893.4MB. Free memory was 363.5MB in the beginning and 360.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-21 11:25:55,650 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.17ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.30ms. Allocated memory is still 165.7MB. Free memory was 96.0MB in the beginning and 84.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.65ms. Allocated memory is still 165.7MB. Free memory was 84.7MB in the beginning and 83.8MB in the end (delta: 918.4kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.60ms. Allocated memory is still 165.7MB. Free memory was 83.8MB in the beginning and 82.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 234.61ms. Allocated memory is still 165.7MB. Free memory was 82.1MB in the beginning and 128.8MB in the end (delta: -46.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 34720.62ms. Allocated memory was 165.7MB in the beginning and 893.4MB in the end (delta: 727.7MB). Free memory was 128.8MB in the beginning and 363.5MB in the end (delta: -234.7MB). Peak memory consumption was 542.2MB. Max. memory is 16.1GB. * Witness Printer took 47.72ms. Allocated memory is still 893.4MB. Free memory was 363.5MB in the beginning and 360.3MB in the end (delta: 3.1MB). 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: 19]: 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 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.5s, OverallIterations: 13, TraceHistogramMax: 103, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 9878 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9486 mSDsCounter, 199 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7855 IncrementalHoareTripleChecker+Invalid, 8054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 199 mSolverCounterUnsat, 392 mSDtfsCounter, 7855 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3053 GetRequests, 2452 SyntacticMatches, 167 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13139 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4190occurred in iteration=12, InterpolantAutomatonStates: 394, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 400 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 3022 NumberOfCodeBlocks, 2875 NumberOfCodeBlocksAsserted, 165 NumberOfCheckSat, 4166 ConstructedInterpolants, 0 QuantifiedInterpolants, 10326 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3283 ConjunctsInSsa, 423 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 80581/151884 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: 28]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((y == 14) && (x == 14)) || ((x == 89) && (y == 11))) || ((x == 37) && (y == 37))) || ((y == 9) && (91 == x))) || ((y == 16) && (84 == x))) || ((x == 78) && (y == 22))) || ((57 == x) && (y == 43))) || ((x == 0) && (y == 0))) || ((y == 27) && (x == 73))) || ((y == 34) && (x == 34))) || ((x == 24) && (y == 24))) || ((y == 36) && (64 == x))) || ((y == 10) && (x == 10))) || ((7 == y) && (7 == x))) || ((x == 60) && (40 == y))) || ((y == 31) && (x == 69))) || ((x == 45) && (y == 45))) || ((y == 25) && (x == 75))) || ((y == 25) && (x == 25))) || ((x == 82) && (y == 18))) || ((x == 52) && (y == 48))) || ((42 == y) && (42 == x))) || ((32 == y) && (68 == x))) || ((y == 0) && (x == 100))) || ((44 == x) && (44 == y))) || ((29 == y) && (x == 71))) || ((y == 48) && (x == 48))) || ((y == 1) && (x == 1))) || ((y == 16) && (x == 16))) || ((y == 22) && (x == 22))) || ((x == 83) && (y == 17))) || ((y == 2) && (98 == x))) || ((x == 33) && (y == 33))) || ((49 == y) && (51 == x))) || ((x == 58) && (42 == y))) || ((87 == x) && (y == 13))) || ((x == 65) && (35 == y))) || ((y == 43) && (x == 43))) || ((77 == x) && (23 == y))) || ((29 == x) && (29 == y))) || ((y == 8) && (x == 8))) || ((y == 10) && (x == 90))) || ((x == 50) && (y == 50))) || ((x == 74) && (y == 26))) || ((x == 26) && (y == 26))) || ((y == 38) && (x == 38))) || ((66 == x) && (y == 34))) || ((19 == x) && (19 == y))) || ((95 == x) && (5 == y))) || ((y == 46) && (x == 54))) || ((y == 9) && (x == 9))) || ((x == 96) && (y == 4))) || ((32 == y) && (32 == x))) || ((y == 33) && (67 == x))) || ((7 == y) && (x == 93))) || ((x == 80) && (y == 20))) || ((y == 12) && (88 == x))) || ((x == 20) && (y == 20))) || ((30 == y) && (30 == x))) || ((y == 47) && (53 == x))) || ((y == 24) && (76 == x))) || ((x == 18) && (y == 18))) || ((x == 28) && (y == 28))) || ((x == 39) && (y == 39))) || ((y == 46) && (x == 46))) || ((x == 15) && (y == 15))) || ((81 == x) && (19 == y))) || ((41 == x) && (41 == y))) || ((23 == y) && (23 == x))) || ((x == 17) && (y == 17))) || ((97 == x) && (y == 3))) || ((x == 99) && (y == 1))) || ((y == 12) && (x == 12))) || ((y == 6) && (94 == x))) || ((y == 14) && (x == 86))) || ((y == 15) && (x == 85))) || ((x == 47) && (y == 47))) || ((x == 13) && (y == 13))) || ((35 == x) && (35 == y))) || ((56 == x) && (44 == y))) || ((y == 2) && (x == 2))) || ((x == 3) && (y == 3))) || ((y == 4) && (x == 4))) || ((y == 31) && (x == 31))) || ((y == 45) && (x == 55))) || ((y == 27) && (x == 27))) || ((y == 6) && (x == 6))) || ((y == 8) && (92 == x))) || ((59 == x) && (41 == y))) || ((72 == x) && (y == 28))) || ((y == 11) && (x == 11))) || ((40 == x) && (40 == y))) || ((y == 38) && (x == 62))) || ((5 == y) && (5 == x))) || ((30 == y) && (x == 70))) || ((y == 36) && (x == 36))) || ((49 == y) && (49 == x))) || ((x == 61) && (y == 39))) || ((x == 63) && (y == 37))) || ((x == 79) && (y == 21))) || ((y == 21) && (x == 21))) - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= cond) Ensures: (1 <= cond) RESULT: Ultimate proved your program to be correct! [2024-09-21 11:25:55,675 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE