./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/as2013-hybrid.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 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/as2013-hybrid.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 6f4877babf2234c4d9f84af37e06b0d1c35e333b586df80a0a3a6ac5b1b8e2d2 --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-6908dde-m [2024-09-24 23:04:06,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:04:07,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:04:07,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:04:07,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:04:07,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:04:07,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:04:07,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:04:07,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:04:07,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:04:07,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:04:07,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:04:07,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:04:07,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:04:07,101 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:04:07,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:04:07,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:04:07,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:04:07,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:04:07,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:04:07,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:04:07,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:04:07,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:04:07,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:04:07,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:04:07,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:04:07,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:04:07,108 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:04:07,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:04:07,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:04:07,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:04:07,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:04:07,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:04:07,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:04:07,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:04:07,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:04:07,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:04:07,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:04:07,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:04:07,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:04:07,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:04:07,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:04:07,113 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 -> 6f4877babf2234c4d9f84af37e06b0d1c35e333b586df80a0a3a6ac5b1b8e2d2 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-24 23:04:07,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:04:07,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:04:07,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:04:07,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:04:07,409 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:04:07,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-lit/as2013-hybrid.i [2024-09-24 23:04:08,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:04:09,018 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:04:09,018 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-lit/as2013-hybrid.i [2024-09-24 23:04:09,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/410924ce9/acdd0f1d840b4ad1b8f39860070cdee7/FLAG915961d80 [2024-09-24 23:04:09,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/410924ce9/acdd0f1d840b4ad1b8f39860070cdee7 [2024-09-24 23:04:09,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:04:09,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:04:09,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:04:09,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:04:09,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:04:09,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a0a6c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09, skipping insertion in model container [2024-09-24 23:04:09,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:04:09,232 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/as2013-hybrid.i[802,815] [2024-09-24 23:04:09,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:04:09,253 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:04:09,263 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/as2013-hybrid.i[802,815] [2024-09-24 23:04:09,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:04:09,280 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:04:09,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09 WrapperNode [2024-09-24 23:04:09,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:04:09,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:04:09,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:04:09,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:04:09,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,303 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:04:09,303 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:04:09,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:04:09,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:04:09,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:04:09,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,325 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-24 23:04:09,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:04:09,335 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:04:09,335 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:04:09,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:04:09,336 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (1/1) ... [2024-09-24 23:04:09,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:04:09,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:04:09,368 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-24 23:04:09,372 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-24 23:04:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:04:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:04:09,413 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:04:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:04:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:04:09,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:04:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:04:09,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:04:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:04:09,414 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:04:09,471 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:04:09,477 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:04:09,685 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-24 23:04:09,685 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:04:09,714 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:04:09,714 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-24 23:04:09,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:04:09 BoogieIcfgContainer [2024-09-24 23:04:09,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:04:09,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:04:09,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:04:09,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:04:09,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:04:09" (1/3) ... [2024-09-24 23:04:09,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d63f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:04:09, skipping insertion in model container [2024-09-24 23:04:09,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:04:09" (2/3) ... [2024-09-24 23:04:09,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d63f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:04:09, skipping insertion in model container [2024-09-24 23:04:09,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:04:09" (3/3) ... [2024-09-24 23:04:09,725 INFO L112 eAbstractionObserver]: Analyzing ICFG as2013-hybrid.i [2024-09-24 23:04:09,742 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:04:09,743 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:04:09,807 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:04:09,813 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;@6cba7c11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:04:09,813 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:04:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-24 23:04:09,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-24 23:04:09,826 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:04:09,827 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:04:09,827 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:04:09,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:04:09,832 INFO L85 PathProgramCache]: Analyzing trace with hash -904113193, now seen corresponding path program 1 times [2024-09-24 23:04:09,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:04:09,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728538193] [2024-09-24 23:04:09,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:04:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:04:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:04:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,149 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-24 23:04:10,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:04:10,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728538193] [2024-09-24 23:04:10,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728538193] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:04:10,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:04:10,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 23:04:10,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077643454] [2024-09-24 23:04:10,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:04:10,157 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:04:10,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:04:10,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:04:10,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:04:10,179 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-24 23:04:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:04:10,257 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2024-09-24 23:04:10,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:04:10,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2024-09-24 23:04:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:04:10,267 INFO L225 Difference]: With dead ends: 41 [2024-09-24 23:04:10,267 INFO L226 Difference]: Without dead ends: 24 [2024-09-24 23:04:10,271 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-24 23:04:10,275 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:04:10,278 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 64 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:04:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-24 23:04:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-09-24 23:04:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-24 23:04:10,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-24 23:04:10,323 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 11 [2024-09-24 23:04:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:04:10,325 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-24 23:04:10,325 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-24 23:04:10,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:04:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-24 23:04:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-24 23:04:10,327 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:04:10,328 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:04:10,328 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:04:10,328 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:04:10,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:04:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1289070164, now seen corresponding path program 1 times [2024-09-24 23:04:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:04:10,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475681416] [2024-09-24 23:04:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:04:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:04:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:04:10,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-24 23:04:10,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,478 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-24 23:04:10,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:04:10,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475681416] [2024-09-24 23:04:10,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475681416] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:04:10,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:04:10,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 23:04:10,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765337181] [2024-09-24 23:04:10,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:04:10,486 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:04:10,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:04:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:04:10,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:04:10,488 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 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-24 23:04:10,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:04:10,564 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2024-09-24 23:04:10,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:04:10,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 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-24 23:04:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:04:10,567 INFO L225 Difference]: With dead ends: 52 [2024-09-24 23:04:10,568 INFO L226 Difference]: Without dead ends: 35 [2024-09-24 23:04:10,568 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-24 23:04:10,571 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:04:10,572 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 71 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:04:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-24 23:04:10,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-09-24 23:04:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-24 23:04:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-24 23:04:10,592 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 16 [2024-09-24 23:04:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:04:10,592 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-24 23:04:10,593 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 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-24 23:04:10,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:04:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-24 23:04:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-24 23:04:10,596 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:04:10,596 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:04:10,596 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 23:04:10,597 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:04:10,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:04:10,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1068381163, now seen corresponding path program 1 times [2024-09-24 23:04:10,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:04:10,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108350451] [2024-09-24 23:04:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:04:10,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:04:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:04:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,632 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-24 23:04:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-24 23:04:10,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:04:10,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108350451] [2024-09-24 23:04:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108350451] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:04:10,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:04:10,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 23:04:10,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325685967] [2024-09-24 23:04:10,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:04:10,643 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 23:04:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:04:10,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 23:04:10,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 23:04:10,645 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 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-24 23:04:10,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:04:10,665 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2024-09-24 23:04:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 23:04:10,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 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 20 [2024-09-24 23:04:10,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:04:10,667 INFO L225 Difference]: With dead ends: 69 [2024-09-24 23:04:10,667 INFO L226 Difference]: Without dead ends: 41 [2024-09-24 23:04:10,667 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-24 23:04:10,669 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:04:10,669 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:04:10,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-24 23:04:10,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2024-09-24 23:04:10,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-24 23:04:10,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-24 23:04:10,679 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 20 [2024-09-24 23:04:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:04:10,680 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-24 23:04:10,680 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 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-24 23:04:10,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:04:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-24 23:04:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-24 23:04:10,681 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:04:10,682 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:04:10,682 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 23:04:10,682 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:04:10,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:04:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash 688329194, now seen corresponding path program 1 times [2024-09-24 23:04:10,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:04:10,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905732756] [2024-09-24 23:04:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:04:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:04:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:04:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,738 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-24 23:04:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-24 23:04:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-24 23:04:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:04:10,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:04:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905732756] [2024-09-24 23:04:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905732756] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:04:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127413598] [2024-09-24 23:04:10,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:04:10,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:04:10,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:04:10,771 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-24 23:04:10,773 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-24 23:04:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:10,835 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-09-24 23:04:10,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:04:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-24 23:04:10,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:04:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-24 23:04:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127413598] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:04:10,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:04:10,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-24 23:04:10,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210334969] [2024-09-24 23:04:10,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:04:10,958 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-24 23:04:10,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:04:10,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-24 23:04:10,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-24 23:04:10,960 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-24 23:04:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:04:11,026 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2024-09-24 23:04:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:04:11,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 32 [2024-09-24 23:04:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:04:11,030 INFO L225 Difference]: With dead ends: 89 [2024-09-24 23:04:11,031 INFO L226 Difference]: Without dead ends: 59 [2024-09-24 23:04:11,031 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 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-24 23:04:11,034 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:04:11,035 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 57 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:04:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-24 23:04:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-24 23:04:11,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 18 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-24 23:04:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-09-24 23:04:11,059 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 32 [2024-09-24 23:04:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:04:11,059 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-09-24 23:04:11,060 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-24 23:04:11,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:04:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-09-24 23:04:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-09-24 23:04:11,065 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:04:11,066 INFO L216 NwaCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-24 23:04:11,083 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-24 23:04:11,266 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-24 23:04:11,267 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:04:11,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:04:11,268 INFO L85 PathProgramCache]: Analyzing trace with hash -762805017, now seen corresponding path program 2 times [2024-09-24 23:04:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:04:11,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878228451] [2024-09-24 23:04:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:04:11,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:04:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:04:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-24 23:04:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-24 23:04:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-24 23:04:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-24 23:04:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-24 23:04:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,491 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-24 23:04:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,493 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-09-24 23:04:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,498 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-24 23:04:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,502 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-09-24 23:04:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:04:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-24 23:04:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:04:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878228451] [2024-09-24 23:04:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878228451] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:04:11,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:04:11,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 23:04:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810529058] [2024-09-24 23:04:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:04:11,515 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:04:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:04:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:04:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:04:11,516 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 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-24 23:04:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:04:11,578 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2024-09-24 23:04:11,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:04:11,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 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 68 [2024-09-24 23:04:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:04:11,581 INFO L225 Difference]: With dead ends: 59 [2024-09-24 23:04:11,581 INFO L226 Difference]: Without dead ends: 0 [2024-09-24 23:04:11,582 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 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-24 23:04:11,582 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-24 23:04:11,583 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-24 23:04:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-24 23:04:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-24 23:04:11,585 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-24 23:04:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-24 23:04:11,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2024-09-24 23:04:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:04:11,586 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-24 23:04:11,586 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 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-24 23:04:11,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:04:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-24 23:04:11,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-24 23:04:11,590 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-24 23:04:11,590 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-24 23:04:11,595 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-09-24 23:04:11,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-24 23:04:11,860 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-24 23:04:11,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 11:04:11 BoogieIcfgContainer [2024-09-24 23:04:11,879 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-24 23:04:11,880 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-24 23:04:11,880 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-24 23:04:11,880 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-24 23:04:11,880 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:04:09" (3/4) ... [2024-09-24 23:04:11,882 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-24 23:04:11,940 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-24 23:04:11,941 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-24 23:04:11,942 INFO L158 Benchmark]: Toolchain (without parser) took 2892.52ms. Allocated memory is still 220.2MB. Free memory was 151.6MB in the beginning and 131.0MB in the end (delta: 20.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-09-24 23:04:11,942 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-24 23:04:11,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.49ms. Allocated memory is still 220.2MB. Free memory was 151.6MB in the beginning and 140.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-24 23:04:11,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.62ms. Allocated memory is still 220.2MB. Free memory was 140.3MB in the beginning and 139.3MB in the end (delta: 999.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:04:11,943 INFO L158 Benchmark]: Boogie Preprocessor took 29.78ms. Allocated memory is still 220.2MB. Free memory was 139.3MB in the beginning and 137.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:04:11,943 INFO L158 Benchmark]: RCFGBuilder took 381.11ms. Allocated memory is still 220.2MB. Free memory was 137.6MB in the beginning and 188.3MB in the end (delta: -50.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-24 23:04:11,943 INFO L158 Benchmark]: TraceAbstraction took 2161.77ms. Allocated memory is still 220.2MB. Free memory was 187.5MB in the beginning and 133.1MB in the end (delta: 54.3MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. [2024-09-24 23:04:11,943 INFO L158 Benchmark]: Witness Printer took 61.72ms. Allocated memory is still 220.2MB. Free memory was 133.1MB in the beginning and 131.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-24 23:04:11,946 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 77.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.49ms. Allocated memory is still 220.2MB. Free memory was 151.6MB in the beginning and 140.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.62ms. Allocated memory is still 220.2MB. Free memory was 140.3MB in the beginning and 139.3MB in the end (delta: 999.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.78ms. Allocated memory is still 220.2MB. Free memory was 139.3MB in the beginning and 137.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 381.11ms. Allocated memory is still 220.2MB. Free memory was 137.6MB in the beginning and 188.3MB in the end (delta: -50.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2161.77ms. Allocated memory is still 220.2MB. Free memory was 187.5MB in the beginning and 133.1MB in the end (delta: 54.3MB). Peak memory consumption was 55.9MB. Max. memory is 16.1GB. * Witness Printer took 61.72ms. Allocated memory is still 220.2MB. Free memory was 133.1MB in the beginning and 131.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 136 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 85 mSDtfsCounter, 136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=4, 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.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 279/282 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: (((i <= 9) && (1 <= i)) || (i == 0)) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((i <= 10) && (1 <= i)) - ProcedureContractResult [Line: 14]: Procedure Contract for main Derived contract for procedure main. Ensures: 0 - 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-24 23:04:11,975 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