./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/recHanoi03-2.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/recHanoi03-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 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:05:23,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:05:23,558 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:05:23,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:05:23,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:05:23,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:05:23,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:05:23,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:05:23,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:05:23,598 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:05:23,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:05:23,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:05:23,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:05:23,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:05:23,603 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:05:23,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:05:23,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:05:23,604 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:05:23,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:05:23,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:05:23,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:05:23,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:05:23,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:05:23,606 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:05:23,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:05:23,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:05:23,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:05:23,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:05:23,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:05:23,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:05:23,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:05:23,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:05:23,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:05:23,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:05:23,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:05:23,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:05:23,610 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:05:23,610 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:05:23,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:05:23,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:05:23,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:05:23,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:05:23,611 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 -> 6256a35b65d93a8e45ad38c9510c3be689a890aeee58265a5723be13a7385a72 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:05:23,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:05:23,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:05:23,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:05:23,903 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:05:23,904 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:05:23,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/recHanoi03-2.c [2024-09-25 00:05:25,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:05:25,913 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:05:25,914 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/recHanoi03-2.c [2024-09-25 00:05:25,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/3b69bdd38/6ecb76ab9826497c8f5595b3de559444/FLAG38d780b30 [2024-09-25 00:05:26,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/3b69bdd38/6ecb76ab9826497c8f5595b3de559444 [2024-09-25 00:05:26,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:05:26,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:05:26,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:05:26,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:05:26,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:05:26,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519d0089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26, skipping insertion in model container [2024-09-25 00:05:26,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:05:26,436 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/recHanoi03-2.c[769,782] [2024-09-25 00:05:26,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:05:26,450 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:05:26,465 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/recHanoi03-2.c[769,782] [2024-09-25 00:05:26,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:05:26,481 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:05:26,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26 WrapperNode [2024-09-25 00:05:26,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:05:26,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:05:26,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:05:26,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:05:26,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,541 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:05:26,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:05:26,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:05:26,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:05:26,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:05:26,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,611 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 00:05:26,612 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,612 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:05:26,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:05:26,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:05:26,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:05:26,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (1/1) ... [2024-09-25 00:05:26,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:05:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:05:26,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 00:05:26,680 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 00:05:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:05:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:05:26,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:05:26,733 INFO L130 BoogieDeclarations]: Found specification of procedure hanoi [2024-09-25 00:05:26,734 INFO L138 BoogieDeclarations]: Found implementation of procedure hanoi [2024-09-25 00:05:26,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:05:26,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:05:26,735 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:05:26,736 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:05:26,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:05:26,796 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:05:26,798 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:05:26,917 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-25 00:05:26,917 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:05:26,936 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:05:26,937 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:05:26,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:05:26 BoogieIcfgContainer [2024-09-25 00:05:26,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:05:26,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:05:26,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:05:26,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:05:26,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:05:26" (1/3) ... [2024-09-25 00:05:26,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a54c019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:05:26, skipping insertion in model container [2024-09-25 00:05:26,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:05:26" (2/3) ... [2024-09-25 00:05:26,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a54c019 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:05:26, skipping insertion in model container [2024-09-25 00:05:26,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:05:26" (3/3) ... [2024-09-25 00:05:26,947 INFO L112 eAbstractionObserver]: Analyzing ICFG recHanoi03-2.c [2024-09-25 00:05:26,974 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:05:26,974 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:05:27,051 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:05:27,061 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;@2229bc44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:05:27,061 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:05:27,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 00:05:27,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 00:05:27,081 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:05:27,086 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:27,087 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:05:27,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:27,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1718689602, now seen corresponding path program 1 times [2024-09-25 00:05:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:05:27,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742320274] [2024-09-25 00:05:27,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:27,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:05:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:27,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:05:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:27,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:05:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:05:27,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:27,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742320274] [2024-09-25 00:05:27,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742320274] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:05:27,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:05:27,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 00:05:27,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964110616] [2024-09-25 00:05:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:05:27,726 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 00:05:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 00:05:27,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:05:27,758 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 00:05:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:27,851 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-09-25 00:05:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 00:05:27,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2024-09-25 00:05:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:27,860 INFO L225 Difference]: With dead ends: 31 [2024-09-25 00:05:27,861 INFO L226 Difference]: Without dead ends: 19 [2024-09-25 00:05:27,864 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 00:05:27,867 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:05:27,868 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 65 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:05:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-25 00:05:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-25 00:05:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-25 00:05:27,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-09-25 00:05:27,906 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2024-09-25 00:05:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:27,906 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-09-25 00:05:27,906 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 00:05:27,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-09-25 00:05:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 00:05:27,909 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:05:27,909 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:27,909 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:05:27,910 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:05:27,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1093446892, now seen corresponding path program 1 times [2024-09-25 00:05:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:05:27,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565185185] [2024-09-25 00:05:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:05:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:28,012 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:05:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:28,023 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:05:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:28,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:05:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:05:28,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:28,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565185185] [2024-09-25 00:05:28,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565185185] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:05:28,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760155704] [2024-09-25 00:05:28,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:28,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:05:28,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:05:28,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:05:28,189 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 00:05:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:28,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 00:05:28,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:05:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 00:05:28,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:05:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 00:05:28,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760155704] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:05:28,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:05:28,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 21 [2024-09-25 00:05:28,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693560324] [2024-09-25 00:05:28,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:05:28,767 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 00:05:28,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:28,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 00:05:28,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2024-09-25 00:05:28,769 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 00:05:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:28,926 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-09-25 00:05:28,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 00:05:28,927 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 20 [2024-09-25 00:05:28,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:28,928 INFO L225 Difference]: With dead ends: 31 [2024-09-25 00:05:28,928 INFO L226 Difference]: Without dead ends: 25 [2024-09-25 00:05:28,929 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2024-09-25 00:05:28,930 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:05:28,930 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 118 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:05:28,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-25 00:05:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-25 00:05:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-25 00:05:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-09-25 00:05:28,937 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2024-09-25 00:05:28,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:28,938 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-09-25 00:05:28,938 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.380952380952381) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 00:05:28,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-09-25 00:05:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 00:05:28,940 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:05:28,940 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:28,959 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:05:29,144 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:05:29,145 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:05:29,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:29,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1513133012, now seen corresponding path program 2 times [2024-09-25 00:05:29,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:05:29,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617693776] [2024-09-25 00:05:29,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:29,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:05:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:29,249 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:05:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:29,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:05:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:29,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:05:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:29,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:05:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:29,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:05:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-25 00:05:29,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617693776] [2024-09-25 00:05:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617693776] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:05:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521945759] [2024-09-25 00:05:29,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:05:29,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:05:29,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:05:29,537 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:05:29,538 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 00:05:29,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:05:29,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:05:29,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-25 00:05:29,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:05:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-25 00:05:29,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:05:31,217 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:05:31,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521945759] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:05:31,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:05:31,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 31 [2024-09-25 00:05:31,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099485445] [2024-09-25 00:05:31,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:05:31,219 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-25 00:05:31,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:31,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-25 00:05:31,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2024-09-25 00:05:31,221 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 21 states have internal predecessors, (41), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2024-09-25 00:05:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:31,525 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-09-25 00:05:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 00:05:31,526 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 21 states have internal predecessors, (41), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) Word has length 32 [2024-09-25 00:05:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:31,527 INFO L225 Difference]: With dead ends: 40 [2024-09-25 00:05:31,528 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 00:05:31,529 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 00:05:31,531 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:05:31,532 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 163 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:05:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 00:05:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-25 00:05:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-25 00:05:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-09-25 00:05:31,545 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2024-09-25 00:05:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:31,546 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-09-25 00:05:31,546 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 21 states have internal predecessors, (41), 6 states have call successors, (8), 1 states have call predecessors, (8), 10 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2024-09-25 00:05:31,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-09-25 00:05:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-25 00:05:31,549 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:05:31,549 INFO L216 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:05:31,566 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:05:31,753 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:05:31,754 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:05:31,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash 642352002, now seen corresponding path program 3 times [2024-09-25 00:05:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:05:31,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62491923] [2024-09-25 00:05:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:05:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:05:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:31,941 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:05:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:31,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-25 00:05:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:32,047 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:05:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:32,132 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:05:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:32,206 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:05:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:32,264 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:05:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:32,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:05:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:32,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 00:05:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:05:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-09-25 00:05:32,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:05:32,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62491923] [2024-09-25 00:05:32,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62491923] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:05:32,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212057537] [2024-09-25 00:05:32,468 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 00:05:32,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:05:32,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:05:32,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:05:32,475 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 00:05:32,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-09-25 00:05:32,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:05:32,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 00:05:32,589 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:05:33,160 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-09-25 00:05:33,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:05:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212057537] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:05:33,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:05:33,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [19] total 35 [2024-09-25 00:05:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470816677] [2024-09-25 00:05:33,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:05:33,162 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-25 00:05:33,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:05:33,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-25 00:05:33,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 00:05:33,167 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 00:05:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:05:33,238 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-09-25 00:05:33,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-25 00:05:33,242 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 2 states have call successors, (8) Word has length 50 [2024-09-25 00:05:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:05:33,243 INFO L225 Difference]: With dead ends: 34 [2024-09-25 00:05:33,243 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:05:33,244 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=1081, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 00:05:33,245 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:05:33,245 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:05:33,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:05:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:05:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-25 00:05:33,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:05:33,248 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2024-09-25 00:05:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:05:33,248 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:05:33,252 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 8 states have return successors, (8), 8 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 00:05:33,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:05:33,253 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:05:33,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:05:33,256 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:05:33,277 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 00:05:33,460 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:05:33,465 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1] [2024-09-25 00:05:33,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:05:33,784 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:05:33,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 12:05:33 BoogieIcfgContainer [2024-09-25 00:05:33,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 00:05:33,810 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 00:05:33,810 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 00:05:33,810 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 00:05:33,810 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:05:26" (3/4) ... [2024-09-25 00:05:33,812 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 00:05:33,863 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 00:05:33,863 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 00:05:33,866 INFO L158 Benchmark]: Toolchain (without parser) took 7594.96ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 89.4MB in the beginning and 114.9MB in the end (delta: -25.5MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2024-09-25 00:05:33,868 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 117.5MB in the beginning and 117.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:05:33,868 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.00ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 78.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 00:05:33,868 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.59ms. Allocated memory is still 159.4MB. Free memory was 78.3MB in the beginning and 131.3MB in the end (delta: -53.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-09-25 00:05:33,868 INFO L158 Benchmark]: Boogie Preprocessor took 80.74ms. Allocated memory is still 159.4MB. Free memory was 131.3MB in the beginning and 129.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:05:33,869 INFO L158 Benchmark]: RCFGBuilder took 310.70ms. Allocated memory is still 159.4MB. Free memory was 129.5MB in the beginning and 117.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 00:05:33,869 INFO L158 Benchmark]: TraceAbstraction took 6869.58ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 117.0MB in the beginning and 117.0MB in the end (delta: 9.4kB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. [2024-09-25 00:05:33,869 INFO L158 Benchmark]: Witness Printer took 53.65ms. Allocated memory is still 224.4MB. Free memory was 117.0MB in the beginning and 114.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:05:33,872 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 117.5MB in the beginning and 117.4MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.00ms. Allocated memory is still 159.4MB. Free memory was 89.2MB in the beginning and 78.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.59ms. Allocated memory is still 159.4MB. Free memory was 78.3MB in the beginning and 131.3MB in the end (delta: -53.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.74ms. Allocated memory is still 159.4MB. Free memory was 131.3MB in the beginning and 129.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 310.70ms. Allocated memory is still 159.4MB. Free memory was 129.5MB in the beginning and 117.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6869.58ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 117.0MB in the beginning and 117.0MB in the end (delta: 9.4kB). Peak memory consumption was 65.8MB. Max. memory is 16.1GB. * Witness Printer took 53.65ms. Allocated memory is still 224.4MB. Free memory was 117.0MB in the beginning and 114.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 35]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 4, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 548 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 480 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 476 IncrementalHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 68 mSDtfsCounter, 476 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 241 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=3, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 927 SizeOfPredicates, 4 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 202/330 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: 18]: Procedure Contract for hanoi Derived contract for procedure hanoi. Ensures: (((((((3 <= \result) && (n <= 2)) || (126 < \result)) || ((((long long) n + 11) <= \result) && (31 <= \result))) || ((\result == 1) && (n == 1))) || ((7 <= \result) && (n <= 3))) || ((15 <= \result) && (n <= 4))) RESULT: Ultimate proved your program to be correct! [2024-09-25 00:05:33,923 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