./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 04d6fb36 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/SpamAssassin-loop.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 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 18:41:55,150 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 18:41:55,214 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 18:41:55,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 18:41:55,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 18:41:55,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 18:41:55,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 18:41:55,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 18:41:55,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 18:41:55,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 18:41:55,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 18:41:55,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 18:41:55,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 18:41:55,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 18:41:55,247 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 18:41:55,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 18:41:55,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 18:41:55,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 18:41:55,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 18:41:55,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 18:41:55,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 18:41:55,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 18:41:55,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 18:41:55,250 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 18:41:55,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 18:41:55,250 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 18:41:55,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 18:41:55,251 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 18:41:55,251 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 18:41:55,251 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 18:41:55,251 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 18:41:55,251 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 18:41:55,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 18:41:55,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 18:41:55,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 18:41:55,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 18:41:55,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 18:41:55,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 18:41:55,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 18:41:55,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 18:41:55,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 18:41:55,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 18:41:55,254 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ad27fb086e75bf8f5b08286d8e766d07abfe44ff39234568924cf55ade7a6d5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-15 18:41:55,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 18:41:55,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 18:41:55,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 18:41:55,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 18:41:55,533 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 18:41:55,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-09-15 18:41:56,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 18:41:57,055 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 18:41:57,056 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i [2024-09-15 18:41:57,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4085c0223/1dcfa0af3ded45449050ff4c09b4f4a8/FLAGf8ff483f8 [2024-09-15 18:41:57,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4085c0223/1dcfa0af3ded45449050ff4c09b4f4a8 [2024-09-15 18:41:57,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 18:41:57,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-15 18:41:57,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 18:41:57,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 18:41:57,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 18:41:57,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24eced54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57, skipping insertion in model container [2024-09-15 18:41:57,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 18:41:57,623 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i[893,906] [2024-09-15 18:41:57,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 18:41:57,653 INFO L200 MainTranslator]: Completed pre-run [2024-09-15 18:41:57,662 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loop-invgen/SpamAssassin-loop.i[893,906] [2024-09-15 18:41:57,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 18:41:57,682 INFO L204 MainTranslator]: Completed translation [2024-09-15 18:41:57,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57 WrapperNode [2024-09-15 18:41:57,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 18:41:57,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 18:41:57,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 18:41:57,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 18:41:57,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,700 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-15 18:41:57,700 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 18:41:57,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 18:41:57,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 18:41:57,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 18:41:57,709 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,729 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-15 18:41:57,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 18:41:57,742 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 18:41:57,743 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 18:41:57,743 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 18:41:57,744 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (1/1) ... [2024-09-15 18:41:57,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 18:41:57,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 18:41:57,770 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-15 18:41:57,772 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-15 18:41:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 18:41:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-15 18:41:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-15 18:41:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-15 18:41:57,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-15 18:41:57,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-15 18:41:57,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 18:41:57,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 18:41:57,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 18:41:57,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 18:41:57,877 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 18:41:57,879 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 18:41:58,055 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-09-15 18:41:58,055 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 18:41:58,070 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 18:41:58,071 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-15 18:41:58,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 06:41:58 BoogieIcfgContainer [2024-09-15 18:41:58,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 18:41:58,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 18:41:58,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 18:41:58,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 18:41:58,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 06:41:57" (1/3) ... [2024-09-15 18:41:58,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df9ef95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 06:41:58, skipping insertion in model container [2024-09-15 18:41:58,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 06:41:57" (2/3) ... [2024-09-15 18:41:58,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df9ef95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 06:41:58, skipping insertion in model container [2024-09-15 18:41:58,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 06:41:58" (3/3) ... [2024-09-15 18:41:58,080 INFO L112 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.i [2024-09-15 18:41:58,094 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 18:41:58,094 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-15 18:41:58,139 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 18:41:58,144 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;@5addef46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 18:41:58,145 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-15 18:41:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-15 18:41:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-15 18:41:58,156 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:41:58,157 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:41:58,158 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 18:41:58,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2120244100, now seen corresponding path program 1 times [2024-09-15 18:41:58,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:41:58,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128903926] [2024-09-15 18:41:58,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:41:58,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:41:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:58,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:41:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:58,410 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-15 18:41:58,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:41:58,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128903926] [2024-09-15 18:41:58,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128903926] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:41:58,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:41:58,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:41:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494899550] [2024-09-15 18:41:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:41:58,419 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:41:58,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:41:58,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:41:58,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:41:58,444 INFO L87 Difference]: Start difference. First operand has 42 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:41:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:41:58,589 INFO L93 Difference]: Finished difference Result 84 states and 147 transitions. [2024-09-15 18:41:58,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 18:41:58,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-15 18:41:58,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:41:58,596 INFO L225 Difference]: With dead ends: 84 [2024-09-15 18:41:58,596 INFO L226 Difference]: Without dead ends: 43 [2024-09-15 18:41:58,599 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-15 18:41:58,601 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:41:58,602 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 168 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:41:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-15 18:41:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-09-15 18:41:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-15 18:41:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2024-09-15 18:41:58,646 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 13 [2024-09-15 18:41:58,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:41:58,649 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2024-09-15 18:41:58,649 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:41:58,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:58,650 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2024-09-15 18:41:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-15 18:41:58,651 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:41:58,651 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:41:58,651 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 18:41:58,652 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 18:41:58,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2142200067, now seen corresponding path program 1 times [2024-09-15 18:41:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:41:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925731616] [2024-09-15 18:41:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:41:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:41:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:58,756 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:41:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:58,760 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-15 18:41:58,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:41:58,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925731616] [2024-09-15 18:41:58,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925731616] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:41:58,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:41:58,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:41:58,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079165274] [2024-09-15 18:41:58,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:41:58,766 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:41:58,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:41:58,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:41:58,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:41:58,768 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:41:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:41:58,850 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2024-09-15 18:41:58,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 18:41:58,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-15 18:41:58,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:41:58,853 INFO L225 Difference]: With dead ends: 56 [2024-09-15 18:41:58,854 INFO L226 Difference]: Without dead ends: 54 [2024-09-15 18:41:58,854 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-15 18:41:58,855 INFO L434 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:41:58,856 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 192 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:41:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-15 18:41:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2024-09-15 18:41:58,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-15 18:41:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 66 transitions. [2024-09-15 18:41:58,873 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 66 transitions. Word has length 13 [2024-09-15 18:41:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:41:58,873 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 66 transitions. [2024-09-15 18:41:58,873 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-15 18:41:58,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 66 transitions. [2024-09-15 18:41:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-15 18:41:58,874 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:41:58,875 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:41:58,875 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 18:41:58,875 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 18:41:58,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:58,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1866275752, now seen corresponding path program 1 times [2024-09-15 18:41:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:41:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484136799] [2024-09-15 18:41:58,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:41:58,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:41:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:58,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:41:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:58,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-15 18:41:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,012 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-15 18:41:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:41:59,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484136799] [2024-09-15 18:41:59,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484136799] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:41:59,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:41:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:41:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868842364] [2024-09-15 18:41:59,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:41:59,017 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:41:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:41:59,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:41:59,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:41:59,018 INFO L87 Difference]: Start difference. First operand 50 states and 66 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-15 18:41:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:41:59,121 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2024-09-15 18:41:59,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 18:41:59,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-09-15 18:41:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:41:59,124 INFO L225 Difference]: With dead ends: 56 [2024-09-15 18:41:59,124 INFO L226 Difference]: Without dead ends: 54 [2024-09-15 18:41:59,125 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-15 18:41:59,126 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 9 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:41:59,126 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:41:59,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-15 18:41:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-15 18:41:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 29 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-15 18:41:59,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2024-09-15 18:41:59,155 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 18 [2024-09-15 18:41:59,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:41:59,155 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2024-09-15 18:41:59,155 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-15 18:41:59,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:59,156 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2024-09-15 18:41:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-15 18:41:59,156 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:41:59,156 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:41:59,157 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 18:41:59,157 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 18:41:59,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:59,157 INFO L85 PathProgramCache]: Analyzing trace with hash -677095492, now seen corresponding path program 1 times [2024-09-15 18:41:59,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:41:59,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396730842] [2024-09-15 18:41:59,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:41:59,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:41:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:41:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-15 18:41:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-15 18:41:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,244 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-15 18:41:59,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:41:59,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396730842] [2024-09-15 18:41:59,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396730842] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:41:59,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:41:59,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 18:41:59,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570353841] [2024-09-15 18:41:59,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:41:59,246 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 18:41:59,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:41:59,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 18:41:59,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:41:59,247 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-15 18:41:59,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:41:59,377 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2024-09-15 18:41:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:41:59,378 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-15 18:41:59,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:41:59,379 INFO L225 Difference]: With dead ends: 60 [2024-09-15 18:41:59,379 INFO L226 Difference]: Without dead ends: 58 [2024-09-15 18:41:59,379 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-15 18:41:59,380 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 18 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:41:59,381 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 176 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:41:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-15 18:41:59,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-15 18:41:59,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-15 18:41:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-09-15 18:41:59,398 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 23 [2024-09-15 18:41:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:41:59,398 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-09-15 18:41:59,398 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-15 18:41:59,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-09-15 18:41:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-15 18:41:59,400 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:41:59,400 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, 1] [2024-09-15 18:41:59,400 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 18:41:59,400 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 18:41:59,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:59,400 INFO L85 PathProgramCache]: Analyzing trace with hash 480288744, now seen corresponding path program 1 times [2024-09-15 18:41:59,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:41:59,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326932245] [2024-09-15 18:41:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:41:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:41:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:41:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,482 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-15 18:41:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-15 18:41:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,491 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-15 18:41:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,494 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-15 18:41:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:41:59,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326932245] [2024-09-15 18:41:59,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326932245] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:41:59,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:41:59,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 18:41:59,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369597923] [2024-09-15 18:41:59,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:41:59,495 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-15 18:41:59,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:41:59,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-15 18:41:59,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-15 18:41:59,496 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-15 18:41:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:41:59,562 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-09-15 18:41:59,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-15 18:41:59,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2024-09-15 18:41:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:41:59,564 INFO L225 Difference]: With dead ends: 64 [2024-09-15 18:41:59,564 INFO L226 Difference]: Without dead ends: 62 [2024-09-15 18:41:59,564 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-15 18:41:59,565 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 18:41:59,565 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 140 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 18:41:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-15 18:41:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-09-15 18:41:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-15 18:41:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2024-09-15 18:41:59,576 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 28 [2024-09-15 18:41:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:41:59,576 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2024-09-15 18:41:59,576 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-15 18:41:59,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:59,577 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2024-09-15 18:41:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-15 18:41:59,577 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:41:59,578 INFO L216 NwaCegarLoop]: trace histogram [7, 6, 6, 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, 1] [2024-09-15 18:41:59,578 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 18:41:59,578 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 18:41:59,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:59,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1289134347, now seen corresponding path program 1 times [2024-09-15 18:41:59,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:41:59,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969644071] [2024-09-15 18:41:59,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:41:59,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:41:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:41:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-15 18:41:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-15 18:41:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-15 18:41:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-15 18:41:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-15 18:41:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-15 18:41:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-09-15 18:41:59,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:41:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969644071] [2024-09-15 18:41:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969644071] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:41:59,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:41:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-15 18:41:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123088991] [2024-09-15 18:41:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:41:59,671 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 18:41:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:41:59,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 18:41:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-15 18:41:59,673 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-15 18:41:59,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:41:59,756 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2024-09-15 18:41:59,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 18:41:59,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2024-09-15 18:41:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:41:59,758 INFO L225 Difference]: With dead ends: 74 [2024-09-15 18:41:59,758 INFO L226 Difference]: Without dead ends: 72 [2024-09-15 18:41:59,758 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:41:59,758 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:41:59,759 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 153 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:41:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-15 18:41:59,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-09-15 18:41:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-15 18:41:59,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-09-15 18:41:59,776 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 46 [2024-09-15 18:41:59,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:41:59,777 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-09-15 18:41:59,778 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-09-15 18:41:59,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:59,779 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-09-15 18:41:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-09-15 18:41:59,781 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:41:59,782 INFO L216 NwaCegarLoop]: trace histogram [9, 8, 8, 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, 1, 1, 1, 1, 1] [2024-09-15 18:41:59,782 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-15 18:41:59,782 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 18:41:59,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:41:59,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1802436875, now seen corresponding path program 1 times [2024-09-15 18:41:59,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:41:59,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959749585] [2024-09-15 18:41:59,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:41:59,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:41:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,871 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:41:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,873 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-15 18:41:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,878 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-15 18:41:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-15 18:41:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,884 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-15 18:41:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-15 18:41:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-15 18:41:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,898 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-15 18:41:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,901 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-15 18:41:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:41:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-09-15 18:41:59,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:41:59,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959749585] [2024-09-15 18:41:59,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959749585] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:41:59,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:41:59,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-15 18:41:59,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645519829] [2024-09-15 18:41:59,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:41:59,904 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-15 18:41:59,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:41:59,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-15 18:41:59,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-15 18:41:59,905 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-15 18:42:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:00,004 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2024-09-15 18:42:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-15 18:42:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 56 [2024-09-15 18:42:00,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:00,005 INFO L225 Difference]: With dead ends: 73 [2024-09-15 18:42:00,006 INFO L226 Difference]: Without dead ends: 71 [2024-09-15 18:42:00,006 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 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-15 18:42:00,007 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 18 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:00,007 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 170 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-15 18:42:00,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-09-15 18:42:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 40 states have (on average 1.1) internal successors, (44), 41 states have internal predecessors, (44), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-15 18:42:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2024-09-15 18:42:00,022 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 56 [2024-09-15 18:42:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:00,023 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-09-15 18:42:00,023 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-09-15 18:42:00,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2024-09-15 18:42:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-09-15 18:42:00,031 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 18:42:00,031 INFO L216 NwaCegarLoop]: trace histogram [11, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:00,031 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-15 18:42:00,032 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-15 18:42:00,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:00,032 INFO L85 PathProgramCache]: Analyzing trace with hash 904022327, now seen corresponding path program 1 times [2024-09-15 18:42:00,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 18:42:00,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785805020] [2024-09-15 18:42:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 18:42:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 18:42:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,175 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-15 18:42:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-15 18:42:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,184 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-09-15 18:42:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-15 18:42:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-15 18:42:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-15 18:42:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,206 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-09-15 18:42:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-15 18:42:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-15 18:42:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-09-15 18:42:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-15 18:42:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 18:42:00,229 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-09-15 18:42:00,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 18:42:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785805020] [2024-09-15 18:42:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785805020] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 18:42:00,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 18:42:00,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-15 18:42:00,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352974251] [2024-09-15 18:42:00,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 18:42:00,231 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-15 18:42:00,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 18:42:00,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-15 18:42:00,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-09-15 18:42:00,232 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-15 18:42:00,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 18:42:00,373 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2024-09-15 18:42:00,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-15 18:42:00,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 67 [2024-09-15 18:42:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 18:42:00,374 INFO L225 Difference]: With dead ends: 71 [2024-09-15 18:42:00,375 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 18:42:00,375 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-09-15 18:42:00,376 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 18 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 18:42:00,377 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 155 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 18:42:00,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 18:42:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 18:42:00,380 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-15 18:42:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 18:42:00,380 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2024-09-15 18:42:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 18:42:00,380 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 18:42:00,381 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 4 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-09-15 18:42:00,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 18:42:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 18:42:00,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 18:42:00,383 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-15 18:42:00,384 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-15 18:42:00,386 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 18:42:00,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-15 18:42:00,739 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 18:42:00,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 06:42:00 BoogieIcfgContainer [2024-09-15 18:42:00,757 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 18:42:00,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-15 18:42:00,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-15 18:42:00,758 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-15 18:42:00,758 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 06:41:58" (3/4) ... [2024-09-15 18:42:00,760 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-15 18:42:00,763 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-15 18:42:00,763 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-15 18:42:00,763 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-09-15 18:42:00,767 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-09-15 18:42:00,768 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-09-15 18:42:00,769 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-09-15 18:42:00,769 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-15 18:42:00,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-15 18:42:00,851 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-15 18:42:00,851 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-15 18:42:00,852 INFO L158 Benchmark]: Toolchain (without parser) took 3379.81ms. Allocated memory was 67.1MB in the beginning and 121.6MB in the end (delta: 54.5MB). Free memory was 48.2MB in the beginning and 96.2MB in the end (delta: -47.9MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-09-15 18:42:00,852 INFO L158 Benchmark]: CDTParser took 1.79ms. Allocated memory is still 67.1MB. Free memory was 43.4MB in the beginning and 43.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 18:42:00,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.85ms. Allocated memory is still 67.1MB. Free memory was 48.0MB in the beginning and 36.3MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-15 18:42:00,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 16.86ms. Allocated memory is still 67.1MB. Free memory was 36.1MB in the beginning and 35.2MB in the end (delta: 872.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 18:42:00,854 INFO L158 Benchmark]: Boogie Preprocessor took 40.77ms. Allocated memory is still 67.1MB. Free memory was 35.2MB in the beginning and 33.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 18:42:00,854 INFO L158 Benchmark]: RCFGBuilder took 329.36ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 33.3MB in the beginning and 72.6MB in the end (delta: -39.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-09-15 18:42:00,854 INFO L158 Benchmark]: TraceAbstraction took 2683.73ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 72.2MB in the beginning and 35.8MB in the end (delta: 36.4MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2024-09-15 18:42:00,854 INFO L158 Benchmark]: Witness Printer took 93.75ms. Allocated memory is still 121.6MB. Free memory was 35.8MB in the beginning and 96.2MB in the end (delta: -60.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 18:42:00,856 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.79ms. Allocated memory is still 67.1MB. Free memory was 43.4MB in the beginning and 43.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.85ms. Allocated memory is still 67.1MB. Free memory was 48.0MB in the beginning and 36.3MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 16.86ms. Allocated memory is still 67.1MB. Free memory was 36.1MB in the beginning and 35.2MB in the end (delta: 872.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.77ms. Allocated memory is still 67.1MB. Free memory was 35.2MB in the beginning and 33.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 329.36ms. Allocated memory was 67.1MB in the beginning and 100.7MB in the end (delta: 33.6MB). Free memory was 33.3MB in the beginning and 72.6MB in the end (delta: -39.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2683.73ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 72.2MB in the beginning and 35.8MB in the end (delta: 36.4MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * Witness Printer took 93.75ms. Allocated memory is still 121.6MB. Free memory was 35.8MB in the beginning and 96.2MB in the end (delta: -60.3MB). Peak memory consumption was 2.1MB. 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 4 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 1287 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 903 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 384 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 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: 35]: Loop Invariant Derived loop invariant: (((0 <= j) && (0 <= i)) && (((long long) limit + 4) <= bufsize)) - InvariantResult [Line: 56]: Location Invariant Derived location invariant: (((((((long long) i + 1) <= len) && (0 <= j)) && (((long long) 5 + j) <= bufsize)) && (0 <= i)) && (((long long) limit + 4) <= bufsize)) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((0 <= i) && (((long long) limit + 4) <= bufsize)) - 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-15 18:42:00,876 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