./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --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/loop-invgen/sendmail-close-angle.i -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 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 --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 19:22:42,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:22:43,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:22:43,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:22:43,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:22:43,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:22:43,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:22:43,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:22:43,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:22:43,080 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:22:43,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:22:43,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:22:43,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:22:43,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:22:43,084 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:22:43,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:22:43,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:22:43,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:22:43,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:22:43,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:22:43,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:22:43,090 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:22:43,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:22:43,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:22:43,091 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:22:43,091 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:22:43,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:22:43,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:22:43,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:22:43,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:22:43,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:22:43,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:22:43,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:43,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:22:43,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:22:43,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:22:43,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:22:43,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:22:43,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:22:43,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:22:43,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:22:43,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:22:43,100 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 -> 4be4b344509b887bc91f2389f98de1e4ff745494aee0f078864fd49e79b0b4b8 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 19:22:43,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:22:43,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:22:43,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:22:43,355 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:22:43,355 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:22:43,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2024-09-11 19:22:44,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:22:44,970 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:22:44,971 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2024-09-11 19:22:44,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/034f327b1/227c8aade927484fb1148e9e0300a360/FLAG883676db7 [2024-09-11 19:22:44,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/034f327b1/227c8aade927484fb1148e9e0300a360 [2024-09-11 19:22:45,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:22:45,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:22:45,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:45,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:22:45,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:22:45,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:44" (1/1) ... [2024-09-11 19:22:45,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@455fbf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45, skipping insertion in model container [2024-09-11 19:22:45,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:22:44" (1/1) ... [2024-09-11 19:22:45,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:22:45,203 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/loop-invgen/sendmail-close-angle.i[893,906] [2024-09-11 19:22:45,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:45,228 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:22:45,238 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/loop-invgen/sendmail-close-angle.i[893,906] [2024-09-11 19:22:45,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:22:45,266 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:22:45,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45 WrapperNode [2024-09-11 19:22:45,266 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:22:45,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:45,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:22:45,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:22:45,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,299 INFO L138 Inliner]: procedures = 16, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2024-09-11 19:22:45,300 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:22:45,301 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:22:45,301 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:22:45,301 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:22:45,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,320 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 19:22:45,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,323 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:22:45,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:22:45,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:22:45,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:22:45,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (1/1) ... [2024-09-11 19:22:45,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:22:45,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:45,364 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 19:22:45,367 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 19:22:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:22:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:22:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:22:45,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:22:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-11 19:22:45,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-11 19:22:45,463 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:22:45,464 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:22:45,578 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-11 19:22:45,579 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:22:45,608 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:22:45,609 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-11 19:22:45,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:45 BoogieIcfgContainer [2024-09-11 19:22:45,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:22:45,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:22:45,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:22:45,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:22:45,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:22:44" (1/3) ... [2024-09-11 19:22:45,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7ea693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:45, skipping insertion in model container [2024-09-11 19:22:45,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:22:45" (2/3) ... [2024-09-11 19:22:45,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7ea693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:22:45, skipping insertion in model container [2024-09-11 19:22:45,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:45" (3/3) ... [2024-09-11 19:22:45,619 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2024-09-11 19:22:45,634 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:22:45,634 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:22:45,695 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:22:45,704 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;@2809bae3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:22:45,705 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:22:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 19:22:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-09-11 19:22:45,719 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:45,720 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:45,720 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:45,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1062398335, now seen corresponding path program 1 times [2024-09-11 19:22:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:45,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18322959] [2024-09-11 19:22:45,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:45,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:45,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:45,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:45,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18322959] [2024-09-11 19:22:45,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18322959] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:45,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:45,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-11 19:22:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118015753] [2024-09-11 19:22:45,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:45,901 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-11 19:22:45,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-11 19:22:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-11 19:22:45,926 INFO L87 Difference]: Start difference. First operand has 26 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 17 states have internal predecessors, (23), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:45,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:45,953 INFO L93 Difference]: Finished difference Result 48 states and 79 transitions. [2024-09-11 19:22:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-11 19:22:45,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-09-11 19:22:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:45,962 INFO L225 Difference]: With dead ends: 48 [2024-09-11 19:22:45,963 INFO L226 Difference]: Without dead ends: 23 [2024-09-11 19:22:45,965 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 19:22:45,968 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:45,969 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:22:45,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-11 19:22:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-11 19:22:46,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:22:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2024-09-11 19:22:46,050 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 9 [2024-09-11 19:22:46,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:46,051 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2024-09-11 19:22:46,054 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:46,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2024-09-11 19:22:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 19:22:46,058 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:46,058 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:46,059 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:22:46,059 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:46,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2013109713, now seen corresponding path program 1 times [2024-09-11 19:22:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:46,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768103781] [2024-09-11 19:22:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:46,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:46,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:46,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:46,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768103781] [2024-09-11 19:22:46,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768103781] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:46,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:46,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 19:22:46,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636653249] [2024-09-11 19:22:46,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:46,261 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:22:46,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:46,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:22:46,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 19:22:46,264 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:46,349 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-09-11 19:22:46,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:22:46,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-09-11 19:22:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:46,351 INFO L225 Difference]: With dead ends: 29 [2024-09-11 19:22:46,351 INFO L226 Difference]: Without dead ends: 27 [2024-09-11 19:22:46,351 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 19:22:46,353 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:46,355 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-11 19:22:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-11 19:22:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:22:46,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-09-11 19:22:46,368 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 10 [2024-09-11 19:22:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:46,368 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-09-11 19:22:46,369 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 19:22:46,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,369 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-09-11 19:22:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-11 19:22:46,370 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:46,370 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:46,371 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:22:46,371 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:46,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash -908723572, now seen corresponding path program 1 times [2024-09-11 19:22:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:46,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706849696] [2024-09-11 19:22:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:46,496 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 19:22:46,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706849696] [2024-09-11 19:22:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706849696] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:46,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579064187] [2024-09-11 19:22:46,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:46,508 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:46,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:46,511 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:46,643 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2024-09-11 19:22:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:22:46,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-09-11 19:22:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:46,646 INFO L225 Difference]: With dead ends: 42 [2024-09-11 19:22:46,646 INFO L226 Difference]: Without dead ends: 40 [2024-09-11 19:22:46,646 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 19:22:46,649 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:46,650 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 91 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-11 19:22:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-09-11 19:22:46,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 25 states have internal predecessors, (27), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 19:22:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-09-11 19:22:46,664 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 15 [2024-09-11 19:22:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:46,664 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-09-11 19:22:46,665 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 19:22:46,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-09-11 19:22:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-11 19:22:46,666 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:46,666 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:46,666 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 19:22:46,667 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:46,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2036104194, now seen corresponding path program 1 times [2024-09-11 19:22:46,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:46,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744048878] [2024-09-11 19:22:46,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:46,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:46,755 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:22:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:46,762 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:22:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:22:46,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:46,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744048878] [2024-09-11 19:22:46,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744048878] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:46,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:46,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 19:22:46,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151153224] [2024-09-11 19:22:46,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:46,780 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:22:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:46,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:22:46,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 19:22:46,781 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:22:46,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:46,890 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2024-09-11 19:22:46,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:22:46,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-09-11 19:22:46,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:46,892 INFO L225 Difference]: With dead ends: 48 [2024-09-11 19:22:46,893 INFO L226 Difference]: Without dead ends: 46 [2024-09-11 19:22:46,894 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:46,895 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:46,898 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 172 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:46,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-11 19:22:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2024-09-11 19:22:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 25 states have (on average 1.2) internal successors, (30), 28 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-09-11 19:22:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2024-09-11 19:22:46,910 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 22 [2024-09-11 19:22:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:46,910 INFO L474 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2024-09-11 19:22:46,911 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 19:22:46,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,911 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2024-09-11 19:22:46,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-11 19:22:46,912 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:46,912 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:46,913 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 19:22:46,913 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:46,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:46,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2030546205, now seen corresponding path program 1 times [2024-09-11 19:22:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:46,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884889834] [2024-09-11 19:22:46,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:46,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-11 19:22:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 19:22:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-11 19:22:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 19:22:47,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:47,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884889834] [2024-09-11 19:22:47,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884889834] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:47,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:47,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:22:47,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251071409] [2024-09-11 19:22:47,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:47,054 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:22:47,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:47,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:22:47,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:47,055 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 19:22:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:47,189 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2024-09-11 19:22:47,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:47,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-09-11 19:22:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:47,192 INFO L225 Difference]: With dead ends: 67 [2024-09-11 19:22:47,192 INFO L226 Difference]: Without dead ends: 60 [2024-09-11 19:22:47,200 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-11 19:22:47,202 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:47,202 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 78 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-11 19:22:47,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2024-09-11 19:22:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 38 states have internal predecessors, (40), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-11 19:22:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2024-09-11 19:22:47,216 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 26 [2024-09-11 19:22:47,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:47,217 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2024-09-11 19:22:47,217 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 19:22:47,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2024-09-11 19:22:47,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-11 19:22:47,218 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:47,218 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:47,219 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 19:22:47,219 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:47,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1313350375, now seen corresponding path program 1 times [2024-09-11 19:22:47,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:47,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508451457] [2024-09-11 19:22:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:22:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,331 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:22:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,336 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:22:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 19:22:47,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:47,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508451457] [2024-09-11 19:22:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508451457] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:22:47,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:22:47,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:22:47,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362351594] [2024-09-11 19:22:47,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:22:47,341 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:22:47,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:47,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:22:47,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:22:47,342 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 19:22:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:47,434 INFO L93 Difference]: Finished difference Result 68 states and 81 transitions. [2024-09-11 19:22:47,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:22:47,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2024-09-11 19:22:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:47,437 INFO L225 Difference]: With dead ends: 68 [2024-09-11 19:22:47,437 INFO L226 Difference]: Without dead ends: 66 [2024-09-11 19:22:47,438 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:22:47,438 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 28 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:47,439 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 134 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-11 19:22:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2024-09-11 19:22:47,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.131578947368421) internal successors, (43), 41 states have internal predecessors, (43), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-11 19:22:47,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2024-09-11 19:22:47,458 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 27 [2024-09-11 19:22:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:47,459 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-09-11 19:22:47,459 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-11 19:22:47,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:47,459 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2024-09-11 19:22:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 19:22:47,461 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:47,461 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:47,461 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 19:22:47,461 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:47,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:47,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1160009689, now seen corresponding path program 1 times [2024-09-11 19:22:47,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:47,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423469392] [2024-09-11 19:22:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:22:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:22:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:22:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 19:22:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,663 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-09-11 19:22:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,666 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-11 19:22:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-09-11 19:22:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-11 19:22:47,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423469392] [2024-09-11 19:22:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423469392] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933911952] [2024-09-11 19:22:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:47,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:47,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:47,676 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 19:22:47,680 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 19:22:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:47,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 19:22:47,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-11 19:22:48,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-11 19:22:48,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933911952] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:48,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-09-11 19:22:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200668883] [2024-09-11 19:22:48,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:48,182 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-11 19:22:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:48,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-11 19:22:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-09-11 19:22:48,183 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-09-11 19:22:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:48,490 INFO L93 Difference]: Finished difference Result 99 states and 130 transitions. [2024-09-11 19:22:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 19:22:48,491 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 50 [2024-09-11 19:22:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:48,492 INFO L225 Difference]: With dead ends: 99 [2024-09-11 19:22:48,493 INFO L226 Difference]: Without dead ends: 84 [2024-09-11 19:22:48,493 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-09-11 19:22:48,494 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:48,494 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 140 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:22:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-11 19:22:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-09-11 19:22:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 52 states have internal predecessors, (54), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-11 19:22:48,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2024-09-11 19:22:48,513 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 50 [2024-09-11 19:22:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:48,513 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-09-11 19:22:48,514 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-09-11 19:22:48,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2024-09-11 19:22:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-11 19:22:48,515 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:48,515 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:48,533 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 19:22:48,716 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 19:22:48,716 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:48,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1190365469, now seen corresponding path program 1 times [2024-09-11 19:22:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:48,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962736706] [2024-09-11 19:22:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:48,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:22:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:22:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:22:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,836 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 19:22:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 19:22:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 19:22:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 19:22:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-11 19:22:48,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:48,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962736706] [2024-09-11 19:22:48,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962736706] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:48,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967802220] [2024-09-11 19:22:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:48,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:48,886 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 19:22:48,888 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 19:22:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:48,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 19:22:48,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-11 19:22:49,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-09-11 19:22:49,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967802220] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:49,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:49,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-09-11 19:22:49,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832320945] [2024-09-11 19:22:49,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:49,212 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 19:22:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:49,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 19:22:49,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-09-11 19:22:49,214 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-09-11 19:22:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:49,337 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2024-09-11 19:22:49,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 19:22:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 51 [2024-09-11 19:22:49,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:49,340 INFO L225 Difference]: With dead ends: 88 [2024-09-11 19:22:49,340 INFO L226 Difference]: Without dead ends: 86 [2024-09-11 19:22:49,341 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-09-11 19:22:49,341 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 29 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:49,341 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 228 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:22:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-11 19:22:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-09-11 19:22:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 55 states have internal predecessors, (57), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-11 19:22:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2024-09-11 19:22:49,369 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 51 [2024-09-11 19:22:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:49,370 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2024-09-11 19:22:49,370 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 7 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-09-11 19:22:49,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2024-09-11 19:22:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-09-11 19:22:49,372 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:49,372 INFO L216 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:49,389 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 19:22:49,573 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:49,573 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:49,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:49,574 INFO L85 PathProgramCache]: Analyzing trace with hash 813879981, now seen corresponding path program 2 times [2024-09-11 19:22:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074027156] [2024-09-11 19:22:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:22:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:22:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,800 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:22:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 19:22:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 19:22:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 19:22:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 19:22:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-11 19:22:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:22:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 19:22:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-11 19:22:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:49,862 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 48 proven. 28 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-09-11 19:22:49,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:49,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074027156] [2024-09-11 19:22:49,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074027156] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:49,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998954488] [2024-09-11 19:22:49,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:22:49,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:49,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:49,864 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 19:22:49,866 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 19:22:49,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:22:49,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:22:49,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-11 19:22:49,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:50,161 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 19:22:50,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 22 proven. 24 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-09-11 19:22:50,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998954488] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:50,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:50,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2024-09-11 19:22:50,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948333384] [2024-09-11 19:22:50,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:50,320 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 19:22:50,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:50,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 19:22:50,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-09-11 19:22:50,321 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 11 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-09-11 19:22:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:50,652 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2024-09-11 19:22:50,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 19:22:50,653 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 11 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) Word has length 75 [2024-09-11 19:22:50,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:50,655 INFO L225 Difference]: With dead ends: 96 [2024-09-11 19:22:50,655 INFO L226 Difference]: Without dead ends: 94 [2024-09-11 19:22:50,655 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2024-09-11 19:22:50,656 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:50,656 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 141 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:22:50,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-11 19:22:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-09-11 19:22:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 58 states have internal predecessors, (60), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-09-11 19:22:50,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2024-09-11 19:22:50,692 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 75 [2024-09-11 19:22:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:50,692 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2024-09-11 19:22:50,692 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 11 states have call successors, (34), 3 states have call predecessors, (34), 2 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2024-09-11 19:22:50,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2024-09-11 19:22:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-09-11 19:22:50,694 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:22:50,695 INFO L216 NwaCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:50,711 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-11 19:22:50,895 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-09-11 19:22:50,896 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:22:50,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:50,897 INFO L85 PathProgramCache]: Analyzing trace with hash -239313979, now seen corresponding path program 2 times [2024-09-11 19:22:50,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:22:50,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019390295] [2024-09-11 19:22:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:22:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:22:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,183 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-11 19:22:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,186 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-11 19:22:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,190 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 19:22:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 19:22:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,205 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-11 19:22:51,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-11 19:22:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-11 19:22:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-11 19:22:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-11 19:22:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-11 19:22:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-09-11 19:22:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-09-11 19:22:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-09-11 19:22:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,283 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-09-11 19:22:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,285 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-09-11 19:22:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:22:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 56 proven. 46 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-09-11 19:22:51,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:22:51,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019390295] [2024-09-11 19:22:51,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019390295] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:22:51,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102429870] [2024-09-11 19:22:51,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:22:51,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:51,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:22:51,291 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 19:22:51,292 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 19:22:51,349 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:22:51,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:22:51,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-11 19:22:51,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:22:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 64 proven. 67 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-09-11 19:22:51,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:22:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 71 proven. 60 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-09-11 19:22:51,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102429870] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:22:51,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:22:51,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 20 [2024-09-11 19:22:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113433247] [2024-09-11 19:22:51,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:22:51,743 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-11 19:22:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:22:51,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-11 19:22:51,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2024-09-11 19:22:51,745 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) [2024-09-11 19:22:52,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:22:52,104 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2024-09-11 19:22:52,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 19:22:52,105 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) Word has length 98 [2024-09-11 19:22:52,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:22:52,105 INFO L225 Difference]: With dead ends: 101 [2024-09-11 19:22:52,106 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 19:22:52,107 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2024-09-11 19:22:52,107 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:22:52,107 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 281 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:22:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 19:22:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 19:22:52,108 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 19:22:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 19:22:52,109 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 98 [2024-09-11 19:22:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:22:52,109 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 19:22:52,109 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 11 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 10 states have call predecessors, (25), 11 states have call successors, (25) [2024-09-11 19:22:52,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:22:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 19:22:52,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 19:22:52,112 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 19:22:52,129 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 19:22:52,313 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:22:52,317 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-09-11 19:22:52,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 19:22:53,460 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 19:22:53,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 07:22:53 BoogieIcfgContainer [2024-09-11 19:22:53,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 19:22:53,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 19:22:53,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 19:22:53,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 19:22:53,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:22:45" (3/4) ... [2024-09-11 19:22:53,477 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 19:22:53,481 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-11 19:22:53,485 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-11 19:22:53,486 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-11 19:22:53,486 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 19:22:53,486 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 19:22:53,570 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 19:22:53,570 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 19:22:53,570 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 19:22:53,571 INFO L158 Benchmark]: Toolchain (without parser) took 8569.73ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 59.0MB in the beginning and 148.5MB in the end (delta: -89.6MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-09-11 19:22:53,571 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:22:53,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.46ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 58.8MB in the beginning and 122.6MB in the end (delta: -63.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-11 19:22:53,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.54ms. Allocated memory is still 157.3MB. Free memory was 122.6MB in the beginning and 120.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 19:22:53,572 INFO L158 Benchmark]: Boogie Preprocessor took 28.54ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 119.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 19:22:53,572 INFO L158 Benchmark]: RCFGBuilder took 279.50ms. Allocated memory is still 157.3MB. Free memory was 119.3MB in the beginning and 105.8MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-11 19:22:53,573 INFO L158 Benchmark]: TraceAbstraction took 7863.11ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 105.8MB in the beginning and 153.8MB in the end (delta: -47.9MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. [2024-09-11 19:22:53,573 INFO L158 Benchmark]: Witness Printer took 95.44ms. Allocated memory is still 226.5MB. Free memory was 153.8MB in the beginning and 148.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 19:22:53,575 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.19ms. Allocated memory is still 130.0MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.46ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 58.8MB in the beginning and 122.6MB in the end (delta: -63.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.54ms. Allocated memory is still 157.3MB. Free memory was 122.6MB in the beginning and 120.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.54ms. Allocated memory is still 157.3MB. Free memory was 120.5MB in the beginning and 119.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 279.50ms. Allocated memory is still 157.3MB. Free memory was 119.3MB in the beginning and 105.8MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7863.11ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 105.8MB in the beginning and 153.8MB in the end (delta: -47.9MB). Peak memory consumption was 110.3MB. Max. memory is 16.1GB. * Witness Printer took 95.44ms. Allocated memory is still 226.5MB. Free memory was 153.8MB in the beginning and 148.5MB 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: 19]: 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 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 302 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 1363 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1102 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1048 IncrementalHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 261 mSDtfsCounter, 1048 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 748 GetRequests, 608 SyntacticMatches, 18 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=9, InterpolantAutomatonStates: 85, 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, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 913 ConstructedInterpolants, 0 QuantifiedInterpolants, 2953 SizeOfPredicates, 14 NumberOfNonLiveVariables, 600 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 2623/2902 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: 37]: Loop Invariant Derived loop invariant: ((((((buf == 0) && (bufferlen == (2 + buflim))) && (0 <= buflim)) && ((3 + buflim) <= inlen)) && (in == 0)) || (((((((bufferlen + in) + 1) <= (buf + inlen)) && (bufferlen == (2 + buflim))) && (1 <= in)) && (buf <= buflim)) && (0 <= buf))) - InvariantResult [Line: 25]: Location Invariant Derived location invariant: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Requires: (\old(cond) != 0) Ensures: (\old(cond) != 0) RESULT: Ultimate proved your program to be correct! [2024-09-11 19:22:53,604 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