./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.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-simple/id2_i5_o5-2.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 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 --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:28:40,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:28:40,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:28:40,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:28:40,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:28:40,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:28:40,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:28:40,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:28:40,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:28:40,489 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:28:40,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:28:40,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:28:40,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:28:40,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:28:40,491 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:28:40,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:28:40,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:28:40,492 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:28:40,493 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:28:40,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:28:40,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:28:40,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:28:40,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:28:40,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:28:40,498 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:28:40,498 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:28:40,499 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:28:40,499 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:28:40,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:28:40,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:28:40,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:28:40,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:28:40,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:28:40,507 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:28:40,507 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:28:40,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:28:40,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:28:40,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:28:40,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:28:40,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:28:40,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:28:40,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:28:40,509 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 -> 9c0fb6a0d32b99c9a776859d2bc15d9177dc584955a2c1baa8ac133e976f40f7 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:28:40,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:28:40,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:28:40,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:28:40,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:28:40,799 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:28:40,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2024-09-11 20:28:42,269 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:28:42,435 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:28:42,436 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_i5_o5-2.c [2024-09-11 20:28:42,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/326f71d54/146fed56270f4b05a8438c7b903f2777/FLAG577089827 [2024-09-11 20:28:42,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/326f71d54/146fed56270f4b05a8438c7b903f2777 [2024-09-11 20:28:42,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:28:42,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:28:42,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:28:42,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:28:42,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:28:42,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181dcd6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42, skipping insertion in model container [2024-09-11 20:28:42,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:28:42,626 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-simple/id2_i5_o5-2.c[548,561] [2024-09-11 20:28:42,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:28:42,641 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:28:42,655 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-simple/id2_i5_o5-2.c[548,561] [2024-09-11 20:28:42,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:28:42,670 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:28:42,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42 WrapperNode [2024-09-11 20:28:42,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:28:42,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:28:42,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:28:42,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:28:42,679 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:28:42" (1/1) ... [2024-09-11 20:28:42,686 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:28:42" (1/1) ... [2024-09-11 20:28:42,703 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2024-09-11 20:28:42,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:28:42,704 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:28:42,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:28:42,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:28:42,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,730 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:28:42,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,736 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:28:42,743 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:28:42,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:28:42,744 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:28:42,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (1/1) ... [2024-09-11 20:28:42,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:28:42,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:42,773 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:28:42,775 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:28:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:28:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:28:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2024-09-11 20:28:42,823 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2024-09-11 20:28:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:28:42,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:28:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-11 20:28:42,823 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-11 20:28:42,873 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:28:42,875 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:28:42,972 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 20:28:42,973 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:28:42,996 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:28:42,996 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:28:42,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:28:42 BoogieIcfgContainer [2024-09-11 20:28:42,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:28:43,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:28:43,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:28:43,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:28:43,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:28:42" (1/3) ... [2024-09-11 20:28:43,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3102e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:28:43, skipping insertion in model container [2024-09-11 20:28:43,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:28:42" (2/3) ... [2024-09-11 20:28:43,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3102e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:28:43, skipping insertion in model container [2024-09-11 20:28:43,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:28:42" (3/3) ... [2024-09-11 20:28:43,007 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2024-09-11 20:28:43,022 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:28:43,022 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:28:43,065 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:28:43,070 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;@7d6956e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:28:43,070 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:28:43,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:28:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 20:28:43,079 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:43,079 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:43,079 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:43,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash -406374326, now seen corresponding path program 1 times [2024-09-11 20:28:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981252316] [2024-09-11 20:28:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:43,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:43,334 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:43,400 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:28:43,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:43,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981252316] [2024-09-11 20:28:43,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981252316] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:28:43,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:28:43,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:28:43,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022535364] [2024-09-11 20:28:43,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:28:43,408 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:28:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:43,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:28:43,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:28:43,437 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:28:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:43,509 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-09-11 20:28:43,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:28:43,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 9 [2024-09-11 20:28:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:43,519 INFO L225 Difference]: With dead ends: 28 [2024-09-11 20:28:43,520 INFO L226 Difference]: Without dead ends: 20 [2024-09-11 20:28:43,522 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:28:43,528 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:43,529 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:28:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-09-11 20:28:43,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-09-11 20:28:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-11 20:28:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-09-11 20:28:43,566 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 9 [2024-09-11 20:28:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:43,567 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-09-11 20:28:43,567 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:28:43,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:43,568 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-09-11 20:28:43,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 20:28:43,570 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:43,570 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:43,571 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:28:43,571 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:43,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash -911562000, now seen corresponding path program 1 times [2024-09-11 20:28:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763476719] [2024-09-11 20:28:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:43,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:43,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:43,847 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:28:43,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:43,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763476719] [2024-09-11 20:28:43,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763476719] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:28:43,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:28:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 20:28:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832064624] [2024-09-11 20:28:43,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:28:43,851 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 20:28:43,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:43,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 20:28:43,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:28:43,855 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:28:43,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:43,958 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2024-09-11 20:28:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:28:43,959 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-09-11 20:28:43,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:43,960 INFO L225 Difference]: With dead ends: 29 [2024-09-11 20:28:43,960 INFO L226 Difference]: Without dead ends: 25 [2024-09-11 20:28:43,961 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:28:43,962 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:43,962 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 51 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-11 20:28:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2024-09-11 20:28:43,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:28:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-09-11 20:28:43,990 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2024-09-11 20:28:43,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:43,991 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-09-11 20:28:43,991 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:28:43,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-09-11 20:28:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 20:28:43,993 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:43,993 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:43,993 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:28:43,994 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:43,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:43,994 INFO L85 PathProgramCache]: Analyzing trace with hash -941711854, now seen corresponding path program 1 times [2024-09-11 20:28:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660432405] [2024-09-11 20:28:43,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:43,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:44,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:44,173 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:44,231 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:28:44,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660432405] [2024-09-11 20:28:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660432405] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:44,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403540722] [2024-09-11 20:28:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:44,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:44,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:44,290 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:28:44,291 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:28:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:44,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 20:28:44,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 20:28:44,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:44,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:28:44,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403540722] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:44,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:44,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2024-09-11 20:28:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244578106] [2024-09-11 20:28:44,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:44,863 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-11 20:28:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:44,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-11 20:28:44,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:28:44,864 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:28:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:44,982 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2024-09-11 20:28:44,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:28:44,982 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) Word has length 21 [2024-09-11 20:28:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:44,983 INFO L225 Difference]: With dead ends: 35 [2024-09-11 20:28:44,983 INFO L226 Difference]: Without dead ends: 31 [2024-09-11 20:28:44,984 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-09-11 20:28:44,985 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:44,986 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 105 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:44,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-11 20:28:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2024-09-11 20:28:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 20:28:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2024-09-11 20:28:44,995 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2024-09-11 20:28:44,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:44,996 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2024-09-11 20:28:44,996 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:28:44,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2024-09-11 20:28:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-11 20:28:45,001 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:45,001 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:45,023 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 20:28:45,201 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:45,202 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:45,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:45,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1503676104, now seen corresponding path program 1 times [2024-09-11 20:28:45,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:45,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707939623] [2024-09-11 20:28:45,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:45,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:45,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:45,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:45,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:45,369 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:28:45,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:45,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707939623] [2024-09-11 20:28:45,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707939623] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:45,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488622220] [2024-09-11 20:28:45,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:45,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:45,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:45,406 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:28:45,408 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:28:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:45,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 20:28:45,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 20:28:45,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 20:28:46,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488622220] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:46,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 18 [2024-09-11 20:28:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148190181] [2024-09-11 20:28:46,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:46,109 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 20:28:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:46,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 20:28:46,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-09-11 20:28:46,110 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 4 states have call predecessors, (11), 9 states have call successors, (11) [2024-09-11 20:28:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:46,217 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2024-09-11 20:28:46,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:28:46,217 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 4 states have call predecessors, (11), 9 states have call successors, (11) Word has length 27 [2024-09-11 20:28:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:46,218 INFO L225 Difference]: With dead ends: 41 [2024-09-11 20:28:46,218 INFO L226 Difference]: Without dead ends: 37 [2024-09-11 20:28:46,219 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:28:46,220 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:46,220 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 90 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-11 20:28:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2024-09-11 20:28:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 20:28:46,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-11 20:28:46,228 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2024-09-11 20:28:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:46,228 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-11 20:28:46,228 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (11), 4 states have call predecessors, (11), 9 states have call successors, (11) [2024-09-11 20:28:46,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-11 20:28:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-11 20:28:46,230 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:46,230 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:46,247 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:28:46,434 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:46,435 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:46,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1206630438, now seen corresponding path program 2 times [2024-09-11 20:28:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:46,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359368085] [2024-09-11 20:28:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:46,512 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:46,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:46,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:46,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:46,674 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:46,708 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:28:46,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:46,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359368085] [2024-09-11 20:28:46,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359368085] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:46,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79029291] [2024-09-11 20:28:46,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:28:46,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:46,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:46,713 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:28:46,714 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:28:46,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:28:46,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:46,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-11 20:28:46,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 20:28:46,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:28:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79029291] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:47,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 19 [2024-09-11 20:28:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143754125] [2024-09-11 20:28:47,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:47,591 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 20:28:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:47,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 20:28:47,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:28:47,595 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) [2024-09-11 20:28:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:47,711 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2024-09-11 20:28:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 20:28:47,712 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) Word has length 33 [2024-09-11 20:28:47,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:47,713 INFO L225 Difference]: With dead ends: 47 [2024-09-11 20:28:47,713 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 20:28:47,713 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 58 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:28:47,714 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:47,714 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 122 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 20:28:47,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2024-09-11 20:28:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 2 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-11 20:28:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2024-09-11 20:28:47,723 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 33 [2024-09-11 20:28:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:47,724 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2024-09-11 20:28:47,724 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) [2024-09-11 20:28:47,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2024-09-11 20:28:47,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-11 20:28:47,725 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:47,725 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:47,740 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:28:47,926 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:47,926 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:47,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:47,927 INFO L85 PathProgramCache]: Analyzing trace with hash -415290496, now seen corresponding path program 2 times [2024-09-11 20:28:47,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:47,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203043350] [2024-09-11 20:28:47,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:47,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:47,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:48,041 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:48,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:48,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:48,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:48,257 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:48,283 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:28:48,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:48,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203043350] [2024-09-11 20:28:48,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203043350] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:48,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144833544] [2024-09-11 20:28:48,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:28:48,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:48,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:48,286 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:28:48,296 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:28:48,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:28:48,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:48,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-11 20:28:48,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:28:48,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:48,559 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-11 20:28:48,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144833544] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:48,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:48,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2024-09-11 20:28:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474902216] [2024-09-11 20:28:48,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:48,561 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:28:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:48,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:28:48,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:28:48,562 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-11 20:28:48,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:48,642 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2024-09-11 20:28:48,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:28:48,643 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2024-09-11 20:28:48,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:48,644 INFO L225 Difference]: With dead ends: 53 [2024-09-11 20:28:48,644 INFO L226 Difference]: Without dead ends: 49 [2024-09-11 20:28:48,644 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:28:48,645 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:48,645 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 372 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:48,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-11 20:28:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2024-09-11 20:28:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-11 20:28:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2024-09-11 20:28:48,663 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 39 [2024-09-11 20:28:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:48,663 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2024-09-11 20:28:48,663 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 6 states have return successors, (6), 6 states have call predecessors, (6), 1 states have call successors, (6) [2024-09-11 20:28:48,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2024-09-11 20:28:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 20:28:48,665 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:48,665 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:48,680 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 20:28:48,867 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:48,867 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:48,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash -841075294, now seen corresponding path program 3 times [2024-09-11 20:28:48,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:48,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389232904] [2024-09-11 20:28:48,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:48,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:48,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:48,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:49,054 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:49,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:49,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:49,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:49,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-11 20:28:49,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:49,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389232904] [2024-09-11 20:28:49,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389232904] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:49,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273369676] [2024-09-11 20:28:49,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:28:49,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:49,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:49,240 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:28:49,242 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:28:49,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-11 20:28:49,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:49,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-11 20:28:49,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:28:49,382 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:28:49,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273369676] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:28:49,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:28:49,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 16 [2024-09-11 20:28:49,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757282629] [2024-09-11 20:28:49,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:28:49,383 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-11 20:28:49,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:49,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-11 20:28:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-09-11 20:28:49,384 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 20:28:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:49,523 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2024-09-11 20:28:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:28:49,524 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2024-09-11 20:28:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:49,525 INFO L225 Difference]: With dead ends: 59 [2024-09-11 20:28:49,525 INFO L226 Difference]: Without dead ends: 35 [2024-09-11 20:28:49,526 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:28:49,526 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:49,527 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 172 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-11 20:28:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-11 20:28:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-11 20:28:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2024-09-11 20:28:49,540 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 45 [2024-09-11 20:28:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:49,540 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2024-09-11 20:28:49,540 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 7 states have return successors, (7), 7 states have call predecessors, (7), 3 states have call successors, (7) [2024-09-11 20:28:49,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2024-09-11 20:28:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-11 20:28:49,542 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:49,542 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:49,557 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 20:28:49,746 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 20:28:49,747 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:49,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:49,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1634140616, now seen corresponding path program 3 times [2024-09-11 20:28:49,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:49,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845204586] [2024-09-11 20:28:49,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:49,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:49,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:28:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:49,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:49,923 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:49,961 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:50,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:50,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:50,051 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:50,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:28:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-11 20:28:50,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845204586] [2024-09-11 20:28:50,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845204586] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:50,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203302209] [2024-09-11 20:28:50,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:28:50,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:50,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:50,100 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:28:50,101 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:28:50,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-11 20:28:50,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:50,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-11 20:28:50,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:50,260 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-09-11 20:28:50,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:28:50,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203302209] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:28:50,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:28:50,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 17 [2024-09-11 20:28:50,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321616545] [2024-09-11 20:28:50,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:28:50,261 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 20:28:50,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:50,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 20:28:50,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:28:50,262 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-11 20:28:50,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:50,387 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-09-11 20:28:50,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:28:50,388 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 51 [2024-09-11 20:28:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:50,388 INFO L225 Difference]: With dead ends: 35 [2024-09-11 20:28:50,389 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:28:50,389 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:28:50,390 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:50,390 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:28:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:28:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:28:50,391 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:28:50,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:28:50,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2024-09-11 20:28:50,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:50,392 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:28:50,392 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 8 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2024-09-11 20:28:50,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:50,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:28:50,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:28:50,395 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:28:50,412 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-11 20:28:50,599 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:50,603 INFO L408 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2024-09-11 20:28:50,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:28:51,707 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:28:51,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:28:51 BoogieIcfgContainer [2024-09-11 20:28:51,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:28:51,731 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:28:51,731 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:28:51,732 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:28:51,732 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:28:42" (3/4) ... [2024-09-11 20:28:51,734 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:28:51,738 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2024-09-11 20:28:51,738 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2024-09-11 20:28:51,741 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 20:28:51,741 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-09-11 20:28:51,741 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:28:51,741 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:28:51,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:28:51,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:28:51,821 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:28:51,821 INFO L158 Benchmark]: Toolchain (without parser) took 9362.15ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 115.4MB in the beginning and 159.4MB in the end (delta: -44.0MB). Peak memory consumption was 42.0MB. Max. memory is 16.1GB. [2024-09-11 20:28:51,821 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 172.0MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:28:51,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.11ms. Allocated memory is still 172.0MB. Free memory was 115.0MB in the beginning and 104.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:28:51,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.20ms. Allocated memory is still 172.0MB. Free memory was 104.1MB in the beginning and 102.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:28:51,822 INFO L158 Benchmark]: Boogie Preprocessor took 37.90ms. Allocated memory is still 172.0MB. Free memory was 102.5MB in the beginning and 101.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:28:51,822 INFO L158 Benchmark]: RCFGBuilder took 254.54ms. Allocated memory is still 172.0MB. Free memory was 100.8MB in the beginning and 89.9MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:28:51,823 INFO L158 Benchmark]: TraceAbstraction took 8730.88ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 89.5MB in the beginning and 163.6MB in the end (delta: -74.1MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. [2024-09-11 20:28:51,823 INFO L158 Benchmark]: Witness Printer took 89.29ms. Allocated memory is still 255.9MB. Free memory was 163.6MB in the beginning and 159.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:28:51,824 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.21ms. Allocated memory is still 172.0MB. Free memory is still 137.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.11ms. Allocated memory is still 172.0MB. Free memory was 115.0MB in the beginning and 104.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.20ms. Allocated memory is still 172.0MB. Free memory was 104.1MB in the beginning and 102.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.90ms. Allocated memory is still 172.0MB. Free memory was 102.5MB in the beginning and 101.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 254.54ms. Allocated memory is still 172.0MB. Free memory was 100.8MB in the beginning and 89.9MB in the end (delta: 10.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8730.88ms. Allocated memory was 172.0MB in the beginning and 255.9MB in the end (delta: 83.9MB). Free memory was 89.5MB in the beginning and 163.6MB in the end (delta: -74.1MB). Peak memory consumption was 101.5MB. Max. memory is 16.1GB. * Witness Printer took 89.29ms. Allocated memory is still 255.9MB. Free memory was 163.6MB in the beginning and 159.4MB 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.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: 23]: 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 3 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 1063 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 917 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 665 IncrementalHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 146 mSDtfsCounter, 665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 480 GetRequests, 347 SyntacticMatches, 13 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=6, InterpolantAutomatonStates: 83, 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, 8 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 1440 SizeOfPredicates, 22 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 295/426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 14]: Procedure Contract for id2 Derived contract for procedure id2. Ensures: ((((((\old(x) == 0) && (\result == 0)) || (\old(x) == 1)) || (((\result == 2) && (\old(x) <= 3)) && (2 <= \old(x)))) || (4 < \old(x))) || (((3 == \old(x)) || (\result == 4)) && (3 <= \old(x)))) - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id. Ensures: ((((((\old(x) == 0) || (\old(x) == 4)) || ((5 == \result) && (5 == \old(x)))) || ((((3 == \result) && (\old(x) <= 4)) || (\old(x) == 2)) && (2 <= \old(x)))) || (((\result == 1) && (\old(x) <= 2)) && (1 <= \old(x)))) || (5 < \old(x))) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:28:51,849 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