./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/geo1-ll.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench/geo1-ll.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 a5c5eb3c9193e09fd40ae6ba9f607591e5cae980a2c4d7a02778f7974795107b --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 15:41:55,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 15:41:56,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 15:41:56,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 15:41:56,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 15:41:56,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 15:41:56,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 15:41:56,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 15:41:56,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 15:41:56,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 15:41:56,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 15:41:56,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 15:41:56,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 15:41:56,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 15:41:56,047 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 15:41:56,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 15:41:56,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 15:41:56,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 15:41:56,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 15:41:56,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 15:41:56,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 15:41:56,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 15:41:56,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 15:41:56,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 15:41:56,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 15:41:56,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 15:41:56,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 15:41:56,053 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 15:41:56,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 15:41:56,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 15:41:56,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 15:41:56,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 15:41:56,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:41:56,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 15:41:56,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 15:41:56,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 15:41:56,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 15:41:56,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 15:41:56,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 15:41:56,058 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 15:41:56,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 15:41:56,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 15:41:56,059 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 -> a5c5eb3c9193e09fd40ae6ba9f607591e5cae980a2c4d7a02778f7974795107b Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-12 15:41:56,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 15:41:56,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 15:41:56,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 15:41:56,379 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 15:41:56,379 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 15:41:56,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench/geo1-ll.c [2024-09-12 15:41:57,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 15:41:57,867 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 15:41:57,867 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/geo1-ll.c [2024-09-12 15:41:57,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/3307e4184/1e3760f5cc084a228e23a30745d7533f/FLAG78692e670 [2024-09-12 15:41:57,884 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/3307e4184/1e3760f5cc084a228e23a30745d7533f [2024-09-12 15:41:57,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 15:41:57,887 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 15:41:57,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 15:41:57,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 15:41:57,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 15:41:57,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:41:57" (1/1) ... [2024-09-12 15:41:57,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f760567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:57, skipping insertion in model container [2024-09-12 15:41:57,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 03:41:57" (1/1) ... [2024-09-12 15:41:57,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 15:41:58,045 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/geo1-ll.c[546,559] [2024-09-12 15:41:58,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:41:58,062 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 15:41:58,072 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench/geo1-ll.c[546,559] [2024-09-12 15:41:58,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 15:41:58,092 INFO L204 MainTranslator]: Completed translation [2024-09-12 15:41:58,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58 WrapperNode [2024-09-12 15:41:58,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 15:41:58,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 15:41:58,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 15:41:58,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 15:41:58,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,108 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 15:41:58,108 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 15:41:58,109 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 15:41:58,109 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 15:41:58,109 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 15:41:58,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,133 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-12 15:41:58,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,142 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 15:41:58,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 15:41:58,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 15:41:58,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 15:41:58,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (1/1) ... [2024-09-12 15:41:58,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 15:41:58,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:41:58,173 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-12 15:41:58,175 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-12 15:41:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 15:41:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 15:41:58,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 15:41:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 15:41:58,208 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 15:41:58,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 15:41:58,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 15:41:58,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 15:41:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 15:41:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 15:41:58,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 15:41:58,210 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 15:41:58,260 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 15:41:58,262 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 15:41:58,382 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-12 15:41:58,383 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 15:41:58,405 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 15:41:58,409 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 15:41:58,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:41:58 BoogieIcfgContainer [2024-09-12 15:41:58,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 15:41:58,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 15:41:58,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 15:41:58,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 15:41:58,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 03:41:57" (1/3) ... [2024-09-12 15:41:58,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488fdbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:41:58, skipping insertion in model container [2024-09-12 15:41:58,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 03:41:58" (2/3) ... [2024-09-12 15:41:58,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@488fdbd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 03:41:58, skipping insertion in model container [2024-09-12 15:41:58,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 03:41:58" (3/3) ... [2024-09-12 15:41:58,416 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-ll.c [2024-09-12 15:41:58,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 15:41:58,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 15:41:58,470 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 15:41:58,479 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;@fa6e6cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 15:41:58,479 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 15:41:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-12 15:41:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 15:41:58,487 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:41:58,487 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:41:58,487 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:41:58,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:58,502 INFO L85 PathProgramCache]: Analyzing trace with hash 189409243, now seen corresponding path program 1 times [2024-09-12 15:41:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:41:58,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884920690] [2024-09-12 15:41:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:41:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:58,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:41:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:58,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:41:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:58,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 15:41:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:58,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:41:58,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:41:58,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884920690] [2024-09-12 15:41:58,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884920690] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:41:58,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:41:58,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 15:41:58,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364197199] [2024-09-12 15:41:58,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:41:58,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 15:41:58,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:41:58,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 15:41:58,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:41:58,699 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 15:41:58,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:41:58,719 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2024-09-12 15:41:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 15:41:58,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2024-09-12 15:41:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:41:58,727 INFO L225 Difference]: With dead ends: 48 [2024-09-12 15:41:58,727 INFO L226 Difference]: Without dead ends: 23 [2024-09-12 15:41:58,729 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 15:41:58,732 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:41:58,733 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:41:58,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-12 15:41:58,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-12 15:41:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 15:41:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2024-09-12 15:41:58,764 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2024-09-12 15:41:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:41:58,765 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2024-09-12 15:41:58,765 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 15:41:58,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2024-09-12 15:41:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 15:41:58,769 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:41:58,770 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:41:58,770 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 15:41:58,770 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:41:58,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:58,771 INFO L85 PathProgramCache]: Analyzing trace with hash -141649637, now seen corresponding path program 1 times [2024-09-12 15:41:58,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:41:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598226862] [2024-09-12 15:41:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:41:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 15:41:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [929613782] [2024-09-12 15:41:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:58,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:41:58,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:41:58,799 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-12 15:41:58,801 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-12 15:41:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:58,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 15:41:58,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:41:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:41:58,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 15:41:58,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:41:58,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598226862] [2024-09-12 15:41:58,962 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 15:41:58,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929613782] [2024-09-12 15:41:58,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929613782] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:41:58,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 15:41:58,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 15:41:58,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620185055] [2024-09-12 15:41:58,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:41:58,965 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 15:41:58,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:41:58,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 15:41:58,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 15:41:58,967 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 15:41:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:41:59,012 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-09-12 15:41:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 15:41:59,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-09-12 15:41:59,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:41:59,014 INFO L225 Difference]: With dead ends: 33 [2024-09-12 15:41:59,014 INFO L226 Difference]: Without dead ends: 31 [2024-09-12 15:41:59,014 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 15:41:59,016 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:41:59,016 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:41:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-12 15:41:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2024-09-12 15:41:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 15:41:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-12 15:41:59,025 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2024-09-12 15:41:59,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:41:59,026 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-12 15:41:59,026 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 15:41:59,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-12 15:41:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 15:41:59,027 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:41:59,027 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:41:59,041 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 15:41:59,228 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:41:59,231 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:41:59,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash -426486669, now seen corresponding path program 1 times [2024-09-12 15:41:59,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:41:59,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251135801] [2024-09-12 15:41:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:41:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:59,515 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:41:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:59,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:41:59,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:59,521 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 15:41:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:59,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 15:41:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:41:59,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:41:59,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251135801] [2024-09-12 15:41:59,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251135801] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:41:59,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664178] [2024-09-12 15:41:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:59,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:41:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:41:59,546 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-12 15:41:59,550 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-12 15:41:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:59,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 15:41:59,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:41:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:41:59,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 15:41:59,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664178] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 15:41:59,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 15:41:59,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-09-12 15:41:59,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960229105] [2024-09-12 15:41:59,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 15:41:59,641 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 15:41:59,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:41:59,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 15:41:59,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-09-12 15:41:59,642 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 15:41:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:41:59,676 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-09-12 15:41:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 15:41:59,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-12 15:41:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:41:59,677 INFO L225 Difference]: With dead ends: 38 [2024-09-12 15:41:59,677 INFO L226 Difference]: Without dead ends: 30 [2024-09-12 15:41:59,677 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-09-12 15:41:59,678 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 3 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 15:41:59,678 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 90 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 15:41:59,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-12 15:41:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-12 15:41:59,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 15:41:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-09-12 15:41:59,683 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2024-09-12 15:41:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:41:59,683 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-09-12 15:41:59,683 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 15:41:59,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:59,683 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-09-12 15:41:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 15:41:59,684 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:41:59,684 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:41:59,697 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 15:41:59,888 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:41:59,891 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:41:59,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:41:59,892 INFO L85 PathProgramCache]: Analyzing trace with hash -378523159, now seen corresponding path program 1 times [2024-09-12 15:41:59,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:41:59,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155059536] [2024-09-12 15:41:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:59,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:41:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 15:41:59,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126344409] [2024-09-12 15:41:59,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:41:59,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:41:59,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:41:59,910 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-12 15:41:59,911 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-12 15:41:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:41:59,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-12 15:41:59,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:42:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 15:42:00,082 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:42:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 15:42:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:42:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155059536] [2024-09-12 15:42:04,318 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 15:42:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126344409] [2024-09-12 15:42:04,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126344409] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:42:04,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 15:42:04,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2024-09-12 15:42:04,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041268943] [2024-09-12 15:42:04,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 15:42:04,319 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 15:42:04,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:42:04,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 15:42:04,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2024-09-12 15:42:04,321 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 15:42:09,623 WARN L293 SmtUtils]: Spent 5.11s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 15:42:13,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:42:25,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:42:29,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:42:33,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:42:37,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:42:41,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:42:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:42:41,825 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2024-09-12 15:42:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 15:42:41,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 28 [2024-09-12 15:42:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:42:41,827 INFO L225 Difference]: With dead ends: 48 [2024-09-12 15:42:41,827 INFO L226 Difference]: Without dead ends: 46 [2024-09-12 15:42:41,827 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=43, Invalid=136, Unknown=3, NotChecked=0, Total=182 [2024-09-12 15:42:41,828 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2024-09-12 15:42:41,828 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 122 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 98 Invalid, 6 Unknown, 0 Unchecked, 24.3s Time] [2024-09-12 15:42:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-12 15:42:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-09-12 15:42:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 28 states have internal predecessors, (30), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 15:42:41,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-09-12 15:42:41,838 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 28 [2024-09-12 15:42:41,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:42:41,838 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-09-12 15:42:41,838 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-12 15:42:41,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:42:41,838 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-09-12 15:42:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-12 15:42:41,839 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:42:41,839 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:42:41,863 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 15:42:42,040 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:42:42,040 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:42:42,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:42:42,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1888888859, now seen corresponding path program 1 times [2024-09-12 15:42:42,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:42:42,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136703302] [2024-09-12 15:42:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:42:42,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:42:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:42:42,184 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 15:42:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:42:42,187 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 15:42:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:42:42,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-12 15:42:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:42:42,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 15:42:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:42:42,192 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-12 15:42:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:42:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 15:42:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:42:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136703302] [2024-09-12 15:42:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136703302] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 15:42:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825404299] [2024-09-12 15:42:42,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:42:42,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:42:42,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:42:42,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:42:42,218 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 15:42:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 15:42:42,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 15:42:42,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:42:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 15:42:50,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:42:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 15:42:50,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825404299] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:42:50,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 15:42:50,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2024-09-12 15:42:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261980776] [2024-09-12 15:42:50,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 15:42:50,800 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 15:42:50,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:42:50,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 15:42:50,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=83, Unknown=2, NotChecked=0, Total=110 [2024-09-12 15:42:50,801 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-12 15:42:54,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-12 15:42:59,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-12 15:43:03,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:43:07,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-12 15:43:11,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-09-12 15:43:11,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 15:43:11,645 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2024-09-12 15:43:11,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 15:43:11,645 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2024-09-12 15:43:11,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 15:43:11,648 INFO L225 Difference]: With dead ends: 48 [2024-09-12 15:43:11,648 INFO L226 Difference]: Without dead ends: 40 [2024-09-12 15:43:11,648 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=33, Invalid=97, Unknown=2, NotChecked=0, Total=132 [2024-09-12 15:43:11,649 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2024-09-12 15:43:11,649 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 20.8s Time] [2024-09-12 15:43:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-12 15:43:11,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-09-12 15:43:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-12 15:43:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2024-09-12 15:43:11,665 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 35 [2024-09-12 15:43:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 15:43:11,665 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2024-09-12 15:43:11,665 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-09-12 15:43:11,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:43:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2024-09-12 15:43:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-12 15:43:11,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 15:43:11,668 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 15:43:11,681 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 15:43:11,871 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:43:11,871 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 15:43:11,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 15:43:11,872 INFO L85 PathProgramCache]: Analyzing trace with hash 389439899, now seen corresponding path program 2 times [2024-09-12 15:43:11,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 15:43:11,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343046994] [2024-09-12 15:43:11,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 15:43:11,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 15:43:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-12 15:43:11,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239458102] [2024-09-12 15:43:11,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 15:43:11,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 15:43:11,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 15:43:11,922 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 15:43:11,924 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-12 15:43:12,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 15:43:12,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 15:43:12,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-12 15:43:12,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 15:43:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-12 15:43:12,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 15:43:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 8 proven. 0 refuted. 26 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 15:43:58,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 15:43:58,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343046994] [2024-09-12 15:43:58,579 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 15:43:58,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239458102] [2024-09-12 15:43:58,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239458102] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 15:43:58,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 15:43:58,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-09-12 15:43:58,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131903852] [2024-09-12 15:43:58,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 15:43:58,580 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 15:43:58,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 15:43:58,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 15:43:58,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=295, Unknown=10, NotChecked=0, Total=380 [2024-09-12 15:43:58,581 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 10 states have call predecessors, (13), 11 states have call successors, (13) [2024-09-12 15:44:03,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:44:26,647 WARN L293 SmtUtils]: Spent 21.74s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 15:44:30,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:44:55,432 WARN L293 SmtUtils]: Spent 15.60s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 15:44:59,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:45:03,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:45:07,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:45:11,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:45:37,122 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 15:45:41,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:45:45,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:45:49,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:45:53,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:45:58,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:46:02,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:46:06,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:46:36,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:46:40,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-09-12 15:46:44,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []