./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Addition01-2.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/Addition01-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 4af9e26294eb81d37b6ccb692d0b40e4bed5b0d6d3dd72d6af1a80634692c297 --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:23:21,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:23:21,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:23:21,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:23:21,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:23:21,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:23:21,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:23:21,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:23:21,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:23:21,240 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:23:21,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:23:21,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:23:21,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:23:21,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:23:21,243 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:23:21,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:23:21,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:23:21,244 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:23:21,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:23:21,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:23:21,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:23:21,248 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:23:21,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:23:21,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:23:21,249 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:23:21,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:23:21,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:23:21,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:23:21,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:23:21,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:23:21,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:23:21,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:23:21,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:23:21,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:23:21,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:23:21,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:23:21,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:23:21,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:23:21,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:23:21,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:23:21,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:23:21,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:23:21,254 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 -> 4af9e26294eb81d37b6ccb692d0b40e4bed5b0d6d3dd72d6af1a80634692c297 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:23:21,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:23:21,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:23:21,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:23:21,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:23:21,591 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:23:21,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/Addition01-2.c [2024-09-25 11:23:23,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:23:23,331 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:23:23,332 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Addition01-2.c [2024-09-25 11:23:23,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/bc3e71401/423ad083032348a6a97b3559248ad257/FLAG566c51a0d [2024-09-25 11:23:23,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/bc3e71401/423ad083032348a6a97b3559248ad257 [2024-09-25 11:23:23,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:23:23,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:23:23,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:23:23,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:23:23,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:23:23,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@484e26fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23, skipping insertion in model container [2024-09-25 11:23:23,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:23:23,577 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/Addition01-2.c[1126,1139] [2024-09-25 11:23:23,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:23:23,594 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:23:23,609 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/Addition01-2.c[1126,1139] [2024-09-25 11:23:23,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:23:23,628 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:23:23,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23 WrapperNode [2024-09-25 11:23:23,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:23:23,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:23:23,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:23:23,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:23:23,637 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:23:23" (1/1) ... [2024-09-25 11:23:23,642 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:23:23" (1/1) ... [2024-09-25 11:23:23,648 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:23:23,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:23:23,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:23:23,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:23:23,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:23:23,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,683 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:23:23,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:23:23,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:23:23,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:23:23,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:23:23,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (1/1) ... [2024-09-25 11:23:23,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:23:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:23,730 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:23:23,734 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:23:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:23:23,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:23:23,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:23:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:23:23,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:23:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:23:23,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:23:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:23:23,779 INFO L130 BoogieDeclarations]: Found specification of procedure addition [2024-09-25 11:23:23,781 INFO L138 BoogieDeclarations]: Found implementation of procedure addition [2024-09-25 11:23:23,841 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:23:23,843 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:23:24,014 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-09-25 11:23:24,016 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:23:24,041 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:23:24,041 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:23:24,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:23:24 BoogieIcfgContainer [2024-09-25 11:23:24,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:23:24,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:23:24,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:23:24,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:23:24,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:23:23" (1/3) ... [2024-09-25 11:23:24,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5e46aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:23:24, skipping insertion in model container [2024-09-25 11:23:24,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:23:23" (2/3) ... [2024-09-25 11:23:24,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c5e46aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:23:24, skipping insertion in model container [2024-09-25 11:23:24,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:23:24" (3/3) ... [2024-09-25 11:23:24,052 INFO L112 eAbstractionObserver]: Analyzing ICFG Addition01-2.c [2024-09-25 11:23:24,069 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:23:24,069 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:23:24,130 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:23:24,138 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;@541e3485, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:23:24,139 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:23:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 11:23:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-25 11:23:24,151 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:24,152 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:23:24,152 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:24,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:24,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1172000137, now seen corresponding path program 1 times [2024-09-25 11:23:24,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:24,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830392115] [2024-09-25 11:23:24,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:24,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,646 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:23:24,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:24,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830392115] [2024-09-25 11:23:24,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830392115] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:23:24,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:23:24,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 11:23:24,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149459159] [2024-09-25 11:23:24,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:23:24,658 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 11:23:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 11:23:24,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-25 11:23:24,680 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:23:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:24,837 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-09-25 11:23:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 11:23:24,840 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 15 [2024-09-25 11:23:24,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:24,855 INFO L225 Difference]: With dead ends: 38 [2024-09-25 11:23:24,856 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 11:23:24,859 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 11:23:24,864 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:24,864 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 77 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:23:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 11:23:24,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-25 11:23:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 11:23:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-09-25 11:23:24,906 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2024-09-25 11:23:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:24,907 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-09-25 11:23:24,908 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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:23:24,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-09-25 11:23:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-25 11:23:24,911 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:24,911 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:23:24,911 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:23:24,912 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:24,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:24,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1361011760, now seen corresponding path program 1 times [2024-09-25 11:23:24,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:24,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076849684] [2024-09-25 11:23:24,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:24,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,958 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:24,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:24,989 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:23:24,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:24,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076849684] [2024-09-25 11:23:24,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076849684] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:23:24,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:23:24,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 11:23:24,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4681594] [2024-09-25 11:23:24,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:23:24,995 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 11:23:24,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:24,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 11:23:24,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-25 11:23:24,998 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:23:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:25,036 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2024-09-25 11:23:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 11:23:25,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 17 [2024-09-25 11:23:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:25,038 INFO L225 Difference]: With dead ends: 34 [2024-09-25 11:23:25,039 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 11:23:25,039 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-25 11:23:25,040 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:25,041 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 45 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:23:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 11:23:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-09-25 11:23:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 11:23:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-09-25 11:23:25,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 17 [2024-09-25 11:23:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:25,050 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-09-25 11:23:25,050 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:23:25,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-09-25 11:23:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 11:23:25,052 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:25,052 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] [2024-09-25 11:23:25,052 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:23:25,052 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:25,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 398114939, now seen corresponding path program 1 times [2024-09-25 11:23:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:25,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220307835] [2024-09-25 11:23:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,426 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 11:23:25,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220307835] [2024-09-25 11:23:25,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220307835] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:25,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380789593] [2024-09-25 11:23:25,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:25,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:25,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:25,430 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:23:25,433 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:23:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:25,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-25 11:23:25,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:25,736 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 11:23:25,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:26,100 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 11:23:26,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380789593] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:26,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 19 [2024-09-25 11:23:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221202178] [2024-09-25 11:23:26,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:26,102 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-25 11:23:26,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:26,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-25 11:23:26,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-09-25 11:23:26,103 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 11:23:26,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:26,342 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2024-09-25 11:23:26,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 11:23:26,343 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2024-09-25 11:23:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:26,345 INFO L225 Difference]: With dead ends: 38 [2024-09-25 11:23:26,345 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 11:23:26,346 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-09-25 11:23:26,347 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:26,349 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 123 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 11:23:26,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 11:23:26,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 25. [2024-09-25 11:23:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 11:23:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-25 11:23:26,367 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2024-09-25 11:23:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:26,367 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-25 11:23:26,367 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 15 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-25 11:23:26,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-25 11:23:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 11:23:26,373 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:26,373 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] [2024-09-25 11:23:26,391 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:23:26,574 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:26,574 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:26,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:26,575 INFO L85 PathProgramCache]: Analyzing trace with hash -224719989, now seen corresponding path program 1 times [2024-09-25 11:23:26,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:26,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854749085] [2024-09-25 11:23:26,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:26,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:26,615 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:26,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:26,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:23:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:26,678 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:23:26,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:26,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854749085] [2024-09-25 11:23:26,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854749085] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023332718] [2024-09-25 11:23:26,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:26,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:26,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:26,685 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 11:23:26,687 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 11:23:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:26,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 11:23:26,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:23:26,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 11:23:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023332718] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:26,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:26,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-09-25 11:23:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965081134] [2024-09-25 11:23:26,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:26,820 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 11:23:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:26,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 11:23:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:23:26,821 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 11:23:26,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:26,897 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-09-25 11:23:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:23:26,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2024-09-25 11:23:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:26,899 INFO L225 Difference]: With dead ends: 33 [2024-09-25 11:23:26,900 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 11:23:26,900 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:23:26,901 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:26,901 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 11:23:26,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 11:23:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-25 11:23:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-25 11:23:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-09-25 11:23:26,915 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 23 [2024-09-25 11:23:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:26,915 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-09-25 11:23:26,915 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 11:23:26,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-09-25 11:23:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-25 11:23:26,917 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:23:26,917 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 2, 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:23:26,934 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 11:23:27,118 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:27,119 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:23:27,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash -546907673, now seen corresponding path program 1 times [2024-09-25 11:23:27,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:23:27,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258550364] [2024-09-25 11:23:27,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:27,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:23:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:27,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:23:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:27,148 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-25 11:23:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:27,184 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-25 11:23:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:27,217 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-25 11:23:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:23:27,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:23:27,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258550364] [2024-09-25 11:23:27,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258550364] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:23:27,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948146196] [2024-09-25 11:23:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:23:27,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:27,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:23:27,226 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 11:23:27,227 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 11:23:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:23:27,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 11:23:27,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:23:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:23:27,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:23:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 11:23:27,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948146196] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:23:27,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 11:23:27,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 8 [2024-09-25 11:23:27,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309014964] [2024-09-25 11:23:27,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 11:23:27,426 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 11:23:27,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:23:27,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 11:23:27,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-09-25 11:23:27,427 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-25 11:23:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:23:27,488 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-09-25 11:23:27,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-25 11:23:27,488 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 30 [2024-09-25 11:23:27,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:23:27,489 INFO L225 Difference]: With dead ends: 32 [2024-09-25 11:23:27,489 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:23:27,490 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-09-25 11:23:27,491 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 11:23:27,492 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 50 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 11:23:27,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:23:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:23:27,494 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:23:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:23:27,494 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2024-09-25 11:23:27,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:23:27,494 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:23:27,495 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.666666666666667) internal successors, (28), 8 states have internal predecessors, (28), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-25 11:23:27,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:23:27,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:23:27,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:23:27,498 INFO L785 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:23:27,515 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 11:23:27,699 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:23:27,702 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-25 11:23:27,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:23:27,994 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:23:28,010 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:23:28,011 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:23:28,012 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:23:28,012 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:23:28,012 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:23:28,012 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:23:28,013 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:23:28,013 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:23:28,019 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:23:28,019 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:23:28,019 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:23:28,019 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:23:28,021 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:23:28,022 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:23:28,022 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:23:28,022 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:23:28,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 11:23:28 BoogieIcfgContainer [2024-09-25 11:23:28,025 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 11:23:28,025 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 11:23:28,025 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 11:23:28,026 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 11:23:28,026 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:23:24" (3/4) ... [2024-09-25 11:23:28,028 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-25 11:23:28,077 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-25 11:23:28,077 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 11:23:28,078 INFO L158 Benchmark]: Toolchain (without parser) took 4711.46ms. Allocated memory was 67.1MB in the beginning and 111.1MB in the end (delta: 44.0MB). Free memory was 33.7MB in the beginning and 59.8MB in the end (delta: -26.1MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-09-25 11:23:28,078 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 46.1MB. Free memory was 24.2MB in the beginning and 24.2MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:23:28,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.30ms. Allocated memory is still 67.1MB. Free memory was 33.3MB in the beginning and 39.9MB in the end (delta: -6.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-09-25 11:23:28,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.48ms. Allocated memory is still 67.1MB. Free memory was 39.9MB in the beginning and 38.9MB in the end (delta: 951.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:23:28,080 INFO L158 Benchmark]: Boogie Preprocessor took 44.99ms. Allocated memory is still 67.1MB. Free memory was 38.9MB in the beginning and 37.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:23:28,080 INFO L158 Benchmark]: RCFGBuilder took 346.96ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 37.3MB in the beginning and 67.9MB in the end (delta: -30.6MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2024-09-25 11:23:28,080 INFO L158 Benchmark]: TraceAbstraction took 3980.92ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 67.4MB in the beginning and 61.9MB in the end (delta: 5.6MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2024-09-25 11:23:28,081 INFO L158 Benchmark]: Witness Printer took 52.26ms. Allocated memory is still 111.1MB. Free memory was 61.9MB in the beginning and 59.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:23:28,084 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.15ms. Allocated memory is still 46.1MB. Free memory was 24.2MB in the beginning and 24.2MB in the end (delta: 52.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.30ms. Allocated memory is still 67.1MB. Free memory was 33.3MB in the beginning and 39.9MB in the end (delta: -6.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.48ms. Allocated memory is still 67.1MB. Free memory was 39.9MB in the beginning and 38.9MB in the end (delta: 951.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.99ms. Allocated memory is still 67.1MB. Free memory was 38.9MB in the beginning and 37.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 346.96ms. Allocated memory was 67.1MB in the beginning and 92.3MB in the end (delta: 25.2MB). Free memory was 37.3MB in the beginning and 67.9MB in the end (delta: -30.6MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3980.92ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 67.4MB in the beginning and 61.9MB in the end (delta: 5.6MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Witness Printer took 52.26ms. Allocated memory is still 111.1MB. Free memory was 61.9MB in the beginning and 59.8MB 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 357 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 257 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 371 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 100 mSDtfsCounter, 371 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 33, 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, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 683 SizeOfPredicates, 4 NumberOfNonLiveVariables, 255 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 48/63 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: 15]: Procedure Contract for addition Derived contract for procedure addition. Ensures: (((n < 0) || (\result == ((long long) n + m))) || ((n == 0) && (m == \result))) RESULT: Ultimate proved your program to be correct! [2024-09-25 11:23:28,117 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