./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id2_b2_o3.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id2_b2_o3.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 27149dc6702b40ed508ca85da6c2aa8aa33688ab27cc92cc19b394120cb70fd9 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:27:42,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:27:42,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:27:42,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:27:42,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:27:42,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:27:42,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:27:42,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:27:42,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:27:42,955 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:27:42,955 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:27:42,956 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:27:42,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:27:42,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:27:42,959 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:27:42,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:27:42,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:27:42,960 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:27:42,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:27:42,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:27:42,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:27:42,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:27:42,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:27:42,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:27:42,965 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:27:42,965 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:27:42,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:27:42,966 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:27:42,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:27:42,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:27:42,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:27:42,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:27:42,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:27:42,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:27:42,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:27:42,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:27:42,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:27:42,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:27:42,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:27:42,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:27:42,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:27:42,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:27:42,982 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 -> 27149dc6702b40ed508ca85da6c2aa8aa33688ab27cc92cc19b394120cb70fd9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 11:27:43,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:27:43,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:27:43,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:27:43,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:27:43,327 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:27:43,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-simple/id2_b2_o3.c [2024-09-25 11:27:44,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:27:45,017 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:27:45,017 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b2_o3.c [2024-09-25 11:27:45,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a558dd5a6/c4b912bed06149a4ba65cd8ccca1ff53/FLAG4129202fc [2024-09-25 11:27:45,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a558dd5a6/c4b912bed06149a4ba65cd8ccca1ff53 [2024-09-25 11:27:45,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:27:45,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:27:45,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:27:45,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:27:45,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:27:45,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a03be86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45, skipping insertion in model container [2024-09-25 11:27:45,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:27:45,555 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b2_o3.c[771,784] [2024-09-25 11:27:45,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:27:45,577 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:27:45,593 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-simple/id2_b2_o3.c[771,784] [2024-09-25 11:27:45,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:27:45,609 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:27:45,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45 WrapperNode [2024-09-25 11:27:45,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:27:45,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:27:45,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:27:45,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:27:45,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,639 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:27:45,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:27:45,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:27:45,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:27:45,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:27:45,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,663 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 11:27:45,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,667 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:27:45,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:27:45,676 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:27:45,676 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:27:45,676 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (1/1) ... [2024-09-25 11:27:45,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:27:45,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:45,709 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 11:27:45,724 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 11:27:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:27:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:27:45,761 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:27:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:27:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:27:45,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:27:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2024-09-25 11:27:45,762 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2024-09-25 11:27:45,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:27:45,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:27:45,763 INFO L130 BoogieDeclarations]: Found specification of procedure id [2024-09-25 11:27:45,763 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2024-09-25 11:27:45,828 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:27:45,831 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:27:45,986 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-25 11:27:45,987 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:27:46,011 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:27:46,011 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:27:46,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:27:46 BoogieIcfgContainer [2024-09-25 11:27:46,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:27:46,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:27:46,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:27:46,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:27:46,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:27:45" (1/3) ... [2024-09-25 11:27:46,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d40df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:27:46, skipping insertion in model container [2024-09-25 11:27:46,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:27:45" (2/3) ... [2024-09-25 11:27:46,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28d40df5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:27:46, skipping insertion in model container [2024-09-25 11:27:46,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:27:46" (3/3) ... [2024-09-25 11:27:46,024 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b2_o3.c [2024-09-25 11:27:46,040 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:27:46,040 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:27:46,095 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:27:46,106 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;@366597d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:27:46,106 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:27:46,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 11:27:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 11:27:46,118 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:46,119 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:46,120 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:46,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:46,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1111832961, now seen corresponding path program 1 times [2024-09-25 11:27:46,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:46,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159752842] [2024-09-25 11:27:46,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:46,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:46,374 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:46,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:46,457 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 11:27:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:46,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159752842] [2024-09-25 11:27:46,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159752842] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:27:46,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:27:46,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:27:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148250988] [2024-09-25 11:27:46,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:27:46,466 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:27:46,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:46,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:27:46,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:27:46,485 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 11:27:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:46,544 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-09-25 11:27:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:27:46,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 13 [2024-09-25 11:27:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:46,556 INFO L225 Difference]: With dead ends: 38 [2024-09-25 11:27:46,557 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 11:27:46,559 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:27:46,561 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:46,563 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:27:46,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 11:27:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-25 11:27:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-25 11:27:46,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2024-09-25 11:27:46,596 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2024-09-25 11:27:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:46,596 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2024-09-25 11:27:46,596 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 11:27:46,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:46,597 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2024-09-25 11:27:46,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 11:27:46,598 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:46,599 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:46,599 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:27:46,599 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:46,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:46,600 INFO L85 PathProgramCache]: Analyzing trace with hash 116299484, now seen corresponding path program 1 times [2024-09-25 11:27:46,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:46,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971130873] [2024-09-25 11:27:46,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:46,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:46,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:46,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:46,876 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:27:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:46,937 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 11:27:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:46,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971130873] [2024-09-25 11:27:46,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971130873] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:27:46,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:27:46,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:27:46,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803252765] [2024-09-25 11:27:46,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:27:46,940 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:27:46,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:46,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:27:46,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:27:46,941 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 11:27:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:46,976 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-09-25 11:27:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:27:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-09-25 11:27:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:46,978 INFO L225 Difference]: With dead ends: 42 [2024-09-25 11:27:46,978 INFO L226 Difference]: Without dead ends: 30 [2024-09-25 11:27:46,979 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:27:46,980 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:46,980 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:27:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-25 11:27:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-25 11:27:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 11:27:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-25 11:27:46,992 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2024-09-25 11:27:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:46,993 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-25 11:27:46,993 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 11:27:46,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-25 11:27:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 11:27:46,995 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:46,995 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:46,995 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:27:46,995 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:46,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:46,996 INFO L85 PathProgramCache]: Analyzing trace with hash 144928635, now seen corresponding path program 1 times [2024-09-25 11:27:46,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:46,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178355029] [2024-09-25 11:27:46,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:46,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:27:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,235 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 11:27:47,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:47,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178355029] [2024-09-25 11:27:47,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178355029] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:27:47,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:27:47,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 11:27:47,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082840035] [2024-09-25 11:27:47,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:27:47,237 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 11:27:47,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:47,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 11:27:47,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:27:47,238 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 11:27:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:47,295 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-09-25 11:27:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:27:47,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-09-25 11:27:47,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:47,297 INFO L225 Difference]: With dead ends: 36 [2024-09-25 11:27:47,297 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 11:27:47,297 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:27:47,298 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:47,299 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:27:47,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 11:27:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2024-09-25 11:27:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 11:27:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-09-25 11:27:47,310 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2024-09-25 11:27:47,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:47,311 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-09-25 11:27:47,311 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 11:27:47,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-09-25 11:27:47,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:27:47,314 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:47,314 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:47,322 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 11:27:47,323 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:47,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:47,323 INFO L85 PathProgramCache]: Analyzing trace with hash -439299749, now seen corresponding path program 1 times [2024-09-25 11:27:47,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:47,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273244533] [2024-09-25 11:27:47,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:47,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:27:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,471 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:27:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:27:47,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:47,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273244533] [2024-09-25 11:27:47,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273244533] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:27:47,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:27:47,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 11:27:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301765003] [2024-09-25 11:27:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:27:47,499 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:27:47,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:47,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:27:47,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:27:47,502 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:27:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:47,534 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-09-25 11:27:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:27:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-25 11:27:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:47,536 INFO L225 Difference]: With dead ends: 46 [2024-09-25 11:27:47,536 INFO L226 Difference]: Without dead ends: 34 [2024-09-25 11:27:47,536 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-25 11:27:47,537 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:47,538 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:27:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-25 11:27:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-09-25 11:27:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 11:27:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-09-25 11:27:47,550 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2024-09-25 11:27:47,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:47,551 INFO L474 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-09-25 11:27:47,552 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:27:47,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:47,552 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-09-25 11:27:47,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:27:47,554 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:47,554 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:47,554 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-25 11:27:47,554 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:47,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash -635813254, now seen corresponding path program 1 times [2024-09-25 11:27:47,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:47,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548735920] [2024-09-25 11:27:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:47,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,638 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:27:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,766 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:27:47,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:27:47,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:47,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548735920] [2024-09-25 11:27:47,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548735920] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:27:47,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:27:47,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 11:27:47,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617981579] [2024-09-25 11:27:47,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:27:47,788 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 11:27:47,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:47,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 11:27:47,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:27:47,789 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:27:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:47,846 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2024-09-25 11:27:47,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 11:27:47,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-25 11:27:47,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:47,852 INFO L225 Difference]: With dead ends: 50 [2024-09-25 11:27:47,852 INFO L226 Difference]: Without dead ends: 38 [2024-09-25 11:27:47,852 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:27:47,854 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:47,854 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:27:47,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-25 11:27:47,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-09-25 11:27:47,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 11:27:47,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-09-25 11:27:47,864 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 27 [2024-09-25 11:27:47,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:47,864 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-09-25 11:27:47,864 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:27:47,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-09-25 11:27:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-25 11:27:47,866 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:27:47,866 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:27:47,866 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-25 11:27:47,866 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:27:47,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash -607184103, now seen corresponding path program 1 times [2024-09-25 11:27:47,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:27:47,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347641948] [2024-09-25 11:27:47,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:27:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,955 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:27:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:47,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:27:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:48,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:27:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:48,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-25 11:27:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:48,095 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 11:27:48,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:27:48,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347641948] [2024-09-25 11:27:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347641948] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754073148] [2024-09-25 11:27:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:27:48,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:27:48,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:27:48,099 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 11:27:48,100 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 11:27:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:27:48,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-25 11:27:48,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:27:48,214 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 11:27:48,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:27:48,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 11:27:48,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754073148] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-25 11:27:48,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:27:48,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 11] total 15 [2024-09-25 11:27:48,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133712427] [2024-09-25 11:27:48,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:27:48,359 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 11:27:48,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:27:48,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 11:27:48,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:27:48,360 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:27:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:27:48,384 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-09-25 11:27:48,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:27:48,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-25 11:27:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:27:48,385 INFO L225 Difference]: With dead ends: 38 [2024-09-25 11:27:48,385 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:27:48,386 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-09-25 11:27:48,386 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:27:48,387 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:27:48,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:27:48,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:27:48,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-25 11:27:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:27:48,391 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2024-09-25 11:27:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:27:48,391 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:27:48,392 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-25 11:27:48,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:27:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:27:48,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:27:48,397 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:27:48,415 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 11:27:48,598 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 11:27:48,601 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-25 11:27:48,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:27:48,685 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:27:48,703 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:48,704 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:48,704 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:48,705 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:48,705 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:48,705 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:48,705 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:48,705 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:48,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:48,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:48,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:48,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:48,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:48,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:48,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:48,706 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:48,707 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:48,708 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:27:48,708 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:48,708 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:27:48,709 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:48,709 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:27:48,709 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:48,709 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:27:48,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:27:48 BoogieIcfgContainer [2024-09-25 11:27:48,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:27:48,711 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:27:48,711 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:27:48,711 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:27:48,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:27:46" (3/4) ... [2024-09-25 11:27:48,714 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:27:48,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:27:48,777 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:27:48,778 INFO L158 Benchmark]: Toolchain (without parser) took 3388.13ms. Allocated memory was 65.0MB in the beginning and 107.0MB in the end (delta: 41.9MB). Free memory was 43.6MB in the beginning and 77.7MB in the end (delta: -34.1MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,779 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 65.0MB. Free memory was 39.5MB in the beginning and 39.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:27:48,779 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.67ms. Allocated memory is still 65.0MB. Free memory was 43.3MB in the beginning and 32.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.96ms. Allocated memory is still 65.0MB. Free memory was 32.2MB in the beginning and 31.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,783 INFO L158 Benchmark]: Boogie Preprocessor took 34.52ms. Allocated memory is still 65.0MB. Free memory was 31.1MB in the beginning and 29.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,784 INFO L158 Benchmark]: RCFGBuilder took 336.11ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 29.4MB in the beginning and 58.8MB in the end (delta: -29.4MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,784 INFO L158 Benchmark]: TraceAbstraction took 2696.61ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 58.3MB in the beginning and 79.8MB in the end (delta: -21.5MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,784 INFO L158 Benchmark]: Witness Printer took 66.55ms. Allocated memory is still 107.0MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:27:48,786 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.17ms. Allocated memory is still 65.0MB. Free memory was 39.5MB in the beginning and 39.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.67ms. Allocated memory is still 65.0MB. Free memory was 43.3MB in the beginning and 32.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.96ms. Allocated memory is still 65.0MB. Free memory was 32.2MB in the beginning and 31.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.52ms. Allocated memory is still 65.0MB. Free memory was 31.1MB in the beginning and 29.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 336.11ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 29.4MB in the beginning and 58.8MB in the end (delta: -29.4MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2696.61ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 58.3MB in the beginning and 79.8MB in the end (delta: -21.5MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Witness Printer took 66.55ms. Allocated memory is still 107.0MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid * 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: 27]: 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 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 746 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 590 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 129 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 156 mSDtfsCounter, 129 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=5, InterpolantAutomatonStates: 36, 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, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 330 SizeOfPredicates, 0 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 16/20 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: 9]: Procedure Contract for id Derived contract for procedure id. Ensures: (\result < 3) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:27:48,819 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE