./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann04.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann04.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 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:24:03,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:24:03,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:24:03,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:24:03,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:24:03,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:24:03,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:24:03,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:24:03,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:24:03,633 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:24:03,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:24:03,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:24:03,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:24:03,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:24:03,634 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:24:03,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:24:03,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:24:03,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:24:03,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:24:03,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:24:03,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:24:03,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:24:03,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:24:03,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:24:03,640 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:24:03,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:24:03,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:24:03,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:24:03,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:24:03,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:24:03,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:24:03,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:24:03,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:24:03,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:24:03,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:24:03,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:24:03,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:24:03,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:24:03,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:24:03,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:24:03,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:24:03,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:24:03,643 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 -> 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 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 [2024-09-11 20:24:03,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:24:03,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:24:03,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:24:03,841 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:24:03,842 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:24:03,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Ackermann04.c [2024-09-11 20:24:05,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:24:05,248 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:24:05,248 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Ackermann04.c [2024-09-11 20:24:05,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/9f0853512/382cd151e2764ce5bb9e524bc890b438/FLAGa0d1aeb19 [2024-09-11 20:24:05,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/9f0853512/382cd151e2764ce5bb9e524bc890b438 [2024-09-11 20:24:05,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:24:05,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:24:05,654 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:24:05,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:24:05,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:24:05,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a08be66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05, skipping insertion in model container [2024-09-11 20:24:05,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:24:05,813 WARN L247 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/Ackermann04.c[1166,1179] [2024-09-11 20:24:05,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:24:05,824 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:24:05,835 WARN L247 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/Ackermann04.c[1166,1179] [2024-09-11 20:24:05,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:24:05,852 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:24:05,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05 WrapperNode [2024-09-11 20:24:05,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:24:05,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:24:05,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:24:05,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:24:05,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,875 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2024-09-11 20:24:05,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:24:05,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:24:05,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:24:05,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:24:05,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,884 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,892 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-11 20:24:05,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,894 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:24:05,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:24:05,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:24:05,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:24:05,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (1/1) ... [2024-09-11 20:24:05,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:24:05,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:05,982 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-11 20:24:05,986 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-11 20:24:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:24:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:24:06,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:24:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2024-09-11 20:24:06,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2024-09-11 20:24:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:24:06,069 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:24:06,070 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:24:06,152 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-09-11 20:24:06,153 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:24:06,171 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:24:06,171 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:24:06,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:06 BoogieIcfgContainer [2024-09-11 20:24:06,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:24:06,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:24:06,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:24:06,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:24:06,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:24:05" (1/3) ... [2024-09-11 20:24:06,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ace84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:24:06, skipping insertion in model container [2024-09-11 20:24:06,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:24:05" (2/3) ... [2024-09-11 20:24:06,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ace84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:24:06, skipping insertion in model container [2024-09-11 20:24:06,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:06" (3/3) ... [2024-09-11 20:24:06,179 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2024-09-11 20:24:06,192 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:24:06,193 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:24:06,230 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:24:06,238 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;@52d292a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:24:06,238 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:24:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 20:24:06,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-11 20:24:06,247 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:06,248 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:06,250 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:06,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1538870455, now seen corresponding path program 1 times [2024-09-11 20:24:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:06,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157483888] [2024-09-11 20:24:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:06,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:06,499 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-11 20:24:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157483888] [2024-09-11 20:24:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157483888] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:24:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:24:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:24:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701752680] [2024-09-11 20:24:06,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:24:06,505 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:24:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:06,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:24:06,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:24:06,523 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:24:06,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:06,616 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2024-09-11 20:24:06,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:24:06,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-11 20:24:06,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:06,624 INFO L225 Difference]: With dead ends: 47 [2024-09-11 20:24:06,624 INFO L226 Difference]: Without dead ends: 26 [2024-09-11 20:24:06,627 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:24:06,631 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:06,632 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 57 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-11 20:24:06,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-11 20:24:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-11 20:24:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-09-11 20:24:06,665 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 11 [2024-09-11 20:24:06,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:06,665 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-09-11 20:24:06,665 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:24:06,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-09-11 20:24:06,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-11 20:24:06,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:06,667 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:06,668 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:24:06,668 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:06,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:06,668 INFO L85 PathProgramCache]: Analyzing trace with hash -108557995, now seen corresponding path program 1 times [2024-09-11 20:24:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628869524] [2024-09-11 20:24:06,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:06,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:06,715 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:06,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:24:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:06,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628869524] [2024-09-11 20:24:06,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628869524] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:06,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955489076] [2024-09-11 20:24:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:06,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:06,760 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-11 20:24:06,761 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-11 20:24:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:06,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 20:24:06,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:24:06,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:24:06,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955489076] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:06,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:06,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-09-11 20:24:06,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247945614] [2024-09-11 20:24:06,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:06,954 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 20:24:06,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:06,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 20:24:06,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:24:06,956 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-11 20:24:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:07,165 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2024-09-11 20:24:07,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:24:07,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 18 [2024-09-11 20:24:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:07,190 INFO L225 Difference]: With dead ends: 79 [2024-09-11 20:24:07,190 INFO L226 Difference]: Without dead ends: 55 [2024-09-11 20:24:07,191 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-09-11 20:24:07,195 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:07,195 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:24:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-11 20:24:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2024-09-11 20:24:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27) [2024-09-11 20:24:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2024-09-11 20:24:07,220 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 18 [2024-09-11 20:24:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:07,220 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2024-09-11 20:24:07,220 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-11 20:24:07,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2024-09-11 20:24:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-11 20:24:07,224 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:07,224 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:07,242 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:24:07,425 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-11 20:24:07,425 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:07,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:07,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1262121361, now seen corresponding path program 1 times [2024-09-11 20:24:07,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:07,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818760927] [2024-09-11 20:24:07,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:07,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,593 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,697 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,743 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,800 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,808 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:24:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-11 20:24:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818760927] [2024-09-11 20:24:07,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818760927] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865044352] [2024-09-11 20:24:07,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:07,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:07,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:07,816 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-11 20:24:07,822 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-11 20:24:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:07,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 20:24:07,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-09-11 20:24:07,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-11 20:24:08,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865044352] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:08,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:08,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-09-11 20:24:08,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410590877] [2024-09-11 20:24:08,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:08,405 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-11 20:24:08,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:08,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-11 20:24:08,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:24:08,406 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-11 20:24:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:08,491 INFO L93 Difference]: Finished difference Result 119 states and 226 transitions. [2024-09-11 20:24:08,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:24:08,492 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) Word has length 44 [2024-09-11 20:24:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:08,493 INFO L225 Difference]: With dead ends: 119 [2024-09-11 20:24:08,493 INFO L226 Difference]: Without dead ends: 52 [2024-09-11 20:24:08,495 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:24:08,496 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:08,496 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:24:08,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-11 20:24:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-09-11 20:24:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2024-09-11 20:24:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-09-11 20:24:08,506 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 44 [2024-09-11 20:24:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:08,506 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-09-11 20:24:08,506 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) [2024-09-11 20:24:08,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-09-11 20:24:08,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-09-11 20:24:08,508 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:08,508 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:08,522 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-11 20:24:08,712 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-11 20:24:08,713 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:08,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:08,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1396423690, now seen corresponding path program 2 times [2024-09-11 20:24:08,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:08,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429118881] [2024-09-11 20:24:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:08,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:08,910 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:09,017 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:09,093 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:09,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:09,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:09,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:09,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:24:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:09,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:09,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-09-11 20:24:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:09,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-09-11 20:24:09,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:09,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429118881] [2024-09-11 20:24:09,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429118881] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:09,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252378744] [2024-09-11 20:24:09,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:24:09,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:09,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:09,266 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-11 20:24:09,267 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-11 20:24:09,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:24:09,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:24:09,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-11 20:24:09,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:09,385 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-09-11 20:24:09,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-09-11 20:24:10,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252378744] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:10,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:10,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2024-09-11 20:24:10,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502303929] [2024-09-11 20:24:10,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:10,587 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-11 20:24:10,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:10,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-11 20:24:10,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-09-11 20:24:10,588 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2024-09-11 20:24:11,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:11,053 INFO L93 Difference]: Finished difference Result 118 states and 221 transitions. [2024-09-11 20:24:11,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-11 20:24:11,054 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) Word has length 78 [2024-09-11 20:24:11,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:11,056 INFO L225 Difference]: With dead ends: 118 [2024-09-11 20:24:11,057 INFO L226 Difference]: Without dead ends: 70 [2024-09-11 20:24:11,058 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1599, Unknown=0, NotChecked=0, Total=1980 [2024-09-11 20:24:11,058 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:11,059 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 170 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:24:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-09-11 20:24:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2024-09-11 20:24:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2024-09-11 20:24:11,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-09-11 20:24:11,070 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 78 [2024-09-11 20:24:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:11,070 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-09-11 20:24:11,070 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 23 states have internal predecessors, (61), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2024-09-11 20:24:11,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-09-11 20:24:11,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-09-11 20:24:11,073 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:11,074 INFO L216 NwaCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:11,086 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 20:24:11,274 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-11 20:24:11,274 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:11,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2106999360, now seen corresponding path program 3 times [2024-09-11 20:24:11,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:11,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194257715] [2024-09-11 20:24:11,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:11,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,439 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,672 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,675 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:24:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,921 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:24:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,929 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 20:24:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-11 20:24:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 337 proven. 135 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2024-09-11 20:24:11,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:11,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194257715] [2024-09-11 20:24:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194257715] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633271794] [2024-09-11 20:24:11,994 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:24:11,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:11,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:11,995 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-11 20:24:11,997 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-11 20:24:12,072 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-09-11 20:24:12,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:24:12,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-11 20:24:12,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 315 proven. 141 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-09-11 20:24:12,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 357 proven. 126 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-09-11 20:24:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633271794] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:15,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:15,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 25] total 42 [2024-09-11 20:24:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899282040] [2024-09-11 20:24:15,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:15,336 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-11 20:24:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-11 20:24:15,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2024-09-11 20:24:15,338 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 42 states, 42 states have (on average 1.880952380952381) internal successors, (79), 34 states have internal predecessors, (79), 14 states have call successors, (17), 1 states have call predecessors, (17), 18 states have return successors, (30), 20 states have call predecessors, (30), 14 states have call successors, (30) [2024-09-11 20:24:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:16,286 INFO L93 Difference]: Finished difference Result 146 states and 278 transitions. [2024-09-11 20:24:16,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-11 20:24:16,286 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.880952380952381) internal successors, (79), 34 states have internal predecessors, (79), 14 states have call successors, (17), 1 states have call predecessors, (17), 18 states have return successors, (30), 20 states have call predecessors, (30), 14 states have call successors, (30) Word has length 130 [2024-09-11 20:24:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:16,288 INFO L225 Difference]: With dead ends: 146 [2024-09-11 20:24:16,289 INFO L226 Difference]: Without dead ends: 91 [2024-09-11 20:24:16,291 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 274 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1092, Invalid=4760, Unknown=0, NotChecked=0, Total=5852 [2024-09-11 20:24:16,292 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:16,292 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 294 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:24:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-09-11 20:24:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 56. [2024-09-11 20:24:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 39 states have internal predecessors, (44), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (24), 11 states have call predecessors, (24), 9 states have call successors, (24) [2024-09-11 20:24:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 77 transitions. [2024-09-11 20:24:16,303 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 77 transitions. Word has length 130 [2024-09-11 20:24:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:16,304 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 77 transitions. [2024-09-11 20:24:16,304 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.880952380952381) internal successors, (79), 34 states have internal predecessors, (79), 14 states have call successors, (17), 1 states have call predecessors, (17), 18 states have return successors, (30), 20 states have call predecessors, (30), 14 states have call successors, (30) [2024-09-11 20:24:16,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 77 transitions. [2024-09-11 20:24:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-09-11 20:24:16,306 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:16,306 INFO L216 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:16,320 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:24:16,510 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-11 20:24:16,511 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:16,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash -511219076, now seen corresponding path program 4 times [2024-09-11 20:24:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:16,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404118335] [2024-09-11 20:24:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:16,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:16,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:16,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:16,945 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:16,948 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:16,950 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:16,951 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:16,952 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:24:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:16,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,035 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,087 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:24:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 20:24:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-11 20:24:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,184 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,267 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,268 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:24:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,270 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 20:24:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:17,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 445 proven. 284 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2024-09-11 20:24:17,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404118335] [2024-09-11 20:24:17,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404118335] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:17,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233807552] [2024-09-11 20:24:17,273 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 20:24:17,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:17,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:17,276 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-11 20:24:17,280 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-11 20:24:17,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 20:24:17,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:24:17,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-11 20:24:17,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2024-09-11 20:24:17,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:20,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-09-11 20:24:20,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233807552] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:20,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:20,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 27] total 38 [2024-09-11 20:24:20,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541496933] [2024-09-11 20:24:20,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:20,899 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-11 20:24:20,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:20,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-11 20:24:20,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2024-09-11 20:24:20,900 INFO L87 Difference]: Start difference. First operand 56 states and 77 transitions. Second operand has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2024-09-11 20:24:21,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:21,770 INFO L93 Difference]: Finished difference Result 167 states and 321 transitions. [2024-09-11 20:24:21,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-11 20:24:21,771 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) Word has length 156 [2024-09-11 20:24:21,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:21,773 INFO L225 Difference]: With dead ends: 167 [2024-09-11 20:24:21,773 INFO L226 Difference]: Without dead ends: 115 [2024-09-11 20:24:21,775 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 331 SyntacticMatches, 14 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1164, Invalid=4998, Unknown=0, NotChecked=0, Total=6162 [2024-09-11 20:24:21,775 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:21,776 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 248 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:24:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-09-11 20:24:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2024-09-11 20:24:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 12 states have return successors, (46), 19 states have call predecessors, (46), 13 states have call successors, (46) [2024-09-11 20:24:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2024-09-11 20:24:21,817 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 156 [2024-09-11 20:24:21,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:21,818 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2024-09-11 20:24:21,818 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1842105263157894) internal successors, (83), 32 states have internal predecessors, (83), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2024-09-11 20:24:21,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2024-09-11 20:24:21,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-09-11 20:24:21,820 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:21,820 INFO L216 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:21,833 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 20:24:22,024 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-11 20:24:22,025 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:22,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:22,025 INFO L85 PathProgramCache]: Analyzing trace with hash -702272830, now seen corresponding path program 5 times [2024-09-11 20:24:22,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:22,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453255715] [2024-09-11 20:24:22,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:22,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,312 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,391 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:24:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,455 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,499 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,500 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:24:22,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,504 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-09-11 20:24:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,520 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,537 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,541 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:24:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 20:24:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:24:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:22,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 162 proven. 425 refuted. 0 times theorem prover too weak. 659 trivial. 0 not checked. [2024-09-11 20:24:22,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:22,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453255715] [2024-09-11 20:24:22,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453255715] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:22,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407704994] [2024-09-11 20:24:22,546 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 20:24:22,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:22,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:22,548 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-11 20:24:22,549 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-11 20:24:22,676 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-09-11 20:24:22,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:24:22,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-11 20:24:22,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 715 proven. 114 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-09-11 20:24:22,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 165 proven. 425 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2024-09-11 20:24:24,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407704994] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:24,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:24,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 17] total 24 [2024-09-11 20:24:24,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108259041] [2024-09-11 20:24:24,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:24,009 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-11 20:24:24,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:24,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-11 20:24:24,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:24:24,010 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 21 states have internal predecessors, (70), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2024-09-11 20:24:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:24,382 INFO L93 Difference]: Finished difference Result 167 states and 295 transitions. [2024-09-11 20:24:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-11 20:24:24,386 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 21 states have internal predecessors, (70), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) Word has length 156 [2024-09-11 20:24:24,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:24,389 INFO L225 Difference]: With dead ends: 167 [2024-09-11 20:24:24,389 INFO L226 Difference]: Without dead ends: 89 [2024-09-11 20:24:24,391 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 340 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=455, Invalid=1707, Unknown=0, NotChecked=0, Total=2162 [2024-09-11 20:24:24,395 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:24,395 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 167 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:24:24,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-11 20:24:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 76. [2024-09-11 20:24:24,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 12 states have return successors, (42), 19 states have call predecessors, (42), 13 states have call successors, (42) [2024-09-11 20:24:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2024-09-11 20:24:24,421 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 156 [2024-09-11 20:24:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:24,421 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2024-09-11 20:24:24,422 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9166666666666665) internal successors, (70), 21 states have internal predecessors, (70), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2024-09-11 20:24:24,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2024-09-11 20:24:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-09-11 20:24:24,424 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:24,424 INFO L216 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:24,436 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 20:24:24,627 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-11 20:24:24,628 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:24,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1922447937, now seen corresponding path program 6 times [2024-09-11 20:24:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:24,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511893889] [2024-09-11 20:24:24,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:24,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:24,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,073 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:24:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,162 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,263 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:24:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,274 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 20:24:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-11 20:24:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,414 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,445 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:24:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 20:24:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:24:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 502 proven. 372 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2024-09-11 20:24:25,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:25,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511893889] [2024-09-11 20:24:25,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511893889] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:25,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556254900] [2024-09-11 20:24:25,460 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-11 20:24:25,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:25,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:25,462 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-11 20:24:25,463 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-11 20:24:25,643 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2024-09-11 20:24:25,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:24:25,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-11 20:24:25,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-09-11 20:24:25,740 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-09-11 20:24:29,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556254900] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:29,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:29,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 28] total 35 [2024-09-11 20:24:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261353673] [2024-09-11 20:24:29,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:29,007 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-11 20:24:29,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-11 20:24:29,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2024-09-11 20:24:29,008 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand has 35 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2024-09-11 20:24:29,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:29,666 INFO L93 Difference]: Finished difference Result 185 states and 329 transitions. [2024-09-11 20:24:29,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-09-11 20:24:29,667 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 169 [2024-09-11 20:24:29,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:29,668 INFO L225 Difference]: With dead ends: 185 [2024-09-11 20:24:29,668 INFO L226 Difference]: Without dead ends: 113 [2024-09-11 20:24:29,670 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 360 SyntacticMatches, 19 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=993, Invalid=3977, Unknown=0, NotChecked=0, Total=4970 [2024-09-11 20:24:29,671 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:29,671 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 221 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:24:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-09-11 20:24:29,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 86. [2024-09-11 20:24:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 15 states have call successors, (15), 5 states have call predecessors, (15), 14 states have return successors, (53), 23 states have call predecessors, (53), 15 states have call successors, (53) [2024-09-11 20:24:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2024-09-11 20:24:29,684 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 169 [2024-09-11 20:24:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:29,684 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2024-09-11 20:24:29,685 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4) internal successors, (84), 31 states have internal predecessors, (84), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2024-09-11 20:24:29,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2024-09-11 20:24:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-09-11 20:24:29,686 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:24:29,686 INFO L216 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:24:29,702 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 20:24:29,890 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-11 20:24:29,891 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:24:29,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:29,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2140695240, now seen corresponding path program 7 times [2024-09-11 20:24:29,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:24:29,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797346226] [2024-09-11 20:24:29,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:24:29,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:24:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,265 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,281 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,286 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:24:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,300 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:24:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,302 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 20:24:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-09-11 20:24:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,462 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,516 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,605 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:24:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 20:24:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,689 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:24:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 20:24:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 20:24:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-11 20:24:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 686 proven. 70 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2024-09-11 20:24:30,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:30,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797346226] [2024-09-11 20:24:30,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797346226] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:24:30,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525371766] [2024-09-11 20:24:30,725 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-11 20:24:30,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:24:30,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:24:30,726 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-11 20:24:30,728 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-11 20:24:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:24:30,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-11 20:24:30,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:24:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2024-09-11 20:24:31,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:24:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 711 proven. 75 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-09-11 20:24:36,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525371766] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:36,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:24:36,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 38 [2024-09-11 20:24:36,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40088648] [2024-09-11 20:24:36,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:36,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-09-11 20:24:36,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:36,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-09-11 20:24:36,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2024-09-11 20:24:36,428 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2024-09-11 20:24:37,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:37,470 INFO L93 Difference]: Finished difference Result 143 states and 224 transitions. [2024-09-11 20:24:37,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-11 20:24:37,471 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) Word has length 182 [2024-09-11 20:24:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:37,472 INFO L225 Difference]: With dead ends: 143 [2024-09-11 20:24:37,472 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:24:37,474 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 389 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=954, Invalid=4448, Unknown=0, NotChecked=0, Total=5402 [2024-09-11 20:24:37,474 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:37,474 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 186 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:24:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:24:37,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:24:37,475 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-11 20:24:37,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:24:37,475 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2024-09-11 20:24:37,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:37,475 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:24:37,475 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5263157894736843) internal successors, (58), 31 states have internal predecessors, (58), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2024-09-11 20:24:37,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:24:37,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:24:37,478 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:24:37,491 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-11 20:24:37,682 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-11 20:24:37,685 INFO L408 BasicCegarLoop]: Path program histogram: [7, 1, 1] [2024-09-11 20:24:37,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:25:03,674 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:25:03,699 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-11 20:25:03,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:25:03 BoogieIcfgContainer [2024-09-11 20:25:03,703 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:25:03,703 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:25:03,703 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:25:03,703 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:25:03,704 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:24:06" (3/4) ... [2024-09-11 20:25:03,705 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:25:03,711 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2024-09-11 20:25:03,714 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 20:25:03,714 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:25:03,714 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:25:03,715 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:25:03,810 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:25:03,811 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:25:03,811 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:25:03,812 INFO L158 Benchmark]: Toolchain (without parser) took 58157.92ms. Allocated memory was 195.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 127.6MB in the beginning and 812.7MB in the end (delta: -685.0MB). Peak memory consumption was 714.2MB. Max. memory is 16.1GB. [2024-09-11 20:25:03,812 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:25:03,812 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.37ms. Allocated memory is still 195.0MB. Free memory was 127.5MB in the beginning and 116.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:25:03,812 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.61ms. Allocated memory is still 195.0MB. Free memory was 116.3MB in the beginning and 114.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:25:03,812 INFO L158 Benchmark]: Boogie Preprocessor took 21.33ms. Allocated memory is still 195.0MB. Free memory was 114.9MB in the beginning and 113.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:25:03,813 INFO L158 Benchmark]: RCFGBuilder took 255.58ms. Allocated memory is still 195.0MB. Free memory was 168.3MB in the beginning and 157.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:25:03,813 INFO L158 Benchmark]: TraceAbstraction took 57529.31ms. Allocated memory was 195.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 156.8MB in the beginning and 816.9MB in the end (delta: -660.1MB). Peak memory consumption was 963.4MB. Max. memory is 16.1GB. [2024-09-11 20:25:03,813 INFO L158 Benchmark]: Witness Printer took 108.03ms. Allocated memory is still 1.6GB. Free memory was 816.9MB in the beginning and 812.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:25:03,815 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.13ms. Allocated memory is still 109.1MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.37ms. Allocated memory is still 195.0MB. Free memory was 127.5MB in the beginning and 116.3MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.61ms. Allocated memory is still 195.0MB. Free memory was 116.3MB in the beginning and 114.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.33ms. Allocated memory is still 195.0MB. Free memory was 114.9MB in the beginning and 113.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 255.58ms. Allocated memory is still 195.0MB. Free memory was 168.3MB in the beginning and 157.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 57529.31ms. Allocated memory was 195.0MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 156.8MB in the beginning and 816.9MB in the end (delta: -660.1MB). Peak memory consumption was 963.4MB. Max. memory is 16.1GB. * Witness Printer took 108.03ms. Allocated memory is still 1.6GB. Free memory was 816.9MB in the beginning and 812.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 45]: 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 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.5s, OverallIterations: 9, TraceHistogramMax: 27, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 327 mSDsluCounter, 1523 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1305 mSDsCounter, 582 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4620 IncrementalHoareTripleChecker+Invalid, 5202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 582 mSolverCounterUnsat, 218 mSDtfsCounter, 4620 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2474 GetRequests, 1992 SyntacticMatches, 75 SemanticMatches, 407 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5792 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=8, InterpolantAutomatonStates: 257, 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, 9 MinimizatonAttempts, 140 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 1877 NumberOfCodeBlocks, 1761 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 2785 ConstructedInterpolants, 0 QuantifiedInterpolants, 5649 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2532 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 16840/20661 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for ackermann Derived contract for procedure ackermann. Ensures: ((0 < \old(m)) || ((\old(m) == 0) && (((long long) \old(n) + 1) <= \result))) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:25:03,842 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE