./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/mine2017-ex4.10.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/mine2017-ex4.10.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 55b5907667de8828dab419c82ab626d27191191343b82d619fed89d8923b6a77 --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:58,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 11:25:58,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-21 11:25:58,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 11:25:58,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 11:25:58,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 11:25:58,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 11:25:58,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 11:25:58,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 11:25:58,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 11:25:58,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 11:25:58,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 11:25:58,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 11:25:58,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 11:25:58,298 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 11:25:58,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 11:25:58,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 11:25:58,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 11:25:58,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-21 11:25:58,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 11:25:58,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 11:25:58,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 11:25:58,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 11:25:58,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 11:25:58,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 11:25:58,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 11:25:58,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 11:25:58,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 11:25:58,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 11:25:58,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 11:25:58,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 11:25:58,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 11:25:58,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:25:58,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 11:25:58,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 11:25:58,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 11:25:58,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-21 11:25:58,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-21 11:25:58,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 11:25:58,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 11:25:58,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 11:25:58,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 11:25:58,305 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 -> 55b5907667de8828dab419c82ab626d27191191343b82d619fed89d8923b6a77 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:58,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 11:25:58,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 11:25:58,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 11:25:58,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 11:25:58,521 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 11:25:58,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/mine2017-ex4.10.i [2024-09-21 11:25:59,717 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 11:25:59,874 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 11:25:59,874 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/mine2017-ex4.10.i [2024-09-21 11:25:59,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/122d78705/bf8947c4da6d47038333052a1d68fbf3/FLAG064c7b390 [2024-09-21 11:26:00,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/122d78705/bf8947c4da6d47038333052a1d68fbf3 [2024-09-21 11:26:00,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 11:26:00,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 11:26:00,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 11:26:00,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 11:26:00,279 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 11:26:00,280 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24126645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00, skipping insertion in model container [2024-09-21 11:26:00,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 11:26:00,407 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/mine2017-ex4.10.i[813,826] [2024-09-21 11:26:00,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:26:00,429 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 11:26:00,441 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/mine2017-ex4.10.i[813,826] [2024-09-21 11:26:00,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:26:00,456 INFO L204 MainTranslator]: Completed translation [2024-09-21 11:26:00,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00 WrapperNode [2024-09-21 11:26:00,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 11:26:00,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 11:26:00,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 11:26:00,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 11:26:00,463 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:26:00" (1/1) ... [2024-09-21 11:26:00,469 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:26:00" (1/1) ... [2024-09-21 11:26:00,474 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 11:26:00,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 11:26:00,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 11:26:00,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 11:26:00,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 11:26:00,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,492 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:26:00,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,497 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,503 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 11:26:00,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 11:26:00,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 11:26:00,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 11:26:00,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (1/1) ... [2024-09-21 11:26:00,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:26:00,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:26:00,528 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:26:00,530 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:26:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 11:26:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 11:26:00,581 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 11:26:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-21 11:26:00,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 11:26:00,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 11:26:00,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 11:26:00,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 11:26:00,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-21 11:26:00,583 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-21 11:26:00,632 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 11:26:00,634 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 11:26:00,725 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-21 11:26:00,725 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 11:26:00,738 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 11:26:00,738 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-21 11:26:00,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:26:00 BoogieIcfgContainer [2024-09-21 11:26:00,739 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 11:26:00,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 11:26:00,741 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 11:26:00,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 11:26:00,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 11:26:00" (1/3) ... [2024-09-21 11:26:00,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118854f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:26:00, skipping insertion in model container [2024-09-21 11:26:00,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:26:00" (2/3) ... [2024-09-21 11:26:00,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118854f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:26:00, skipping insertion in model container [2024-09-21 11:26:00,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:26:00" (3/3) ... [2024-09-21 11:26:00,747 INFO L112 eAbstractionObserver]: Analyzing ICFG mine2017-ex4.10.i [2024-09-21 11:26:00,758 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 11:26:00,759 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 11:26:00,807 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 11:26:00,812 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;@aa9c6d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 11:26:00,813 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 11:26:00,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-21 11:26:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-21 11:26:00,828 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:26:00,829 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:26:00,829 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:26:00,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:00,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1553068405, now seen corresponding path program 1 times [2024-09-21 11:26:00,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:26:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240231543] [2024-09-21 11:26:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:26:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:26:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:00,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:26:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:00,957 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:26:00,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:26:00,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240231543] [2024-09-21 11:26:00,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240231543] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:26:00,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:26:00,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-21 11:26:00,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783953214] [2024-09-21 11:26:00,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:26:00,963 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-21 11:26:00,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:26:00,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-21 11:26:00,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-21 11:26:00,983 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.4) internal successors, (14), 12 states have internal predecessors, (14), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:26:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:26:01,008 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2024-09-21 11:26:01,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-21 11:26:01,011 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:26:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:26:01,016 INFO L225 Difference]: With dead ends: 37 [2024-09-21 11:26:01,016 INFO L226 Difference]: Without dead ends: 17 [2024-09-21 11:26:01,019 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:26:01,022 INFO L434 NwaCegarLoop]: 22 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, 22 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:26:01,025 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:26:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-21 11:26:01,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-21 11:26:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 8 states have (on average 1.25) internal successors, (10), 10 states have internal predecessors, (10), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-21 11:26:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2024-09-21 11:26:01,054 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2024-09-21 11:26:01,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:26:01,055 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2024-09-21 11:26:01,056 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:26:01,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2024-09-21 11:26:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-21 11:26:01,057 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:26:01,057 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:26:01,057 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-21 11:26:01,058 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:26:01,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1559533052, now seen corresponding path program 1 times [2024-09-21 11:26:01,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:26:01,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442341877] [2024-09-21 11:26:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:26:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:26:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:26:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,139 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:26:01,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:26:01,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442341877] [2024-09-21 11:26:01,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442341877] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:26:01,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:26:01,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-21 11:26:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462264916] [2024-09-21 11:26:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:26:01,141 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-21 11:26:01,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:26:01,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-21 11:26:01,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 11:26:01,142 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:26:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:26:01,185 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-09-21 11:26:01,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-21 11:26:01,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:26:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:26:01,186 INFO L225 Difference]: With dead ends: 28 [2024-09-21 11:26:01,186 INFO L226 Difference]: Without dead ends: 20 [2024-09-21 11:26:01,186 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:26:01,187 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 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:26:01,187 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:26:01,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-21 11:26:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-09-21 11:26:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-21 11:26:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-09-21 11:26:01,197 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2024-09-21 11:26:01,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:26:01,197 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-09-21 11:26:01,197 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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:26:01,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-09-21 11:26:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-21 11:26:01,198 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:26:01,198 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:26:01,199 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-21 11:26:01,199 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:26:01,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1557805174, now seen corresponding path program 1 times [2024-09-21 11:26:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:26:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676240031] [2024-09-21 11:26:01,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:26:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:26:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:26:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,290 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:26:01,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:26:01,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676240031] [2024-09-21 11:26:01,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676240031] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:26:01,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:26:01,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-21 11:26:01,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877675869] [2024-09-21 11:26:01,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:26:01,295 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-21 11:26:01,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:26:01,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-21 11:26:01,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-21 11:26:01,297 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 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:26:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:26:01,351 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-09-21 11:26:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-21 11:26:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 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:26:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:26:01,352 INFO L225 Difference]: With dead ends: 24 [2024-09-21 11:26:01,352 INFO L226 Difference]: Without dead ends: 22 [2024-09-21 11:26:01,352 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-21 11:26:01,353 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:26:01,353 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 45 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:26:01,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-21 11:26:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-21 11:26:01,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-21 11:26:01,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-21 11:26:01,361 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2024-09-21 11:26:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:26:01,361 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-21 11:26:01,361 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 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:26:01,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-21 11:26:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-21 11:26:01,362 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:26:01,362 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:26:01,362 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-21 11:26:01,362 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:26:01,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash -966712542, now seen corresponding path program 1 times [2024-09-21 11:26:01,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:26:01,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478911593] [2024-09-21 11:26:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:26:01,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:26:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,441 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:26:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,444 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 11:26:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:26:01,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:26:01,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478911593] [2024-09-21 11:26:01,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478911593] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:26:01,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:26:01,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-21 11:26:01,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771197451] [2024-09-21 11:26:01,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:26:01,449 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 11:26:01,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:26:01,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 11:26:01,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-21 11:26:01,450 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 11:26:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:26:01,508 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2024-09-21 11:26:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 11:26:01,509 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-09-21 11:26:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:26:01,510 INFO L225 Difference]: With dead ends: 44 [2024-09-21 11:26:01,510 INFO L226 Difference]: Without dead ends: 36 [2024-09-21 11:26:01,511 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:26:01,511 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:26:01,512 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:26:01,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-21 11:26:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2024-09-21 11:26:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-21 11:26:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2024-09-21 11:26:01,518 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 16 [2024-09-21 11:26:01,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:26:01,518 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2024-09-21 11:26:01,519 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-21 11:26:01,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,519 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2024-09-21 11:26:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-21 11:26:01,520 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:26:01,520 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:26:01,520 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-21 11:26:01,520 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:26:01,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash -503503024, now seen corresponding path program 1 times [2024-09-21 11:26:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:26:01,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107670097] [2024-09-21 11:26:01,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:26:01,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:26:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,607 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:26:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 11:26:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,614 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-21 11:26:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-21 11:26:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-21 11:26:01,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:26:01,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107670097] [2024-09-21 11:26:01,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107670097] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:26:01,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:26:01,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-21 11:26:01,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795839160] [2024-09-21 11:26:01,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:26:01,629 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-21 11:26:01,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:26:01,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-21 11:26:01,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-21 11:26:01,630 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-21 11:26:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:26:01,673 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-09-21 11:26:01,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-21 11:26:01,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-21 11:26:01,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:26:01,674 INFO L225 Difference]: With dead ends: 40 [2024-09-21 11:26:01,674 INFO L226 Difference]: Without dead ends: 35 [2024-09-21 11:26:01,674 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:26:01,675 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:26:01,675 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 65 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:26:01,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-21 11:26:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-21 11:26:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 7 states have call successors, (7), 7 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-21 11:26:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-09-21 11:26:01,680 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 28 [2024-09-21 11:26:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:26:01,681 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-09-21 11:26:01,681 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-21 11:26:01,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-09-21 11:26:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-21 11:26:01,682 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:26:01,682 INFO L216 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:26:01,682 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-21 11:26:01,682 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:26:01,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1522970016, now seen corresponding path program 1 times [2024-09-21 11:26:01,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:26:01,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975626521] [2024-09-21 11:26:01,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:26:01,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:26:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:26:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,755 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-21 11:26:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-21 11:26:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-21 11:26:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-21 11:26:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:26:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-21 11:26:01,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:26:01,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975626521] [2024-09-21 11:26:01,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975626521] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:26:01,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:26:01,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-21 11:26:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278513139] [2024-09-21 11:26:01,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:26:01,763 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-21 11:26:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:26:01,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-21 11:26:01,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-21 11:26:01,764 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-21 11:26:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:26:01,784 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2024-09-21 11:26:01,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-21 11:26:01,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2024-09-21 11:26:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:26:01,784 INFO L225 Difference]: With dead ends: 35 [2024-09-21 11:26:01,785 INFO L226 Difference]: Without dead ends: 0 [2024-09-21 11:26:01,785 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-21 11:26:01,789 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:26:01,790 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:26:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-21 11:26:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-21 11:26:01,790 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:26:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-21 11:26:01,791 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-09-21 11:26:01,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:26:01,791 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-21 11:26:01,791 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-21 11:26:01,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:26:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-21 11:26:01,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-21 11:26:01,793 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-21 11:26:01,794 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-21 11:26:01,796 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-21 11:26:01,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-21 11:26:01,880 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-21 11:26:01,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.09 11:26:01 BoogieIcfgContainer [2024-09-21 11:26:01,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-21 11:26:01,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-21 11:26:01,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-21 11:26:01,891 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-21 11:26:01,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:26:00" (3/4) ... [2024-09-21 11:26:01,893 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-21 11:26:01,932 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-21 11:26:01,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-21 11:26:01,933 INFO L158 Benchmark]: Toolchain (without parser) took 1658.60ms. Allocated memory is still 192.9MB. Free memory was 123.7MB in the beginning and 91.4MB in the end (delta: 32.3MB). Peak memory consumption was 33.7MB. Max. memory is 16.1GB. [2024-09-21 11:26:01,933 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:26:01,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.70ms. Allocated memory is still 192.9MB. Free memory was 123.5MB in the beginning and 112.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-21 11:26:01,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.15ms. Allocated memory is still 192.9MB. Free memory was 112.4MB in the beginning and 111.4MB in the end (delta: 969.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:26:01,934 INFO L158 Benchmark]: Boogie Preprocessor took 28.04ms. Allocated memory is still 192.9MB. Free memory was 111.4MB in the beginning and 109.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 11:26:01,934 INFO L158 Benchmark]: RCFGBuilder took 235.53ms. Allocated memory is still 192.9MB. Free memory was 109.8MB in the beginning and 156.5MB in the end (delta: -46.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-09-21 11:26:01,935 INFO L158 Benchmark]: TraceAbstraction took 1150.00ms. Allocated memory is still 192.9MB. Free memory was 155.9MB in the beginning and 94.2MB in the end (delta: 61.7MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-09-21 11:26:01,936 INFO L158 Benchmark]: Witness Printer took 41.51ms. Allocated memory is still 192.9MB. Free memory was 94.1MB in the beginning and 91.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-21 11:26:01,939 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.14ms. Allocated memory is still 113.2MB. Free memory is still 74.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.70ms. Allocated memory is still 192.9MB. Free memory was 123.5MB in the beginning and 112.5MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.15ms. Allocated memory is still 192.9MB. Free memory was 112.4MB in the beginning and 111.4MB in the end (delta: 969.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.04ms. Allocated memory is still 192.9MB. Free memory was 111.4MB in the beginning and 109.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 235.53ms. Allocated memory is still 192.9MB. Free memory was 109.8MB in the beginning and 156.5MB in the end (delta: -46.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1150.00ms. Allocated memory is still 192.9MB. Free memory was 155.9MB in the beginning and 94.2MB in the end (delta: 61.7MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. * Witness Printer took 41.51ms. Allocated memory is still 192.9MB. Free memory was 94.1MB in the beginning and 91.4MB in the end (delta: 2.7MB). 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: 13]: 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 273 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 96 mSDtfsCounter, 123 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=5, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 62/62 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: 16]: Loop Invariant Derived loop invariant: ((1 <= v) && (v <= 52)) - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (cond != 0) Ensures: (cond != 0) RESULT: Ultimate proved your program to be correct! [2024-09-21 11:26:01,957 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE