./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.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 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:22:11,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:22:11,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:22:11,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:22:11,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:22:11,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:22:11,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:22:11,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:22:11,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:22:11,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:22:11,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:22:11,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:22:11,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:22:11,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:22:11,924 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:22:11,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:22:11,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:22:11,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:22:11,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:22:11,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:22:11,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:22:11,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:22:11,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:22:11,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:22:11,928 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:22:11,928 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:22:11,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:22:11,928 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:22:11,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:22:11,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:22:11,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:22:11,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:22:11,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:22:11,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:22:11,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:22:11,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:22:11,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:22:11,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:22:11,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:22:11,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:22:11,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:22:11,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:22:11,931 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 -> 1c9e40c4fcbf0a2270c810eae17f30e2b9a539f72a78b9b7061997095813940b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:22:12,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:22:12,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:22:12,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:22:12,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:22:12,136 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:22:12,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2024-09-11 20:22:13,306 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:22:13,517 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:22:13,518 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_valuebound10.c [2024-09-11 20:22:13,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/7b0ce780d/454126c88f7342d3ab67efa99b282d38/FLAG2df799a49 [2024-09-11 20:22:13,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/7b0ce780d/454126c88f7342d3ab67efa99b282d38 [2024-09-11 20:22:13,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:22:13,889 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:22:13,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:22:13,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:22:13,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:22:13,894 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:22:13" (1/1) ... [2024-09-11 20:22:13,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6728a5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:13, skipping insertion in model container [2024-09-11 20:22:13,895 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:22:13" (1/1) ... [2024-09-11 20:22:13,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:22:14,023 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-scaling/ps6-ll_valuebound10.c[458,471] [2024-09-11 20:22:14,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:22:14,051 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:22:14,060 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-scaling/ps6-ll_valuebound10.c[458,471] [2024-09-11 20:22:14,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:22:14,081 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:22:14,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14 WrapperNode [2024-09-11 20:22:14,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:22:14,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:22:14,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:22:14,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:22:14,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,105 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2024-09-11 20:22:14,106 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:22:14,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:22:14,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:22:14,107 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:22:14,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,123 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-11 20:22:14,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,125 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:22:14,132 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:22:14,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:22:14,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:22:14,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (1/1) ... [2024-09-11 20:22:14,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:22:14,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:14,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:22:14,156 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:22:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:22:14,185 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 20:22:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 20:22:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:22:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:22:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:22:14,186 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:22:14,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:22:14,230 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:22:14,232 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:22:14,319 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 20:22:14,319 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:22:14,333 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:22:14,333 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 20:22:14,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:22:14 BoogieIcfgContainer [2024-09-11 20:22:14,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:22:14,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:22:14,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:22:14,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:22:14,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:22:13" (1/3) ... [2024-09-11 20:22:14,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e95796c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:22:14, skipping insertion in model container [2024-09-11 20:22:14,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:22:14" (2/3) ... [2024-09-11 20:22:14,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e95796c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:22:14, skipping insertion in model container [2024-09-11 20:22:14,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:22:14" (3/3) ... [2024-09-11 20:22:14,341 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2024-09-11 20:22:14,352 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:22:14,353 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:22:14,387 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:22:14,392 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;@53485fc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:22:14,392 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:22:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:22:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-11 20:22:14,399 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:14,400 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:14,400 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:14,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:14,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1419667615, now seen corresponding path program 1 times [2024-09-11 20:22:14,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:14,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451534903] [2024-09-11 20:22:14,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:14,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:14,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:22:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:14,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 20:22:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:14,542 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-11 20:22:14,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:22:14,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451534903] [2024-09-11 20:22:14,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451534903] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:22:14,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:22:14,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:22:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145855208] [2024-09-11 20:22:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:22:14,548 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:22:14,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:22:14,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:22:14,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:22:14,569 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:22:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:22:14,592 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2024-09-11 20:22:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:22:14,594 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-09-11 20:22:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:22:14,599 INFO L225 Difference]: With dead ends: 40 [2024-09-11 20:22:14,599 INFO L226 Difference]: Without dead ends: 19 [2024-09-11 20:22:14,602 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-11 20:22:14,606 INFO L434 NwaCegarLoop]: 22 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, 22 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-11 20:22:14,607 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:22:14,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-11 20:22:14,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-11 20:22:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 20:22:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-09-11 20:22:14,636 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2024-09-11 20:22:14,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:22:14,636 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-09-11 20:22:14,636 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:22:14,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:14,637 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-09-11 20:22:14,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-11 20:22:14,639 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:14,639 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:14,639 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:22:14,639 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:14,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1758174245, now seen corresponding path program 1 times [2024-09-11 20:22:14,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:14,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816385877] [2024-09-11 20:22:14,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:14,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:22:14,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [684703083] [2024-09-11 20:22:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:14,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:14,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:14,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:22:14,681 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:22:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:14,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-11 20:22:14,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:22:14,830 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-11 20:22:14,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:22:14,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:22:14,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816385877] [2024-09-11 20:22:14,834 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:22:14,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684703083] [2024-09-11 20:22:14,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684703083] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:22:14,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:22:14,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:22:14,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592121254] [2024-09-11 20:22:14,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:22:14,840 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:22:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:22:14,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:22:14,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:22:14,842 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:22:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:22:14,897 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-09-11 20:22:14,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:22:14,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2024-09-11 20:22:14,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:22:14,906 INFO L225 Difference]: With dead ends: 30 [2024-09-11 20:22:14,906 INFO L226 Difference]: Without dead ends: 26 [2024-09-11 20:22:14,907 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-11 20:22:14,908 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:22:14,911 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:22:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-11 20:22:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-11 20:22:14,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:22:14,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-09-11 20:22:14,923 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2024-09-11 20:22:14,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:22:14,924 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-09-11 20:22:14,924 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:22:14,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:14,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-09-11 20:22:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-11 20:22:14,926 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:14,927 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:14,938 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:22:15,130 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-11 20:22:15,131 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:15,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash -795669560, now seen corresponding path program 1 times [2024-09-11 20:22:15,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:15,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330176790] [2024-09-11 20:22:15,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:15,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:22:15,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [350770816] [2024-09-11 20:22:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:15,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:15,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:15,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:22:15,160 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:22:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:15,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 20:22:15,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:22:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:22:15,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:22:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:22:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:22:15,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330176790] [2024-09-11 20:22:15,345 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:22:15,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350770816] [2024-09-11 20:22:15,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350770816] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-11 20:22:15,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:22:15,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-11 20:22:15,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913715386] [2024-09-11 20:22:15,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:22:15,349 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:22:15,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:22:15,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:22:15,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:22:15,350 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:22:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:22:15,394 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-09-11 20:22:15,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:22:15,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-11 20:22:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:22:15,396 INFO L225 Difference]: With dead ends: 32 [2024-09-11 20:22:15,396 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 20:22:15,396 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:22:15,397 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:22:15,398 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 58 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:22:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 20:22:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 20:22:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:22:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2024-09-11 20:22:15,413 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2024-09-11 20:22:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:22:15,414 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2024-09-11 20:22:15,414 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:22:15,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:15,417 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2024-09-11 20:22:15,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:22:15,417 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:15,418 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:15,431 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 20:22:15,621 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-11 20:22:15,622 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:15,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1266135666, now seen corresponding path program 1 times [2024-09-11 20:22:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:15,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941372607] [2024-09-11 20:22:15,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:15,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:22:15,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1993345497] [2024-09-11 20:22:15,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:15,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:15,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:15,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:22:15,660 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 20:22:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:22:15,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-11 20:22:15,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:22:15,843 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 20:22:15,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:22:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 20:22:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:22:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941372607] [2024-09-11 20:22:16,277 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:22:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993345497] [2024-09-11 20:22:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993345497] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:22:16,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:22:16,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2024-09-11 20:22:16,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623708505] [2024-09-11 20:22:16,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:22:16,279 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:22:16,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:22:16,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:22:16,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:22:16,280 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 9 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-11 20:22:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:22:16,524 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-09-11 20:22:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:22:16,525 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 9 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2024-09-11 20:22:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:22:16,526 INFO L225 Difference]: With dead ends: 49 [2024-09-11 20:22:16,526 INFO L226 Difference]: Without dead ends: 41 [2024-09-11 20:22:16,526 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-09-11 20:22:16,527 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:22:16,527 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 140 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:22:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-09-11 20:22:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-09-11 20:22:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:22:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-09-11 20:22:16,540 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 35 [2024-09-11 20:22:16,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:22:16,540 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-09-11 20:22:16,541 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 12 states have internal predecessors, (25), 9 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-09-11 20:22:16,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2024-09-11 20:22:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-11 20:22:16,544 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:16,544 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:16,557 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 20:22:16,745 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-11 20:22:16,745 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:16,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:16,746 INFO L85 PathProgramCache]: Analyzing trace with hash 459274687, now seen corresponding path program 2 times [2024-09-11 20:22:16,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:16,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423983665] [2024-09-11 20:22:16,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:16,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:22:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [392472633] [2024-09-11 20:22:16,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:22:16,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:16,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:16,773 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:22:16,774 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 20:22:16,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:22:16,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:22:16,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 20:22:16,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:22:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 15 proven. 30 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-09-11 20:22:17,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:22:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-09-11 20:22:17,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:22:17,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423983665] [2024-09-11 20:22:17,217 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:22:17,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392472633] [2024-09-11 20:22:17,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392472633] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:22:17,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:22:17,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2024-09-11 20:22:17,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310183854] [2024-09-11 20:22:17,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:22:17,217 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 20:22:17,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:22:17,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 20:22:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:22:17,218 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-11 20:22:17,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:22:17,591 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2024-09-11 20:22:17,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-11 20:22:17,592 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) Word has length 56 [2024-09-11 20:22:17,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:22:17,593 INFO L225 Difference]: With dead ends: 66 [2024-09-11 20:22:17,594 INFO L226 Difference]: Without dead ends: 58 [2024-09-11 20:22:17,595 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2024-09-11 20:22:17,595 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 19 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:22:17,595 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 284 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:22:17,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-11 20:22:17,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-09-11 20:22:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-11 20:22:17,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-09-11 20:22:17,618 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 56 [2024-09-11 20:22:17,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:22:17,619 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-09-11 20:22:17,619 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 13 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (15), 14 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-11 20:22:17,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:17,619 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-09-11 20:22:17,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-09-11 20:22:17,621 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:22:17,621 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:22:17,633 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 20:22:17,824 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-11 20:22:17,825 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:22:17,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:22:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1077833742, now seen corresponding path program 3 times [2024-09-11 20:22:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:22:17,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308096305] [2024-09-11 20:22:17,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:22:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:22:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:22:17,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451710410] [2024-09-11 20:22:17,897 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:22:17,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:22:17,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:22:17,899 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:22:17,900 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 20:22:18,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-09-11 20:22:18,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:22:18,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-11 20:22:18,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:22:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 30 proven. 157 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-09-11 20:22:18,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:22:26,499 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 6) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 6))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2024-09-11 20:22:34,535 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:22:42,563 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:23:02,610 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:23:06,623 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44|))) (or (= 0 (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6) .cse0) 12)) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| 6)) (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6)))))) (not (= |c___VERIFIER_assert_#in~cond| 0))) is different from true [2024-09-11 20:23:22,663 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:23:38,702 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-11 20:23:42,710 WARN L876 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44|))) (or (= 0 (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 7) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6) .cse0) 12)) (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_31| 6)) (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_44| 6)))))) (not (= |c___VERIFIER_assert_#in~cond| 0)) (= c___VERIFIER_assert_~cond 0)) is different from true [2024-09-11 20:23:54,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 7)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 7) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2024-09-11 20:24:10,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 8)) (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 8))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2024-09-11 20:24:26,918 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 9)) (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 9))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2024-09-11 20:24:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 30 proven. 51 refuted. 21 times theorem prover too weak. 194 trivial. 85 not checked. [2024-09-11 20:24:34,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:24:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308096305] [2024-09-11 20:24:34,961 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:24:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451710410] [2024-09-11 20:24:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451710410] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:24:34,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:24:34,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2024-09-11 20:24:34,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298791792] [2024-09-11 20:24:34,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:24:34,962 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-11 20:24:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:24:34,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-11 20:24:34,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=545, Unknown=6, NotChecked=318, Total=992 [2024-09-11 20:24:34,963 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 32 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 23 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2024-09-11 20:24:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:24:35,452 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2024-09-11 20:24:35,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-11 20:24:35,453 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 23 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Word has length 91 [2024-09-11 20:24:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:24:35,454 INFO L225 Difference]: With dead ends: 61 [2024-09-11 20:24:35,454 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:24:35,455 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 150 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 24.5s TimeCoverageRelationStatistics Valid=239, Invalid=1111, Unknown=6, NotChecked=450, Total=1806 [2024-09-11 20:24:35,456 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 283 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:24:35,457 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 573 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 437 Invalid, 0 Unknown, 283 Unchecked, 0.2s Time] [2024-09-11 20:24:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:24:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:24:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:24:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:24:35,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2024-09-11 20:24:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:24:35,459 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:24:35,459 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 23 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2024-09-11 20:24:35,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:24:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:24:35,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:24:35,461 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:24:35,478 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 20:24:35,662 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 20:24:35,665 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-09-11 20:24:35,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:24:36,522 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:24:36,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:24:36 BoogieIcfgContainer [2024-09-11 20:24:36,539 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:24:36,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:24:36,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:24:36,539 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:24:36,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:22:14" (3/4) ... [2024-09-11 20:24:36,541 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:24:36,544 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-11 20:24:36,544 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 20:24:36,547 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-11 20:24:36,547 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:24:36,548 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:24:36,548 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:24:36,613 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:24:36,614 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:24:36,614 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:24:36,614 INFO L158 Benchmark]: Toolchain (without parser) took 142725.17ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 104.9MB in the beginning and 84.2MB in the end (delta: 20.8MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2024-09-11 20:24:36,614 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:24:36,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.64ms. Allocated memory is still 136.3MB. Free memory was 104.9MB in the beginning and 92.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:24:36,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.90ms. Allocated memory is still 136.3MB. Free memory was 92.6MB in the beginning and 91.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:24:36,615 INFO L158 Benchmark]: Boogie Preprocessor took 25.16ms. Allocated memory is still 136.3MB. Free memory was 91.1MB in the beginning and 89.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:24:36,615 INFO L158 Benchmark]: RCFGBuilder took 201.55ms. Allocated memory is still 136.3MB. Free memory was 89.0MB in the beginning and 77.6MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:24:36,615 INFO L158 Benchmark]: TraceAbstraction took 142203.86ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 76.9MB in the beginning and 88.3MB in the end (delta: -11.4MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. [2024-09-11 20:24:36,615 INFO L158 Benchmark]: Witness Printer took 74.57ms. Allocated memory is still 178.3MB. Free memory was 88.3MB in the beginning and 84.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:24:36,616 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 136.3MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.64ms. Allocated memory is still 136.3MB. Free memory was 104.9MB in the beginning and 92.6MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.90ms. Allocated memory is still 136.3MB. Free memory was 92.6MB in the beginning and 91.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.16ms. Allocated memory is still 136.3MB. Free memory was 91.1MB in the beginning and 89.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 201.55ms. Allocated memory is still 136.3MB. Free memory was 89.0MB in the beginning and 77.6MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 142203.86ms. Allocated memory was 136.3MB in the beginning and 178.3MB in the end (delta: 41.9MB). Free memory was 76.9MB in the beginning and 88.3MB in the end (delta: -11.4MB). Peak memory consumption was 76.1MB. Max. memory is 16.1GB. * Witness Printer took 74.57ms. Allocated memory is still 178.3MB. Free memory was 88.3MB in the beginning and 84.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 141.3s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 1139 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 283 IncrementalHoareTripleChecker+Unchecked, 1009 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 825 IncrementalHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 130 mSDtfsCounter, 825 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 354 SyntacticMatches, 8 SemanticMatches, 97 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 25.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=5, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 138.2s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 436 ConstructedInterpolants, 3 QuantifiedInterpolants, 2676 SizeOfPredicates, 11 NumberOfNonLiveVariables, 597 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 660/1048 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 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((y + ((__int128) y * y)) == (c + ((__int128) c * y))) && ((((__int128) c * y) + ((__int128) 3 * c)) == (((__int128) 3 * y) + ((__int128) y * y)))) && ((((6 * (((((__int128) y * y) * y) * y) * y)) + (2 * ((((((__int128) y * y) * y) * y) * y) * y))) + (5 * ((((__int128) y * y) * y) * y))) == (((__int128) x * 12) + ((__int128) y * y)))) && ((((__int128) k * y) == ((__int128) y * y)) || (c < k))) && (k <= 256)) - InvariantResult [Line: 40]: Location Invariant Derived location invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 9]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (1 <= \old(cond)) Ensures: (1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2024-09-11 20:24:36,649 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE