./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invariants/bin-suffix-5.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 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-invariants/bin-suffix-5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0bfc420caf514ea414f953298982e07543f1888205e2b6533af51ab5738bd69c --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:35:35,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:35:35,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:35:35,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:35:35,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:35:35,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:35:35,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:35:35,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:35:35,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:35:35,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:35:35,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:35:35,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:35:35,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:35:35,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:35:35,507 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:35:35,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:35:35,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:35:35,508 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:35:35,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:35:35,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:35:35,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:35:35,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:35:35,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:35:35,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:35:35,510 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:35:35,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:35:35,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:35:35,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:35:35,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:35:35,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:35:35,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:35:35,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:35:35,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:35:35,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:35:35,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:35:35,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:35:35,514 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:35:35,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:35:35,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:35:35,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:35:35,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:35:35,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:35:35,516 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 -> 0bfc420caf514ea414f953298982e07543f1888205e2b6533af51ab5738bd69c 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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-25 10:35:35,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:35:35,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:35:35,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:35:35,876 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:35:35,877 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:35:35,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invariants/bin-suffix-5.c [2024-09-25 10:35:37,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:35:37,525 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:35:37,526 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invariants/bin-suffix-5.c [2024-09-25 10:35:37,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4f6ee3d5b/5b6b3df7f96042f18cd1f9cdc9464a8c/FLAG635140bfe [2024-09-25 10:35:37,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4f6ee3d5b/5b6b3df7f96042f18cd1f9cdc9464a8c [2024-09-25 10:35:37,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:35:37,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:35:37,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:35:37,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:35:37,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:35:37,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbe63be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37, skipping insertion in model container [2024-09-25 10:35:37,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:35:37,741 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-invariants/bin-suffix-5.c[588,601] [2024-09-25 10:35:37,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:35:37,769 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:35:37,781 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-invariants/bin-suffix-5.c[588,601] [2024-09-25 10:35:37,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:35:37,807 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:35:37,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37 WrapperNode [2024-09-25 10:35:37,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:35:37,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:35:37,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:35:37,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:35:37,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,827 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:35:37,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:35:37,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:35:37,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:35:37,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:35:37,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,866 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-25 10:35:37,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,874 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:35:37,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:35:37,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:35:37,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:35:37,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (1/1) ... [2024-09-25 10:35:37,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:35:37,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:35:37,916 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-25 10:35:37,919 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-25 10:35:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:35:37,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:35:37,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:35:37,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:35:37,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:35:37,966 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:35:37,966 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:35:37,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:35:37,968 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:35:37,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:35:38,027 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:35:38,030 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:35:38,163 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-25 10:35:38,164 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:35:38,191 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:35:38,192 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:35:38,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:35:38 BoogieIcfgContainer [2024-09-25 10:35:38,192 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:35:38,195 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:35:38,195 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:35:38,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:35:38,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:35:37" (1/3) ... [2024-09-25 10:35:38,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512cc1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:35:38, skipping insertion in model container [2024-09-25 10:35:38,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:37" (2/3) ... [2024-09-25 10:35:38,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512cc1dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:35:38, skipping insertion in model container [2024-09-25 10:35:38,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:35:38" (3/3) ... [2024-09-25 10:35:38,203 INFO L112 eAbstractionObserver]: Analyzing ICFG bin-suffix-5.c [2024-09-25 10:35:38,221 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:35:38,221 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:35:38,283 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:35:38,291 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;@2a4392d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:35:38,291 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:35:38,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:35:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:35:38,302 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:38,303 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:38,304 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:38,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:38,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1142289292, now seen corresponding path program 1 times [2024-09-25 10:35:38,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:35:38,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146768757] [2024-09-25 10:35:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:35:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:38,463 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:35:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:38,481 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-25 10:35:38,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:35:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146768757] [2024-09-25 10:35:38,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146768757] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:35:38,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:35:38,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:35:38,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766436640] [2024-09-25 10:35:38,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:35:38,497 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:35:38,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:35:38,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:35:38,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:35:38,546 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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-25 10:35:38,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:35:38,573 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2024-09-25 10:35:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:35:38,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-25 10:35:38,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:35:38,583 INFO L225 Difference]: With dead ends: 35 [2024-09-25 10:35:38,583 INFO L226 Difference]: Without dead ends: 15 [2024-09-25 10:35:38,586 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-25 10:35:38,589 INFO L434 NwaCegarLoop]: 21 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, 21 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-25 10:35:38,592 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:35:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-09-25 10:35:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-09-25 10:35:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2024-09-25 10:35:38,624 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2024-09-25 10:35:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:35:38,626 INFO L474 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2024-09-25 10:35:38,626 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-25 10:35:38,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2024-09-25 10:35:38,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 10:35:38,628 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:38,628 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:38,628 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:35:38,629 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:38,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:38,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1071731304, now seen corresponding path program 1 times [2024-09-25 10:35:38,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:35:38,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256571865] [2024-09-25 10:35:38,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:38,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:35:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:38,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:35:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:38,810 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-25 10:35:38,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:35:38,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256571865] [2024-09-25 10:35:38,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256571865] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:35:38,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:35:38,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:35:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694360441] [2024-09-25 10:35:38,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:35:38,813 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:35:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:35:38,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:35:38,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:35:38,814 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:35:38,846 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-09-25 10:35:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:35:38,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-25 10:35:38,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:35:38,850 INFO L225 Difference]: With dead ends: 25 [2024-09-25 10:35:38,850 INFO L226 Difference]: Without dead ends: 20 [2024-09-25 10:35:38,851 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-25 10:35:38,853 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:35:38,854 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:35:38,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-25 10:35:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-09-25 10:35:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-09-25 10:35:38,863 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2024-09-25 10:35:38,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:35:38,863 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-09-25 10:35:38,863 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:38,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-09-25 10:35:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 10:35:38,864 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:38,865 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:38,865 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:35:38,865 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:38,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:38,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1099606666, now seen corresponding path program 1 times [2024-09-25 10:35:38,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:35:38,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681002883] [2024-09-25 10:35:38,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:38,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:35:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:39,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:35:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:39,197 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-25 10:35:39,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:35:39,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681002883] [2024-09-25 10:35:39,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681002883] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:35:39,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:35:39,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:35:39,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759945187] [2024-09-25 10:35:39,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:35:39,199 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:35:39,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:35:39,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:35:39,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:35:39,200 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-25 10:35:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:35:39,259 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-09-25 10:35:39,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:35:39,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2024-09-25 10:35:39,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:35:39,261 INFO L225 Difference]: With dead ends: 28 [2024-09-25 10:35:39,261 INFO L226 Difference]: Without dead ends: 17 [2024-09-25 10:35:39,261 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-25 10:35:39,262 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:35:39,263 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:35:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-09-25 10:35:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-09-25 10:35:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-09-25 10:35:39,268 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2024-09-25 10:35:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:35:39,268 INFO L474 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-09-25 10:35:39,269 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-25 10:35:39,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-09-25 10:35:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:35:39,270 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:39,270 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:39,270 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:35:39,273 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:39,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:39,274 INFO L85 PathProgramCache]: Analyzing trace with hash 412345539, now seen corresponding path program 1 times [2024-09-25 10:35:39,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:35:39,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816937160] [2024-09-25 10:35:39,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:39,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:35:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:39,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:35:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:35:39,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:35:39,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816937160] [2024-09-25 10:35:39,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816937160] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:35:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613285619] [2024-09-25 10:35:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:39,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:35:39,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:35:39,355 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-25 10:35:39,357 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-25 10:35:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:39,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-25 10:35:39,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:35:39,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:35:39,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:35:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:35:39,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613285619] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:35:39,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:35:39,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-09-25 10:35:39,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382277349] [2024-09-25 10:35:39,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:35:39,508 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 10:35:39,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:35:39,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 10:35:39,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-09-25 10:35:39,509 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-25 10:35:39,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:35:39,580 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2024-09-25 10:35:39,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:35:39,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 14 [2024-09-25 10:35:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:35:39,586 INFO L225 Difference]: With dead ends: 35 [2024-09-25 10:35:39,587 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 10:35:39,587 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:35:39,588 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:35:39,588 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 43 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:35:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 10:35:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-09-25 10:35:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-09-25 10:35:39,601 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 14 [2024-09-25 10:35:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:35:39,602 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-09-25 10:35:39,602 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-25 10:35:39,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-09-25 10:35:39,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:35:39,603 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:39,603 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:39,620 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:35:39,807 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-25 10:35:39,808 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:39,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1998364090, now seen corresponding path program 1 times [2024-09-25 10:35:39,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:35:39,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676679349] [2024-09-25 10:35:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:39,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:35:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-25 10:35:39,821 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-25 10:35:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-25 10:35:39,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-25 10:35:39,855 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-25 10:35:39,859 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:35:39,861 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 10:35:39,867 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-25 10:35:39,886 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:35:39,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:35:39 BoogieIcfgContainer [2024-09-25 10:35:39,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:35:39,890 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:35:39,890 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:35:39,890 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:35:39,891 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:35:38" (3/4) ... [2024-09-25 10:35:39,893 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-09-25 10:35:39,894 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:35:39,895 INFO L158 Benchmark]: Toolchain (without parser) took 2339.62ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 39.5MB in the beginning and 59.6MB in the end (delta: -20.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-09-25 10:35:39,895 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 62.9MB. Free memory is still 39.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:35:39,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.44ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 28.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 10:35:39,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.78ms. Allocated memory is still 62.9MB. Free memory was 28.4MB in the beginning and 27.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:35:39,898 INFO L158 Benchmark]: Boogie Preprocessor took 51.67ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 27.3MB in the beginning and 68.8MB in the end (delta: -41.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-09-25 10:35:39,898 INFO L158 Benchmark]: RCFGBuilder took 311.77ms. Allocated memory is still 88.1MB. Free memory was 68.8MB in the beginning and 57.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 10:35:39,898 INFO L158 Benchmark]: TraceAbstraction took 1694.21ms. Allocated memory is still 88.1MB. Free memory was 56.9MB in the beginning and 59.6MB in the end (delta: -2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:35:39,898 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 88.1MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:35:39,903 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.19ms. Allocated memory is still 62.9MB. Free memory is still 39.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.44ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 28.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.78ms. Allocated memory is still 62.9MB. Free memory was 28.4MB in the beginning and 27.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.67ms. Allocated memory was 62.9MB in the beginning and 88.1MB in the end (delta: 25.2MB). Free memory was 27.3MB in the beginning and 68.8MB in the end (delta: -41.5MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * RCFGBuilder took 311.77ms. Allocated memory is still 88.1MB. Free memory was 68.8MB in the beginning and 57.6MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1694.21ms. Allocated memory is still 88.1MB. Free memory was 56.9MB in the beginning and 59.6MB in the end (delta: -2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 88.1MB. Free memory is still 59.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 14]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L19] unsigned int x = 5; VAL [x=5] [L20] COND TRUE __VERIFIER_nondet_int() [L21] x += 8 VAL [x=13] [L20] COND FALSE !(__VERIFIER_nondet_int()) [L23] EXPR x & 5 [L23] CALL __VERIFIER_assert((x & 5) == 5) VAL [\old(cond)=0] [L13] COND TRUE !(cond) VAL [\old(cond)=0] [L14] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 81 IncrementalHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 56 mSDtfsCounter, 81 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=4, InterpolantAutomatonStates: 17, 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, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 52 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 0/6 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-09-25 10:35:39,927 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-invariants/bin-suffix-5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.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 0bfc420caf514ea414f953298982e07543f1888205e2b6533af51ab5738bd69c --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:35:41,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:35:42,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-25 10:35:42,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:35:42,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:35:42,076 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:35:42,077 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:35:42,077 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:35:42,078 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:35:42,079 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:35:42,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:35:42,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:35:42,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:35:42,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:35:42,083 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:35:42,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:35:42,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:35:42,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:35:42,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:35:42,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:35:42,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:35:42,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:35:42,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:35:42,089 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-25 10:35:42,089 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-25 10:35:42,090 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:35:42,090 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-25 10:35:42,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:35:42,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:35:42,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:35:42,091 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:35:42,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:35:42,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:35:42,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:35:42,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:35:42,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:35:42,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:35:42,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:35:42,094 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-25 10:35:42,095 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-25 10:35:42,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:35:42,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:35:42,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:35:42,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:35:42,096 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-25 10:35:42,096 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 -> 0bfc420caf514ea414f953298982e07543f1888205e2b6533af51ab5738bd69c 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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-25 10:35:42,416 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:35:42,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:35:42,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:35:42,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:35:42,445 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:35:42,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invariants/bin-suffix-5.c [2024-09-25 10:35:43,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:35:44,043 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:35:44,044 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invariants/bin-suffix-5.c [2024-09-25 10:35:44,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/993f09a58/62bcd99927db447185d6ba80df12281d/FLAG4781d1dc0 [2024-09-25 10:35:44,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/993f09a58/62bcd99927db447185d6ba80df12281d [2024-09-25 10:35:44,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:35:44,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:35:44,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:35:44,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:35:44,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:35:44,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681825d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44, skipping insertion in model container [2024-09-25 10:35:44,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:35:44,265 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-invariants/bin-suffix-5.c[588,601] [2024-09-25 10:35:44,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:35:44,297 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:35:44,308 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-invariants/bin-suffix-5.c[588,601] [2024-09-25 10:35:44,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:35:44,330 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:35:44,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44 WrapperNode [2024-09-25 10:35:44,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:35:44,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:35:44,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:35:44,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:35:44,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,353 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:35:44,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:35:44,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:35:44,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:35:44,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:35:44,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,366 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,379 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-25 10:35:44,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,394 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:35:44,396 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:35:44,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:35:44,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:35:44,397 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (1/1) ... [2024-09-25 10:35:44,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:35:44,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:35:44,433 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-25 10:35:44,438 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-25 10:35:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:35:44,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:35:44,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:35:44,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:35:44,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:35:44,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-25 10:35:44,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:35:44,489 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:35:44,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:35:44,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:35:44,554 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:35:44,556 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:35:44,684 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-09-25 10:35:44,685 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:35:44,713 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:35:44,713 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:35:44,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:35:44 BoogieIcfgContainer [2024-09-25 10:35:44,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:35:44,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:35:44,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:35:44,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:35:44,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:35:44" (1/3) ... [2024-09-25 10:35:44,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c236e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:35:44, skipping insertion in model container [2024-09-25 10:35:44,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:35:44" (2/3) ... [2024-09-25 10:35:44,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c236e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:35:44, skipping insertion in model container [2024-09-25 10:35:44,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:35:44" (3/3) ... [2024-09-25 10:35:44,721 INFO L112 eAbstractionObserver]: Analyzing ICFG bin-suffix-5.c [2024-09-25 10:35:44,736 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:35:44,736 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:35:44,793 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:35:44,799 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;@72df3b0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:35:44,801 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:35:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:35:44,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:35:44,815 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:44,816 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:44,817 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:44,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1179372921, now seen corresponding path program 1 times [2024-09-25 10:35:44,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 10:35:44,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613114154] [2024-09-25 10:35:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:44,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 10:35:44,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 10:35:44,840 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-25 10:35:44,841 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-09-25 10:35:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:44,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-25 10:35:44,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:35:44,904 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-25 10:35:44,908 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:35:44,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 10:35:44,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613114154] [2024-09-25 10:35:44,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613114154] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:35:44,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:35:44,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:35:44,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206023650] [2024-09-25 10:35:44,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:35:44,917 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:35:44,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 10:35:44,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:35:44,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:35:44,942 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:35:44,968 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-09-25 10:35:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:35:44,971 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-25 10:35:44,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:35:44,976 INFO L225 Difference]: With dead ends: 29 [2024-09-25 10:35:44,976 INFO L226 Difference]: Without dead ends: 12 [2024-09-25 10:35:44,979 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-25 10:35:44,983 INFO L434 NwaCegarLoop]: 16 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, 16 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-25 10:35:44,984 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:35:45,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-09-25 10:35:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-09-25 10:35:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-09-25 10:35:45,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2024-09-25 10:35:45,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:35:45,019 INFO L474 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-09-25 10:35:45,019 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-25 10:35:45,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:45,020 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-09-25 10:35:45,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:35:45,020 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:45,020 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:45,024 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-09-25 10:35:45,221 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 10:35:45,221 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:45,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1872020499, now seen corresponding path program 1 times [2024-09-25 10:35:45,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 10:35:45,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878757515] [2024-09-25 10:35:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:45,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 10:35:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 10:35:45,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-25 10:35:45,233 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-09-25 10:35:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:45,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:35:45,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:35:45,352 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-25 10:35:45,355 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:35:45,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 10:35:45,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878757515] [2024-09-25 10:35:45,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878757515] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:35:45,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:35:45,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:35:45,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690224042] [2024-09-25 10:35:45,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:35:45,357 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:35:45,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 10:35:45,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:35:45,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:35:45,358 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-25 10:35:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:35:45,411 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-09-25 10:35:45,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:35:45,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-25 10:35:45,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:35:45,412 INFO L225 Difference]: With dead ends: 19 [2024-09-25 10:35:45,413 INFO L226 Difference]: Without dead ends: 14 [2024-09-25 10:35:45,413 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-25 10:35:45,414 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 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-25 10:35:45,415 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:35:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-09-25 10:35:45,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-09-25 10:35:45,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-09-25 10:35:45,424 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2024-09-25 10:35:45,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:35:45,427 INFO L474 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-09-25 10:35:45,427 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-25 10:35:45,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:45,429 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-09-25 10:35:45,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 10:35:45,429 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:45,429 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:45,433 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:35:45,633 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 10:35:45,633 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:45,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:45,634 INFO L85 PathProgramCache]: Analyzing trace with hash 414464600, now seen corresponding path program 1 times [2024-09-25 10:35:45,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 10:35:45,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018047256] [2024-09-25 10:35:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:45,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 10:35:45,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 10:35:45,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-25 10:35:45,644 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-09-25 10:35:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:45,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-25 10:35:45,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:35:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:35:45,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:35:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 10:35:45,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 10:35:45,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018047256] [2024-09-25 10:35:45,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018047256] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 10:35:45,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:35:45,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-09-25 10:35:45,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355672638] [2024-09-25 10:35:45,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:35:45,850 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:35:45,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 10:35:45,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:35:45,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:35:45,854 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:35:45,888 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-09-25 10:35:45,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 10:35:45,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-25 10:35:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:35:45,890 INFO L225 Difference]: With dead ends: 14 [2024-09-25 10:35:45,890 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 10:35:45,890 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-25 10:35:45,892 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:35:45,894 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 24 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:35:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 10:35:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 10:35:45,896 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-25 10:35:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 10:35:45,896 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2024-09-25 10:35:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:35:45,897 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 10:35:45,897 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:35:45,897 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 10:35:45,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 10:35:45,901 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:35:45,905 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-09-25 10:35:46,103 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 10:35:46,106 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-25 10:35:46,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 10:35:46,220 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:35:46,240 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:35:46,241 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:35:46,241 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:35:46,241 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:35:46,241 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:35:46,241 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:35:46,242 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:35:46,242 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:35:46,243 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:35:46,243 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 10:35:46,243 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:35:46,244 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 10:35:46,244 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:35:46,244 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 10:35:46,244 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:35:46,244 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 10:35:46,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:35:46 BoogieIcfgContainer [2024-09-25 10:35:46,245 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:35:46,246 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:35:46,246 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:35:46,246 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:35:46,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:35:44" (3/4) ... [2024-09-25 10:35:46,249 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 10:35:46,303 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 10:35:46,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:35:46,305 INFO L158 Benchmark]: Toolchain (without parser) took 2237.23ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 34.8MB in the beginning and 41.1MB in the end (delta: -6.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-09-25 10:35:46,306 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:35:46,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.15ms. Allocated memory is still 67.1MB. Free memory was 34.7MB in the beginning and 39.2MB in the end (delta: -4.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-09-25 10:35:46,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.03ms. Allocated memory is still 67.1MB. Free memory was 39.2MB in the beginning and 38.3MB in the end (delta: 901.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:35:46,309 INFO L158 Benchmark]: Boogie Preprocessor took 40.78ms. Allocated memory is still 67.1MB. Free memory was 38.1MB in the beginning and 36.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:35:46,310 INFO L158 Benchmark]: RCFGBuilder took 318.20ms. Allocated memory is still 67.1MB. Free memory was 36.5MB in the beginning and 42.3MB in the end (delta: -5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 10:35:46,310 INFO L158 Benchmark]: TraceAbstraction took 1529.61ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 41.7MB in the beginning and 43.7MB in the end (delta: -2.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-09-25 10:35:46,312 INFO L158 Benchmark]: Witness Printer took 57.46ms. Allocated memory is still 81.8MB. Free memory was 43.7MB in the beginning and 41.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:35:46,314 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 54.5MB. Free memory is still 37.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.15ms. Allocated memory is still 67.1MB. Free memory was 34.7MB in the beginning and 39.2MB in the end (delta: -4.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.03ms. Allocated memory is still 67.1MB. Free memory was 39.2MB in the beginning and 38.3MB in the end (delta: 901.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.78ms. Allocated memory is still 67.1MB. Free memory was 38.1MB in the beginning and 36.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 318.20ms. Allocated memory is still 67.1MB. Free memory was 36.5MB in the beginning and 42.3MB in the end (delta: -5.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1529.61ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 41.7MB in the beginning and 43.7MB in the end (delta: -2.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 57.46ms. Allocated memory is still 81.8MB. Free memory was 43.7MB in the beginning and 41.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length * 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: 14]: 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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 93 SizeOfPredicates, 2 NumberOfNonLiveVariables, 86 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2/4 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: 20]: Loop Invariant Derived loop invariant: (5 == (5 & x)) - ProcedureContractResult [Line: 12]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (0 != cond) Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-09-25 10:35:46,348 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE