./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_10x0-1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/sum_10x0-1.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 68d0cd7d514b491e1404560081afc21267eb1b3dae98cdb9832a8634357d65e4 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:09:21,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:09:21,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:09:21,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:09:21,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:09:21,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:09:21,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:09:21,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:09:21,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:09:21,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:09:21,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:09:21,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:09:21,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:09:21,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:09:21,345 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:09:21,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:09:21,346 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:09:21,346 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:09:21,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:09:21,347 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:09:21,347 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:09:21,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:09:21,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:09:21,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:09:21,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:09:21,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:09:21,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:09:21,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:09:21,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:09:21,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:09:21,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:09:21,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:09:21,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:09:21,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:09:21,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:09:21,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:09:21,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:09:21,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:09:21,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:09:21,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:09:21,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:09:21,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:09:21,359 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 -> 68d0cd7d514b491e1404560081afc21267eb1b3dae98cdb9832a8634357d65e4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:09:21,610 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:09:21,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:09:21,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:09:21,640 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:09:21,640 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:09:21,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2024-09-25 00:09:23,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:09:23,356 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:09:23,357 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/sum_10x0-1.c [2024-09-25 00:09:23,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c935de095/68629be889594c4381fd4d22eea06fe2/FLAG66002353c [2024-09-25 00:09:23,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c935de095/68629be889594c4381fd4d22eea06fe2 [2024-09-25 00:09:23,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:09:23,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:09:23,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:09:23,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:09:23,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:09:23,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488a976d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23, skipping insertion in model container [2024-09-25 00:09:23,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:09:23,577 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/recursive-simple/sum_10x0-1.c[481,494] [2024-09-25 00:09:23,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:09:23,617 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:09:23,639 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/recursive-simple/sum_10x0-1.c[481,494] [2024-09-25 00:09:23,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:09:23,684 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:09:23,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23 WrapperNode [2024-09-25 00:09:23,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:09:23,686 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:09:23,686 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:09:23,686 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:09:23,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,706 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:09:23,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:09:23,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:09:23,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:09:23,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:09:23,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,731 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 00:09:23,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,738 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:09:23,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:09:23,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:09:23,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:09:23,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (1/1) ... [2024-09-25 00:09:23,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:09:23,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:23,787 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 00:09:23,790 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 00:09:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:09:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:09:23,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:09:23,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:09:23,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:09:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-09-25 00:09:23,838 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-09-25 00:09:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:09:23,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:09:23,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:09:23,897 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:09:23,900 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:09:24,021 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-25 00:09:24,022 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:09:24,045 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:09:24,045 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:09:24,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:24 BoogieIcfgContainer [2024-09-25 00:09:24,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:09:24,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:09:24,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:09:24,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:09:24,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:09:23" (1/3) ... [2024-09-25 00:09:24,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b201474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:09:24, skipping insertion in model container [2024-09-25 00:09:24,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:23" (2/3) ... [2024-09-25 00:09:24,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b201474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:09:24, skipping insertion in model container [2024-09-25 00:09:24,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:24" (3/3) ... [2024-09-25 00:09:24,056 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_10x0-1.c [2024-09-25 00:09:24,072 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:09:24,072 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:09:24,126 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:09:24,134 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;@4306bfd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:09:24,134 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:09:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 00:09:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 00:09:24,151 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:24,152 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:24,153 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:24,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash 661201948, now seen corresponding path program 1 times [2024-09-25 00:09:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:24,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449094009] [2024-09-25 00:09:24,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:24,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,461 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 00:09:24,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:24,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449094009] [2024-09-25 00:09:24,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449094009] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:09:24,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:09:24,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 00:09:24,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265312510] [2024-09-25 00:09:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:09:24,469 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 00:09:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:24,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 00:09:24,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:09:24,498 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:09:24,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:24,587 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-09-25 00:09:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 00:09:24,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2024-09-25 00:09:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:24,597 INFO L225 Difference]: With dead ends: 30 [2024-09-25 00:09:24,597 INFO L226 Difference]: Without dead ends: 18 [2024-09-25 00:09:24,599 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 00:09:24,603 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:24,604 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 48 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:24,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-25 00:09:24,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-09-25 00:09:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:09:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-09-25 00:09:24,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2024-09-25 00:09:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:24,655 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-09-25 00:09:24,656 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 00:09:24,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:24,657 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-09-25 00:09:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-25 00:09:24,658 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:24,658 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:24,659 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:09:24,659 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:24,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:24,662 INFO L85 PathProgramCache]: Analyzing trace with hash 36081636, now seen corresponding path program 1 times [2024-09-25 00:09:24,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:24,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956947799] [2024-09-25 00:09:24,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:24,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 00:09:24,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:24,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956947799] [2024-09-25 00:09:24,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956947799] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:24,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962980254] [2024-09-25 00:09:24,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:24,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:24,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:24,911 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 00:09:24,912 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 00:09:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:24,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 00:09:24,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:25,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 00:09:25,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:09:25,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962980254] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:25,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:25,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2024-09-25 00:09:25,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817781682] [2024-09-25 00:09:25,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:25,299 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 00:09:25,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:25,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 00:09:25,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-25 00:09:25,302 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:09:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:25,383 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-09-25 00:09:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:09:25,384 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 19 [2024-09-25 00:09:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:25,385 INFO L225 Difference]: With dead ends: 25 [2024-09-25 00:09:25,385 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 00:09:25,386 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:09:25,388 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:25,389 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 59 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:25,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 00:09:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-25 00:09:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 00:09:25,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-25 00:09:25,400 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2024-09-25 00:09:25,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:25,401 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-25 00:09:25,402 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 10 states have internal predecessors, (19), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:09:25,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-25 00:09:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-25 00:09:25,403 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:25,404 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:25,420 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 00:09:25,604 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:25,605 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:25,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:25,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1588422884, now seen corresponding path program 2 times [2024-09-25 00:09:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:25,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259713577] [2024-09-25 00:09:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:25,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:25,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 00:09:25,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:25,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259713577] [2024-09-25 00:09:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259713577] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:25,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175455695] [2024-09-25 00:09:25,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:09:25,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:25,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:25,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:09:25,867 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 00:09:25,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:09:25,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:25,920 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:09:25,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 00:09:25,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 00:09:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175455695] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:26,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:26,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2024-09-25 00:09:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696298692] [2024-09-25 00:09:26,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:26,341 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-25 00:09:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:26,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-25 00:09:26,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-25 00:09:26,346 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-25 00:09:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:26,421 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-09-25 00:09:26,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:09:26,422 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) Word has length 25 [2024-09-25 00:09:26,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:26,423 INFO L225 Difference]: With dead ends: 28 [2024-09-25 00:09:26,424 INFO L226 Difference]: Without dead ends: 24 [2024-09-25 00:09:26,424 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-09-25 00:09:26,427 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:26,427 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 46 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:26,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-25 00:09:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-25 00:09:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 00:09:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-09-25 00:09:26,438 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2024-09-25 00:09:26,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:26,439 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-09-25 00:09:26,439 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 12 states have internal predecessors, (23), 7 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 4 states have call predecessors, (9), 7 states have call successors, (9) [2024-09-25 00:09:26,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-09-25 00:09:26,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-25 00:09:26,442 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:26,443 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:26,461 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 00:09:26,646 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:26,647 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:26,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1668608796, now seen corresponding path program 3 times [2024-09-25 00:09:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:26,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444157540] [2024-09-25 00:09:26,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:26,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,797 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,877 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:09:26,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444157540] [2024-09-25 00:09:26,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444157540] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051392246] [2024-09-25 00:09:26,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:09:26,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:26,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:26,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:09:26,903 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 00:09:26,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-25 00:09:26,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:26,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 00:09:26,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:09:27,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:09:27,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051392246] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:27,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:27,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2024-09-25 00:09:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442436620] [2024-09-25 00:09:27,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:27,538 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-25 00:09:27,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:27,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-25 00:09:27,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-09-25 00:09:27,540 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-25 00:09:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:27,614 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-09-25 00:09:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 00:09:27,614 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) Word has length 31 [2024-09-25 00:09:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:27,615 INFO L225 Difference]: With dead ends: 31 [2024-09-25 00:09:27,615 INFO L226 Difference]: Without dead ends: 27 [2024-09-25 00:09:27,616 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:09:27,617 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:27,617 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:27,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-25 00:09:27,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-25 00:09:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-25 00:09:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-09-25 00:09:27,624 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2024-09-25 00:09:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:27,625 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-09-25 00:09:27,625 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.25) internal successors, (27), 14 states have internal predecessors, (27), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-25 00:09:27,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-09-25 00:09:27,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-25 00:09:27,629 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:27,630 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:27,649 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 00:09:27,830 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:27,831 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:27,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2054436324, now seen corresponding path program 4 times [2024-09-25 00:09:27,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:27,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148242450] [2024-09-25 00:09:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:27,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,936 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:27,971 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,023 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 00:09:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148242450] [2024-09-25 00:09:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148242450] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411139574] [2024-09-25 00:09:28,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 00:09:28,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:28,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:28,102 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:09:28,104 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 00:09:28,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 00:09:28,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:28,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-25 00:09:28,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 00:09:28,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-25 00:09:28,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411139574] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:28,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:28,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-09-25 00:09:28,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030494993] [2024-09-25 00:09:28,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:28,966 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-25 00:09:28,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:28,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-25 00:09:28,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-09-25 00:09:28,968 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2024-09-25 00:09:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:29,045 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-09-25 00:09:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 00:09:29,046 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) Word has length 37 [2024-09-25 00:09:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:29,047 INFO L225 Difference]: With dead ends: 34 [2024-09-25 00:09:29,047 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 00:09:29,048 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-09-25 00:09:29,049 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:29,049 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 63 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:09:29,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 00:09:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-25 00:09:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-25 00:09:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-09-25 00:09:29,058 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2024-09-25 00:09:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:29,058 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-09-25 00:09:29,058 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 16 states have internal predecessors, (31), 9 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (15), 6 states have call predecessors, (15), 9 states have call successors, (15) [2024-09-25 00:09:29,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-09-25 00:09:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-25 00:09:29,060 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:29,060 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:29,075 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 00:09:29,260 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:29,261 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:29,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2043660772, now seen corresponding path program 5 times [2024-09-25 00:09:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:29,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176994575] [2024-09-25 00:09:29,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:29,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,353 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:29,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 00:09:29,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:29,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176994575] [2024-09-25 00:09:29,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176994575] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:29,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433852530] [2024-09-25 00:09:29,600 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 00:09:29,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:29,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:29,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:09:29,608 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 00:09:29,667 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-09-25 00:09:29,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:29,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 00:09:29,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-09-25 00:09:29,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:09:30,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433852530] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:30,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:30,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2024-09-25 00:09:30,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51308764] [2024-09-25 00:09:30,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:30,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 00:09:30,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:30,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 00:09:30,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-09-25 00:09:30,822 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 00:09:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:30,923 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2024-09-25 00:09:30,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 00:09:30,927 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) Word has length 43 [2024-09-25 00:09:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:30,928 INFO L225 Difference]: With dead ends: 37 [2024-09-25 00:09:30,929 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 00:09:30,929 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2024-09-25 00:09:30,930 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:30,930 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 70 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 00:09:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-25 00:09:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-25 00:09:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2024-09-25 00:09:30,942 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2024-09-25 00:09:30,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:30,942 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2024-09-25 00:09:30,943 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.1875) internal successors, (35), 18 states have internal predecessors, (35), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (18), 7 states have call predecessors, (18), 10 states have call successors, (18) [2024-09-25 00:09:30,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2024-09-25 00:09:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 00:09:30,944 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:30,945 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:30,960 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 00:09:31,145 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 00:09:31,146 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:31,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:31,146 INFO L85 PathProgramCache]: Analyzing trace with hash 776256796, now seen corresponding path program 6 times [2024-09-25 00:09:31,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:31,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887966711] [2024-09-25 00:09:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:31,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:31,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:31,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:31,322 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:31,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:31,432 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:31,464 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:31,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:31,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-25 00:09:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:31,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887966711] [2024-09-25 00:09:31,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887966711] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648377075] [2024-09-25 00:09:31,539 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 00:09:31,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:31,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:31,541 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:09:31,543 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 00:09:31,622 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-09-25 00:09:31,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:31,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-25 00:09:31,626 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-25 00:09:31,694 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-25 00:09:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648377075] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:33,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:33,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2024-09-25 00:09:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287211710] [2024-09-25 00:09:33,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:33,239 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 00:09:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:33,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 00:09:33,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-09-25 00:09:33,241 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 11 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2024-09-25 00:09:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:33,347 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2024-09-25 00:09:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-25 00:09:33,348 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 11 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) Word has length 49 [2024-09-25 00:09:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:33,349 INFO L225 Difference]: With dead ends: 40 [2024-09-25 00:09:33,351 INFO L226 Difference]: Without dead ends: 36 [2024-09-25 00:09:33,352 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 98 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2024-09-25 00:09:33,353 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:33,353 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 97 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:33,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-25 00:09:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-09-25 00:09:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2024-09-25 00:09:33,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2024-09-25 00:09:33,368 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2024-09-25 00:09:33,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:33,368 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2024-09-25 00:09:33,369 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 20 states have internal predecessors, (39), 11 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (21), 8 states have call predecessors, (21), 11 states have call successors, (21) [2024-09-25 00:09:33,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2024-09-25 00:09:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-25 00:09:33,370 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:33,370 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:33,386 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-25 00:09:33,570 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:33,571 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:33,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:33,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1513830684, now seen corresponding path program 7 times [2024-09-25 00:09:33,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:33,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670861803] [2024-09-25 00:09:33,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,639 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,869 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,927 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:33,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-09-25 00:09:33,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:33,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670861803] [2024-09-25 00:09:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670861803] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:33,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303080496] [2024-09-25 00:09:33,984 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 00:09:33,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:33,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:33,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:09:33,987 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 00:09:34,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:34,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-25 00:09:34,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-09-25 00:09:34,136 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-25 00:09:35,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303080496] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:36,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:36,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2024-09-25 00:09:36,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087633228] [2024-09-25 00:09:36,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:36,001 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-25 00:09:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:36,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-25 00:09:36,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-09-25 00:09:36,003 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) [2024-09-25 00:09:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:36,107 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2024-09-25 00:09:36,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 00:09:36,108 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) Word has length 55 [2024-09-25 00:09:36,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:36,109 INFO L225 Difference]: With dead ends: 43 [2024-09-25 00:09:36,109 INFO L226 Difference]: Without dead ends: 39 [2024-09-25 00:09:36,110 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 110 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2024-09-25 00:09:36,111 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 66 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:36,111 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 104 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-25 00:09:36,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-25 00:09:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 10 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-25 00:09:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2024-09-25 00:09:36,119 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2024-09-25 00:09:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:36,120 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2024-09-25 00:09:36,120 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.15) internal successors, (43), 22 states have internal predecessors, (43), 12 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) [2024-09-25 00:09:36,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2024-09-25 00:09:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-25 00:09:36,121 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:36,121 INFO L216 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:36,140 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 00:09:36,322 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:36,323 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:36,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:36,323 INFO L85 PathProgramCache]: Analyzing trace with hash 296579100, now seen corresponding path program 8 times [2024-09-25 00:09:36,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:36,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381916058] [2024-09-25 00:09:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:36,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,416 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,418 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,801 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,826 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-09-25 00:09:36,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:36,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381916058] [2024-09-25 00:09:36,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381916058] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:36,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165289585] [2024-09-25 00:09:36,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:09:36,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:36,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:36,865 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:09:36,867 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 00:09:36,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:09:36,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:36,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-25 00:09:36,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-09-25 00:09:37,069 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:39,618 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 00:09:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165289585] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:39,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2024-09-25 00:09:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055919227] [2024-09-25 00:09:39,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:39,620 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 00:09:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:39,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 00:09:39,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2024-09-25 00:09:39,621 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 13 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (27), 10 states have call predecessors, (27), 13 states have call successors, (27) [2024-09-25 00:09:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:39,769 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2024-09-25 00:09:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 00:09:39,770 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 13 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (27), 10 states have call predecessors, (27), 13 states have call successors, (27) Word has length 61 [2024-09-25 00:09:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:39,771 INFO L225 Difference]: With dead ends: 46 [2024-09-25 00:09:39,771 INFO L226 Difference]: Without dead ends: 42 [2024-09-25 00:09:39,772 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 122 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2024-09-25 00:09:39,772 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 119 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:39,772 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 109 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:39,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-25 00:09:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-09-25 00:09:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 11 states have return successors, (12), 11 states have call predecessors, (12), 3 states have call successors, (12) [2024-09-25 00:09:39,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2024-09-25 00:09:39,787 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2024-09-25 00:09:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:39,788 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2024-09-25 00:09:39,788 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 24 states have internal predecessors, (47), 13 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (27), 10 states have call predecessors, (27), 13 states have call successors, (27) [2024-09-25 00:09:39,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2024-09-25 00:09:39,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-25 00:09:39,791 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:39,791 INFO L216 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:39,809 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 00:09:39,992 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:39,993 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:39,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1875246108, now seen corresponding path program 9 times [2024-09-25 00:09:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877766216] [2024-09-25 00:09:39,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:39,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,084 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,413 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,457 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,551 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,575 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-09-25 00:09:40,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:40,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877766216] [2024-09-25 00:09:40,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877766216] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371307493] [2024-09-25 00:09:40,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:09:40,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:40,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:40,601 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:09:40,603 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 00:09:40,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-25 00:09:40,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:40,768 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-25 00:09:40,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:40,835 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-09-25 00:09:40,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-09-25 00:09:44,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371307493] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:44,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:44,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2024-09-25 00:09:44,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000160422] [2024-09-25 00:09:44,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:44,081 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 00:09:44,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:44,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 00:09:44,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-09-25 00:09:44,083 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) [2024-09-25 00:09:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:44,220 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2024-09-25 00:09:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-25 00:09:44,220 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) Word has length 67 [2024-09-25 00:09:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:44,224 INFO L225 Difference]: With dead ends: 49 [2024-09-25 00:09:44,224 INFO L226 Difference]: Without dead ends: 45 [2024-09-25 00:09:44,225 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 134 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=375, Invalid=747, Unknown=0, NotChecked=0, Total=1122 [2024-09-25 00:09:44,226 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:44,226 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 109 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:44,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-25 00:09:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-09-25 00:09:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 12 states have return successors, (13), 12 states have call predecessors, (13), 3 states have call successors, (13) [2024-09-25 00:09:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2024-09-25 00:09:44,232 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2024-09-25 00:09:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:44,233 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2024-09-25 00:09:44,233 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 25 states have internal predecessors, (50), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) [2024-09-25 00:09:44,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2024-09-25 00:09:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-09-25 00:09:44,234 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:44,234 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:44,256 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 00:09:44,435 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 00:09:44,435 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:44,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1040850148, now seen corresponding path program 10 times [2024-09-25 00:09:44,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:44,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993798063] [2024-09-25 00:09:44,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:44,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:44,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:44,739 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:45,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:45,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:45,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:45,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:45,919 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:46,011 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:46,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:46,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:46,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:46,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:46,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:09:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-09-25 00:09:46,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:46,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993798063] [2024-09-25 00:09:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993798063] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587671842] [2024-09-25 00:09:46,263 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 00:09:46,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:46,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:46,265 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:09:46,267 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 00:09:46,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 00:09:46,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:46,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-09-25 00:09:46,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 19 proven. 155 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-09-25 00:09:47,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-09-25 00:09:49,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587671842] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:49,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:49,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 29, 29] total 41 [2024-09-25 00:09:49,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221458130] [2024-09-25 00:09:49,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:49,730 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-25 00:09:49,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:49,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-25 00:09:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1544, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 00:09:49,731 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 41 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 27 states have internal predecessors, (47), 7 states have call successors, (8), 1 states have call predecessors, (8), 15 states have return successors, (16), 15 states have call predecessors, (16), 7 states have call successors, (16) [2024-09-25 00:09:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:50,731 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2024-09-25 00:09:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-09-25 00:09:50,732 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 27 states have internal predecessors, (47), 7 states have call successors, (8), 1 states have call predecessors, (8), 15 states have return successors, (16), 15 states have call predecessors, (16), 7 states have call successors, (16) Word has length 73 [2024-09-25 00:09:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:50,732 INFO L225 Difference]: With dead ends: 48 [2024-09-25 00:09:50,732 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:09:50,734 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=401, Invalid=4155, Unknown=0, NotChecked=0, Total=4556 [2024-09-25 00:09:50,735 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 89 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:50,735 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 471 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 00:09:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:09:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:09:50,736 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 00:09:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:09:50,736 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2024-09-25 00:09:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:50,736 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:09:50,737 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 27 states have internal predecessors, (47), 7 states have call successors, (8), 1 states have call predecessors, (8), 15 states have return successors, (16), 15 states have call predecessors, (16), 7 states have call successors, (16) [2024-09-25 00:09:50,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:09:50,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:09:50,740 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:09:50,764 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-25 00:09:50,940 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-25 00:09:50,944 INFO L408 BasicCegarLoop]: Path program histogram: [10, 1] [2024-09-25 00:09:50,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:09:51,380 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:09:51,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:09:51 BoogieIcfgContainer [2024-09-25 00:09:51,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:09:51,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:09:51,400 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:09:51,400 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:09:51,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:24" (3/4) ... [2024-09-25 00:09:51,402 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:09:51,454 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:09:51,454 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:09:51,455 INFO L158 Benchmark]: Toolchain (without parser) took 28064.06ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 107.9MB in the beginning and 263.7MB in the end (delta: -155.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-09-25 00:09:51,455 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:09:51,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.25ms. Allocated memory is still 178.3MB. Free memory was 107.7MB in the beginning and 148.2MB in the end (delta: -40.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2024-09-25 00:09:51,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.25ms. Allocated memory is still 178.3MB. Free memory was 148.2MB in the beginning and 147.3MB in the end (delta: 900.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:09:51,456 INFO L158 Benchmark]: Boogie Preprocessor took 38.18ms. Allocated memory is still 178.3MB. Free memory was 147.3MB in the beginning and 146.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:09:51,456 INFO L158 Benchmark]: RCFGBuilder took 299.93ms. Allocated memory is still 178.3MB. Free memory was 146.0MB in the beginning and 133.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 00:09:51,456 INFO L158 Benchmark]: TraceAbstraction took 27351.07ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 133.5MB in the beginning and 265.8MB in the end (delta: -132.3MB). Peak memory consumption was 209.6MB. Max. memory is 16.1GB. [2024-09-25 00:09:51,457 INFO L158 Benchmark]: Witness Printer took 54.30ms. Allocated memory is still 373.3MB. Free memory was 265.8MB in the beginning and 263.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:09:51,458 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.20ms. Allocated memory is still 117.4MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.25ms. Allocated memory is still 178.3MB. Free memory was 107.7MB in the beginning and 148.2MB in the end (delta: -40.4MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.25ms. Allocated memory is still 178.3MB. Free memory was 148.2MB in the beginning and 147.3MB in the end (delta: 900.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.18ms. Allocated memory is still 178.3MB. Free memory was 147.3MB in the beginning and 146.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 299.93ms. Allocated memory is still 178.3MB. Free memory was 146.0MB in the beginning and 133.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27351.07ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 133.5MB in the beginning and 265.8MB in the end (delta: -132.3MB). Peak memory consumption was 209.6MB. Max. memory is 16.1GB. * Witness Printer took 54.30ms. Allocated memory is still 373.3MB. Free memory was 265.8MB in the beginning and 263.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 18]: 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, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.8s, OverallIterations: 11, TraceHistogramMax: 11, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 562 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 487 mSDsluCounter, 1246 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1105 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1477 IncrementalHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 141 mSDtfsCounter, 1477 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1247 GetRequests, 935 SyntacticMatches, 55 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2186 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=10, InterpolantAutomatonStates: 125, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 933 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 4067 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1491 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 31 InterpolantComputations, 1 PerfectInterpolantSequences, 1646/3630 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 - ProcedureContractResult [Line: 5]: Procedure Contract for sum Derived contract for procedure sum. Ensures: (\result == ((long long) n + m)) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:09:51,489 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