./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.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/hard-u_valuebound1.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 2205701c87619eed0a8a76ebf684289d4e97e42556aa5e531d0e97f394ad4619 --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:08:32,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:08:32,154 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:08:32,159 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:08:32,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:08:32,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:08:32,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:08:32,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:08:32,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:08:32,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:08:32,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:08:32,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:08:32,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:08:32,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:08:32,212 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:08:32,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:08:32,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:08:32,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:08:32,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:08:32,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:08:32,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:08:32,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:08:32,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:08:32,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:08:32,218 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:08:32,218 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:08:32,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:08:32,219 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:08:32,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:08:32,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:08:32,219 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:08:32,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:08:32,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:08:32,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:08:32,220 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:08:32,220 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:08:32,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:08:32,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:08:32,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:08:32,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:08:32,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:08:32,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:08:32,223 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 -> 2205701c87619eed0a8a76ebf684289d4e97e42556aa5e531d0e97f394ad4619 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:08:32,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:08:32,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:08:32,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:08:32,524 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:08:32,524 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:08:32,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2024-09-11 20:08:33,891 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:08:34,086 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:08:34,087 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2024-09-11 20:08:34,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/95da04bc2/f4a5d84adbb64978a6822c9298c2dab7/FLAG683c6ecfe [2024-09-11 20:08:34,114 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/95da04bc2/f4a5d84adbb64978a6822c9298c2dab7 [2024-09-11 20:08:34,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:08:34,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:08:34,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:08:34,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:08:34,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:08:34,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c6c8c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34, skipping insertion in model container [2024-09-11 20:08:34,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,149 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:08:34,316 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/hard-u_valuebound1.c[537,550] [2024-09-11 20:08:34,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:08:34,350 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:08:34,360 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/hard-u_valuebound1.c[537,550] [2024-09-11 20:08:34,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:08:34,392 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:08:34,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34 WrapperNode [2024-09-11 20:08:34,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:08:34,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:08:34,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:08:34,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:08:34,401 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:08:34" (1/1) ... [2024-09-11 20:08:34,406 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:08:34" (1/1) ... [2024-09-11 20:08:34,422 INFO L138 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-09-11 20:08:34,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:08:34,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:08:34,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:08:34,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:08:34,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,453 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:08:34,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,454 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,465 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:08:34,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:08:34,469 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:08:34,469 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:08:34,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (1/1) ... [2024-09-11 20:08:34,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:08:34,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:34,504 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:08:34,512 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:08:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:08:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 20:08:34,549 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 20:08:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:08:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:08:34,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:08:34,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 20:08:34,549 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 20:08:34,605 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:08:34,607 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:08:34,756 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 20:08:34,756 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:08:34,795 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:08:34,795 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-11 20:08:34,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:08:34 BoogieIcfgContainer [2024-09-11 20:08:34,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:08:34,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:08:34,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:08:34,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:08:34,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:08:34" (1/3) ... [2024-09-11 20:08:34,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64571955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:08:34, skipping insertion in model container [2024-09-11 20:08:34,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:08:34" (2/3) ... [2024-09-11 20:08:34,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64571955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:08:34, skipping insertion in model container [2024-09-11 20:08:34,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:08:34" (3/3) ... [2024-09-11 20:08:34,811 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound1.c [2024-09-11 20:08:34,835 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:08:34,836 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:08:34,901 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:08:34,910 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;@1a6d47cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:08:34,912 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:08:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-11 20:08:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:08:34,930 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:34,931 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:34,932 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:34,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash 760957734, now seen corresponding path program 1 times [2024-09-11 20:08:34,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:34,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560804042] [2024-09-11 20:08:34,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:34,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:35,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:08:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:35,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:08:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:35,106 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:08:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:08:35,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:35,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560804042] [2024-09-11 20:08:35,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560804042] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:08:35,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:08:35,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 20:08:35,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417333098] [2024-09-11 20:08:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:08:35,120 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 20:08:35,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:35,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 20:08:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 20:08:35,139 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:08:35,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:35,167 INFO L93 Difference]: Finished difference Result 58 states and 99 transitions. [2024-09-11 20:08:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 20:08:35,169 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-11 20:08:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:35,176 INFO L225 Difference]: With dead ends: 58 [2024-09-11 20:08:35,177 INFO L226 Difference]: Without dead ends: 28 [2024-09-11 20:08:35,180 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:08:35,182 INFO L434 NwaCegarLoop]: 38 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, 38 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:08:35,183 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:08:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-11 20:08:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-09-11 20:08:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:08:35,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2024-09-11 20:08:35,213 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 23 [2024-09-11 20:08:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:35,214 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2024-09-11 20:08:35,214 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 20:08:35,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2024-09-11 20:08:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-11 20:08:35,216 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:35,216 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:35,217 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:08:35,217 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:35,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:35,217 INFO L85 PathProgramCache]: Analyzing trace with hash -387749596, now seen corresponding path program 1 times [2024-09-11 20:08:35,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:35,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960722564] [2024-09-11 20:08:35,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:35,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:35,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:08:35,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:35,474 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:08:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:35,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:08:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:08:35,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960722564] [2024-09-11 20:08:35,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960722564] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:08:35,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:08:35,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:08:35,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667882275] [2024-09-11 20:08:35,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:08:35,498 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:08:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:08:35,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:08:35,502 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:08:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:35,564 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-09-11 20:08:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:08:35,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-11 20:08:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:35,566 INFO L225 Difference]: With dead ends: 41 [2024-09-11 20:08:35,566 INFO L226 Difference]: Without dead ends: 39 [2024-09-11 20:08:35,567 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:08:35,568 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:35,568 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 119 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:08:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-11 20:08:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-09-11 20:08:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:08:35,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2024-09-11 20:08:35,579 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 23 [2024-09-11 20:08:35,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:35,580 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2024-09-11 20:08:35,580 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:08:35,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:35,581 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2024-09-11 20:08:35,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:08:35,582 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:35,582 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:35,582 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:08:35,583 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:35,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1391236353, now seen corresponding path program 1 times [2024-09-11 20:08:35,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:35,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643915421] [2024-09-11 20:08:35,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:35,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:36,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:08:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:36,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:08:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:36,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:08:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:36,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:08:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:08:36,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:36,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643915421] [2024-09-11 20:08:36,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643915421] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:08:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:08:36,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:08:36,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873572315] [2024-09-11 20:08:36,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:08:36,064 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:08:36,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:36,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:08:36,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:08:36,067 INFO L87 Difference]: Start difference. First operand 32 states and 41 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:08:36,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:36,199 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2024-09-11 20:08:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:08:36,201 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-11 20:08:36,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:36,203 INFO L225 Difference]: With dead ends: 45 [2024-09-11 20:08:36,203 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 20:08:36,203 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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:08:36,204 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:36,206 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:08:36,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 20:08:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-09-11 20:08:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:08:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-09-11 20:08:36,224 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 28 [2024-09-11 20:08:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:36,225 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-09-11 20:08:36,225 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 20:08:36,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:36,225 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-09-11 20:08:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-11 20:08:36,227 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:36,227 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:36,227 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:08:36,227 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:36,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash 831418820, now seen corresponding path program 1 times [2024-09-11 20:08:36,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:36,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414032567] [2024-09-11 20:08:36,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:36,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:08:36,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [830886909] [2024-09-11 20:08:36,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:36,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:36,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:36,269 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:08:36,271 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:08:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:36,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-11 20:08:36,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 20:08:36,548 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 20:08:36,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:36,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414032567] [2024-09-11 20:08:36,549 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:08:36,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830886909] [2024-09-11 20:08:36,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830886909] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:08:36,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:08:36,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-11 20:08:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451644038] [2024-09-11 20:08:36,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:08:36,553 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 20:08:36,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 20:08:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:08:36,554 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:08:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:36,785 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-09-11 20:08:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:08:36,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 33 [2024-09-11 20:08:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:36,787 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:08:36,788 INFO L226 Difference]: Without dead ends: 49 [2024-09-11 20:08:36,789 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-09-11 20:08:36,789 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:36,790 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 157 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:08:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-11 20:08:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-11 20:08:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:08:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-09-11 20:08:36,805 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 33 [2024-09-11 20:08:36,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:36,806 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-09-11 20:08:36,806 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-11 20:08:36,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-09-11 20:08:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 20:08:36,807 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:36,807 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:36,826 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-11 20:08:37,011 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:37,012 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:37,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:37,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1016562388, now seen corresponding path program 1 times [2024-09-11 20:08:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487195932] [2024-09-11 20:08:37,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:37,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:08:37,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319357574] [2024-09-11 20:08:37,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:37,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:37,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:37,043 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:08:37,046 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:08:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:37,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-11 20:08:37,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:08:37,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-11 20:08:38,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:38,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487195932] [2024-09-11 20:08:38,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:08:38,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319357574] [2024-09-11 20:08:38,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319357574] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:08:38,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:08:38,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2024-09-11 20:08:38,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447024270] [2024-09-11 20:08:38,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:38,505 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 20:08:38,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:38,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 20:08:38,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:08:38,506 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-11 20:08:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:40,150 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-09-11 20:08:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:08:40,151 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) Word has length 40 [2024-09-11 20:08:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:40,153 INFO L225 Difference]: With dead ends: 67 [2024-09-11 20:08:40,153 INFO L226 Difference]: Without dead ends: 59 [2024-09-11 20:08:40,153 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:08:40,154 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:40,155 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-09-11 20:08:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-11 20:08:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-09-11 20:08:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-11 20:08:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2024-09-11 20:08:40,174 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 40 [2024-09-11 20:08:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:40,174 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2024-09-11 20:08:40,174 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 12 states have internal predecessors, (27), 7 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-11 20:08:40,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2024-09-11 20:08:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:08:40,176 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:40,176 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 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:08:40,191 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:08:40,380 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:40,381 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:40,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:40,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1147651331, now seen corresponding path program 1 times [2024-09-11 20:08:40,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:40,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655474386] [2024-09-11 20:08:40,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:40,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:08:40,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [485828634] [2024-09-11 20:08:40,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:40,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:40,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:40,431 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:08:40,433 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:08:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:40,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 20:08:40,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 26 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-11 20:08:40,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-09-11 20:08:41,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:41,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655474386] [2024-09-11 20:08:41,545 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:08:41,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485828634] [2024-09-11 20:08:41,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485828634] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:08:41,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:08:41,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-09-11 20:08:41,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549596320] [2024-09-11 20:08:41,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:41,546 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 20:08:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 20:08:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:08:41,550 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-11 20:08:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:42,834 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2024-09-11 20:08:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:08:42,835 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 5 states have call successors, (16) Word has length 50 [2024-09-11 20:08:42,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:42,836 INFO L225 Difference]: With dead ends: 86 [2024-09-11 20:08:42,836 INFO L226 Difference]: Without dead ends: 78 [2024-09-11 20:08:42,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:08:42,837 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 41 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:42,841 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 201 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-09-11 20:08:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-11 20:08:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-09-11 20:08:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 50 states have internal predecessors, (52), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-11 20:08:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 95 transitions. [2024-09-11 20:08:42,867 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 95 transitions. Word has length 50 [2024-09-11 20:08:42,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:42,868 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 95 transitions. [2024-09-11 20:08:42,868 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 7 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 9 states have call predecessors, (16), 5 states have call successors, (16) [2024-09-11 20:08:42,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 95 transitions. [2024-09-11 20:08:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-11 20:08:42,870 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:42,870 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:42,877 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 20:08:43,074 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-11 20:08:43,075 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:43,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1282123871, now seen corresponding path program 1 times [2024-09-11 20:08:43,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:43,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557117645] [2024-09-11 20:08:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:43,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:08:43,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324444283] [2024-09-11 20:08:43,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:43,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:43,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:43,129 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:08:43,131 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:08:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:43,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-11 20:08:43,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 32 proven. 33 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-09-11 20:08:44,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557117645] [2024-09-11 20:08:46,022 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:08:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324444283] [2024-09-11 20:08:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324444283] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:08:46,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:08:46,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-09-11 20:08:46,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665589835] [2024-09-11 20:08:46,023 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:46,023 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:08:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:46,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:08:46,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:08:46,024 INFO L87 Difference]: Start difference. First operand 78 states and 95 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 13 states have internal predecessors, (26), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-11 20:08:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:46,386 INFO L93 Difference]: Finished difference Result 129 states and 155 transitions. [2024-09-11 20:08:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:08:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 13 states have internal predecessors, (26), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 70 [2024-09-11 20:08:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:46,390 INFO L225 Difference]: With dead ends: 129 [2024-09-11 20:08:46,391 INFO L226 Difference]: Without dead ends: 90 [2024-09-11 20:08:46,392 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:08:46,393 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:46,395 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 211 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:08:46,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-11 20:08:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2024-09-11 20:08:46,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-11 20:08:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2024-09-11 20:08:46,438 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 70 [2024-09-11 20:08:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:46,441 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2024-09-11 20:08:46,441 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 13 states have internal predecessors, (26), 6 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2024-09-11 20:08:46,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2024-09-11 20:08:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-11 20:08:46,442 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:46,443 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:46,451 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:08:46,643 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:46,644 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:46,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1411586487, now seen corresponding path program 1 times [2024-09-11 20:08:46,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:46,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144166221] [2024-09-11 20:08:46,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:46,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-11 20:08:46,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424407194] [2024-09-11 20:08:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:46,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:08:46,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:08:46,680 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:08:46,681 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:08:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:08:46,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-11 20:08:46,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:08:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 36 proven. 47 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-09-11 20:08:47,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:08:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:08:56,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144166221] [2024-09-11 20:08:56,707 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-11 20:08:56,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424407194] [2024-09-11 20:08:56,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424407194] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:08:56,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-11 20:08:56,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-09-11 20:08:56,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788261762] [2024-09-11 20:08:56,708 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-11 20:08:56,709 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 20:08:56,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:08:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 20:08:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=372, Unknown=2, NotChecked=0, Total=462 [2024-09-11 20:08:56,711 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2024-09-11 20:08:57,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:08:57,181 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2024-09-11 20:08:57,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:08:57,181 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 81 [2024-09-11 20:08:57,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:08:57,182 INFO L225 Difference]: With dead ends: 107 [2024-09-11 20:08:57,182 INFO L226 Difference]: Without dead ends: 79 [2024-09-11 20:08:57,183 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=149, Invalid=605, Unknown=2, NotChecked=0, Total=756 [2024-09-11 20:08:57,184 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 25 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:08:57,184 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 180 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:08:57,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-11 20:08:57,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-09-11 20:08:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 50 states have internal predecessors, (50), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-11 20:08:57,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-09-11 20:08:57,203 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 81 [2024-09-11 20:08:57,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:08:57,203 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-09-11 20:08:57,204 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 14 states have internal predecessors, (27), 7 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2024-09-11 20:08:57,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:57,204 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-09-11 20:08:57,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-09-11 20:08:57,205 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:08:57,205 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:08:57,213 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:08:57,406 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-11 20:08:57,406 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:08:57,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:08:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash -176761415, now seen corresponding path program 1 times [2024-09-11 20:08:57,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:08:57,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192708223] [2024-09-11 20:08:57,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:08:57,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:08:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:09:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:09:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:09:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,186 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:09:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:09:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:09:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:09:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,258 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:09:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,282 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:09:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:09:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:09:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,411 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-11 20:09:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,416 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-11 20:09:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-09-11 20:09:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:09:09,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192708223] [2024-09-11 20:09:09,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192708223] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:09:09,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171457893] [2024-09-11 20:09:09,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:09,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:09:09,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:09:09,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:09:09,422 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 20:09:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:09,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 20:09:09,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:09:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 39 proven. 10 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-11 20:09:09,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:09:09,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171457893] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:09:09,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:09:09,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2024-09-11 20:09:09,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908384970] [2024-09-11 20:09:09,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:09:09,848 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 20:09:09,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:09:09,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 20:09:09,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:09:09,849 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2024-09-11 20:09:18,701 WARN L293 SmtUtils]: Spent 8.53s on a formula simplification. DAG size of input: 83 DAG size of output: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-11 20:09:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:09:21,131 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2024-09-11 20:09:21,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:09:21,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) Word has length 81 [2024-09-11 20:09:21,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:09:21,132 INFO L225 Difference]: With dead ends: 93 [2024-09-11 20:09:21,133 INFO L226 Difference]: Without dead ends: 71 [2024-09-11 20:09:21,133 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-09-11 20:09:21,133 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-09-11 20:09:21,134 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 211 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-09-11 20:09:21,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-11 20:09:21,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-09-11 20:09:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.0) internal successors, (45), 45 states have internal predecessors, (45), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-09-11 20:09:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2024-09-11 20:09:21,158 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 81 [2024-09-11 20:09:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:09:21,158 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2024-09-11 20:09:21,159 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 11 states have internal predecessors, (35), 7 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (19), 8 states have call predecessors, (19), 7 states have call successors, (19) [2024-09-11 20:09:21,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2024-09-11 20:09:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-09-11 20:09:21,160 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:09:21,160 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:09:21,177 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-11 20:09:21,361 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:09:21,361 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:09:21,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1047816948, now seen corresponding path program 1 times [2024-09-11 20:09:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:09:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875846983] [2024-09-11 20:09:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:09:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,829 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:09:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 20:09:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 20:09:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:09:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-09-11 20:09:21,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-11 20:09:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 20:09:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 20:09:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-09-11 20:09:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,867 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-09-11 20:09:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-09-11 20:09:21,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-11 20:09:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,886 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-11 20:09:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-09-11 20:09:21,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-11 20:09:21,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:09:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875846983] [2024-09-11 20:09:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875846983] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:09:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716624228] [2024-09-11 20:09:21,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:09:21,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:09:21,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:09:21,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:09:21,899 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 20:09:21,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:09:21,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-11 20:09:21,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:09:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 49 proven. 54 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2024-09-11 20:09:22,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:09:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 31 proven. 60 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-09-11 20:09:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716624228] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:09:25,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:09:25,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 17] total 35 [2024-09-11 20:09:25,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528394160] [2024-09-11 20:09:25,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:09:25,206 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-11 20:09:25,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:09:25,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-11 20:09:25,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2024-09-11 20:09:25,207 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 35 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 19 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 23 states have call predecessors, (39), 18 states have call successors, (39) [2024-09-11 20:09:25,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:09:25,975 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-09-11 20:09:25,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:09:25,975 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 19 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 23 states have call predecessors, (39), 18 states have call successors, (39) Word has length 86 [2024-09-11 20:09:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:09:25,976 INFO L225 Difference]: With dead ends: 71 [2024-09-11 20:09:25,976 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:09:25,977 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=259, Invalid=1381, Unknown=0, NotChecked=0, Total=1640 [2024-09-11 20:09:25,979 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-11 20:09:25,979 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 323 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-11 20:09:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:09:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:09:25,979 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:09:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:09:25,980 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2024-09-11 20:09:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:09:25,980 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:09:25,980 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 25 states have internal predecessors, (53), 19 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 23 states have call predecessors, (39), 18 states have call successors, (39) [2024-09-11 20:09:25,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:09:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:09:25,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:09:25,983 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:09:26,001 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 20:09:26,187 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:09:26,191 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:09:26,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:09:42,570 WARN L293 SmtUtils]: Spent 8.82s on a formula simplification. DAG size of input: 56 DAG size of output: 34 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-11 20:09:47,725 WARN L293 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 108 DAG size of output: 53 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-11 20:09:52,819 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:09:52,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:09:52 BoogieIcfgContainer [2024-09-11 20:09:52,837 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:09:52,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:09:52,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:09:52,837 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:09:52,838 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:08:34" (3/4) ... [2024-09-11 20:09:52,839 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:09:52,842 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-09-11 20:09:52,843 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 20:09:52,846 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-11 20:09:52,846 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 20:09:52,846 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:09:52,846 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:09:52,926 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:09:52,927 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:09:52,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:09:52,928 INFO L158 Benchmark]: Toolchain (without parser) took 78809.30ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 146.3MB in the beginning and 188.6MB in the end (delta: -42.3MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2024-09-11 20:09:52,928 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:09:52,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.21ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 133.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-11 20:09:52,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.26ms. Allocated memory is still 176.2MB. Free memory was 133.8MB in the beginning and 132.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:09:52,929 INFO L158 Benchmark]: Boogie Preprocessor took 42.76ms. Allocated memory is still 176.2MB. Free memory was 132.6MB in the beginning and 131.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:09:52,929 INFO L158 Benchmark]: RCFGBuilder took 327.46ms. Allocated memory is still 176.2MB. Free memory was 131.3MB in the beginning and 145.3MB in the end (delta: -14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-11 20:09:52,929 INFO L158 Benchmark]: TraceAbstraction took 78036.05ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 144.4MB in the beginning and 193.8MB in the end (delta: -49.4MB). Peak memory consumption was 158.0MB. Max. memory is 16.1GB. [2024-09-11 20:09:52,930 INFO L158 Benchmark]: Witness Printer took 90.39ms. Allocated memory is still 264.2MB. Free memory was 193.8MB in the beginning and 188.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 20:09:52,931 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.20ms. Allocated memory is still 176.2MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.21ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 133.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.26ms. Allocated memory is still 176.2MB. Free memory was 133.8MB in the beginning and 132.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.76ms. Allocated memory is still 176.2MB. Free memory was 132.6MB in the beginning and 131.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 327.46ms. Allocated memory is still 176.2MB. Free memory was 131.3MB in the beginning and 145.3MB in the end (delta: -14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 78036.05ms. Allocated memory was 176.2MB in the beginning and 264.2MB in the end (delta: 88.1MB). Free memory was 144.4MB in the beginning and 193.8MB in the end (delta: -49.4MB). Peak memory consumption was 158.0MB. Max. memory is 16.1GB. * Witness Printer took 90.39ms. Allocated memory is still 264.2MB. Free memory was 193.8MB in the beginning and 188.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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: 17]: 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, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.3s, OverallIterations: 10, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 1728 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1447 mSDsCounter, 209 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1896 IncrementalHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 209 mSolverCounterUnsat, 281 mSDtfsCounter, 1896 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 642 SyntacticMatches, 12 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 29.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=7, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 956 NumberOfCodeBlocks, 956 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 843 ConstructedInterpolants, 0 QuantifiedInterpolants, 6060 SizeOfPredicates, 26 NumberOfNonLiveVariables, 996 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 15 InterpolantComputations, 4 PerfectInterpolantSequences, 1607/1849 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: 46]: Loop Invariant Derived loop invariant: (((((((((r % 4294967296) <= 0) && (p == 1)) && (B == d)) && (q == 0)) && (A == r)) && ((d % 4294967296) == 1)) || ((((((d == 1) && (p == 1)) && ((A % 4294967296) == 1)) && ((B % 4294967296) == 1)) && (q == 1)) && (((long long) r + 1) == A))) || (((((((((A % 4294967296) <= 1) && (((B / 4294967296) * 4294967296) <= (d / 2))) && (2 == p)) && ((B % 4294967296) == 1)) && (q == 0)) && (((((d / 4294967296) * 4294967296) + d) + (8589934592 * (r / 4294967296))) < (((((((-1 + B) / 4294967296) * 4294967296) + ((B / 4294967296) * 4294967296)) + ((d / 8589934592) * 8589934592)) + ((long long) 2 * r)) + 1))) && (A == r)) && (((long long) (r % 4294967296) + 1) <= (d % 4294967296)))) - InvariantResult [Line: 61]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((((((((((A % 4294967296) <= 1) && (((B / 4294967296) * 4294967296) <= (d / 2))) && (2 == p)) && (q == 0)) && (A == r)) && (((d + (17179869184 * (r / 4294967296))) + ((((4294967295 + ((long long) -2 * r)) + d) / 4294967296) * 6442450944)) < (((((d / 2) + (8589934592 * ((((long long) -2 * B) + d) / 8589934592))) + r) + (17179869184 * (B / 4294967296))) + 1))) && ((d + ((r / 4294967296) * 12884901888)) <= (((((((B + r) + ((long long) -1 * d)) / 4294967296) * 4294967296) + ((B / 4294967296) * 4294967296)) + ((d / 8589934592) * 8589934592)) + ((long long) 2 * r)))) && (((long long) (r % 4294967296) + 1) <= (d % 4294967296))) || ((((((p == 1) && ((A % 4294967296) <= 1)) && (B == d)) && (q == 0)) && (A == r)) && ((d % 4294967296) == 1))) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (\old(cond) != 0) - ProcedureContractResult [Line: 14]: 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:09:53,065 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