This is Ultimate 0.2.4-tmp.dk.referee-eval-04d6fb3-m [2024-09-15 20:15:27,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-15 20:15:28,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-15 20:15:28,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-15 20:15:28,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-15 20:15:28,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-15 20:15:28,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-15 20:15:28,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-15 20:15:28,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-15 20:15:28,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-15 20:15:28,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-15 20:15:28,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-15 20:15:28,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-15 20:15:28,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-15 20:15:28,077 INFO L153 SettingsManager]: * Use SBE=true [2024-09-15 20:15:28,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-15 20:15:28,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-15 20:15:28,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-15 20:15:28,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-15 20:15:28,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-15 20:15:28,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-15 20:15:28,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-15 20:15:28,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-15 20:15:28,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-15 20:15:28,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-15 20:15:28,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-15 20:15:28,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-15 20:15:28,082 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-15 20:15:28,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-15 20:15:28,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-15 20:15:28,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-15 20:15:28,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-15 20:15:28,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:15:28,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-15 20:15:28,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-15 20:15:28,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-15 20:15:28,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-15 20:15:28,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-15 20:15:28,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-15 20:15:28,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-15 20:15:28,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-15 20:15:28,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-15 20:15:28,085 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.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> None [2024-09-15 20:15:28,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-15 20:15:28,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-15 20:15:28,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-15 20:15:28,386 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-15 20:15:28,387 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-15 20:15:28,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/geo3-ll_valuebound1.yml/witness-2.1.yml [2024-09-15 20:15:28,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-15 20:15:28,439 INFO L274 PluginConnector]: CDTParser initialized [2024-09-15 20:15:28,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/geo3-ll_valuebound1.c [2024-09-15 20:15:29,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-15 20:15:30,015 INFO L384 CDTParser]: Found 1 translation units. [2024-09-15 20:15:30,016 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/geo3-ll_valuebound1.c [2024-09-15 20:15:30,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/77d453809/14a0f4a69590458facac6cc5dfaf5437/FLAGde5ed260e [2024-09-15 20:15:30,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/77d453809/14a0f4a69590458facac6cc5dfaf5437 [2024-09-15 20:15:30,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-15 20:15:30,037 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-15 20:15:30,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-15 20:15:30,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-15 20:15:30,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-15 20:15:30,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:15:28" (1/2) ... [2024-09-15 20:15:30,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc95f42 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:15:30, skipping insertion in model container [2024-09-15 20:15:30,045 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:15:28" (1/2) ... [2024-09-15 20:15:30,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2a5ae95a and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 15.09 08:15:30, skipping insertion in model container [2024-09-15 20:15:30,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:15:30" (2/2) ... [2024-09-15 20:15:30,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc95f42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30, skipping insertion in model container [2024-09-15 20:15:30,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.09 08:15:30" (2/2) ... [2024-09-15 20:15:30,053 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-15 20:15:30,054 INFO L1541 ArrayList]: Loop invariant at [L36-L45] ((((((0 <= k) && (k <= 1)) && (y == 1)) && (a == x)) && (c == 1)) && (((long long) a * z) == az)) [2024-09-15 20:15:30,054 INFO L1541 ArrayList]: Function contract at [L11]: requires null, ensures (\old(cond) != 0) [2024-09-15 20:15:30,054 INFO L1541 ArrayList]: Function contract at [L14]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-15 20:15:30,069 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-15 20:15:30,199 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/nla-digbench-scaling/geo3-ll_valuebound1.c[525,538] [2024-09-15 20:15:30,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:15:30,225 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global Start Parsing Global [2024-09-15 20:15:30,253 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/nla-digbench-scaling/geo3-ll_valuebound1.c[525,538] Start Parsing Local [2024-09-15 20:15:30,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-15 20:15:30,274 INFO L204 MainTranslator]: Completed translation [2024-09-15 20:15:30,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30 WrapperNode [2024-09-15 20:15:30,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-15 20:15:30,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-15 20:15:30,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-15 20:15:30,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-15 20:15:30,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,301 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 48 [2024-09-15 20:15:30,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-15 20:15:30,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-15 20:15:30,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-15 20:15:30,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-15 20:15:30,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,320 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure assume_abort_if_not is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-15 20:15:30,320 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,330 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-15 20:15:30,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-15 20:15:30,331 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-15 20:15:30,331 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-15 20:15:30,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (1/1) ... [2024-09-15 20:15:30,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-15 20:15:30,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-15 20:15:30,355 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 20:15:30,358 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 20:15:30,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-15 20:15:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-15 20:15:30,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-15 20:15:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-15 20:15:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-15 20:15:30,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-15 20:15:30,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-15 20:15:30,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-15 20:15:30,453 INFO L242 CfgBuilder]: Building ICFG [2024-09-15 20:15:30,455 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-15 20:15:30,607 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-15 20:15:30,636 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2024-09-15 20:15:30,636 INFO L291 CfgBuilder]: Performing block encoding [2024-09-15 20:15:30,664 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-15 20:15:30,664 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-15 20:15:30,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:15:30 BoogieIcfgContainer [2024-09-15 20:15:30,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-15 20:15:30,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-15 20:15:30,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-15 20:15:30,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-15 20:15:30,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 15.09 08:15:28" (1/4) ... [2024-09-15 20:15:30,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe0dbdd and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 15.09 08:15:30, skipping insertion in model container [2024-09-15 20:15:30,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.09 08:15:30" (2/4) ... [2024-09-15 20:15:30,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe0dbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:15:30, skipping insertion in model container [2024-09-15 20:15:30,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.09 08:15:30" (3/4) ... [2024-09-15 20:15:30,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe0dbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.09 08:15:30, skipping insertion in model container [2024-09-15 20:15:30,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.09 08:15:30" (4/4) ... [2024-09-15 20:15:30,674 INFO L112 eAbstractionObserver]: Analyzing ICFG geo3-ll_valuebound1.c [2024-09-15 20:15:30,689 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-15 20:15:30,690 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-09-15 20:15:30,730 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-15 20:15:30,745 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=None, 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;@388ab401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-15 20:15:30,745 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-15 20:15:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-15 20:15:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-15 20:15:30,754 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:15:30,754 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-15 20:15:30,755 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:15:30,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:15:30,762 INFO L85 PathProgramCache]: Analyzing trace with hash 94115827, now seen corresponding path program 1 times [2024-09-15 20:15:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:15:30,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317713942] [2024-09-15 20:15:30,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:15:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:15:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:30,882 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 20:15:30,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:15:30,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317713942] [2024-09-15 20:15:30,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317713942] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:15:30,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:15:30,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:15:30,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465327092] [2024-09-15 20:15:30,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:15:30,891 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-15 20:15:30,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:15:30,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-15 20:15:30,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 20:15:30,914 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:15:30,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:15:30,930 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-09-15 20:15:30,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-15 20:15:30,931 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-15 20:15:30,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:15:30,936 INFO L225 Difference]: With dead ends: 29 [2024-09-15 20:15:30,936 INFO L226 Difference]: Without dead ends: 27 [2024-09-15 20:15:30,937 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-15 20:15:30,939 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:15:30,940 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:15:30,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-15 20:15:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-15 20:15:30,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 20 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:15:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2024-09-15 20:15:30,962 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 5 [2024-09-15 20:15:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:15:30,963 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2024-09-15 20:15:30,963 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:15:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2024-09-15 20:15:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-09-15 20:15:30,963 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:15:30,964 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-09-15 20:15:30,964 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-15 20:15:30,964 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:15:30,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:15:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash 94115889, now seen corresponding path program 1 times [2024-09-15 20:15:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:15:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782645173] [2024-09-15 20:15:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:15:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:15:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,045 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 20:15:31,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:15:31,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782645173] [2024-09-15 20:15:31,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782645173] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:15:31,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:15:31,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:15:31,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056804448] [2024-09-15 20:15:31,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:15:31,047 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:15:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:15:31,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:15:31,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:15:31,048 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:15:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:15:31,092 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-09-15 20:15:31,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:15:31,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-09-15 20:15:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:15:31,094 INFO L225 Difference]: With dead ends: 26 [2024-09-15 20:15:31,094 INFO L226 Difference]: Without dead ends: 26 [2024-09-15 20:15:31,095 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:15:31,096 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:15:31,097 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:15:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-15 20:15:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-15 20:15:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 19 states have internal predecessors, (20), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:15:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-09-15 20:15:31,102 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 5 [2024-09-15 20:15:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:15:31,103 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-09-15 20:15:31,103 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-15 20:15:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-09-15 20:15:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-15 20:15:31,104 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:15:31,104 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:15:31,104 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-15 20:15:31,105 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:15:31,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:15:31,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1943477165, now seen corresponding path program 1 times [2024-09-15 20:15:31,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:15:31,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131466130] [2024-09-15 20:15:31,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:15:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:15:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,348 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:15:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:15:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,367 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-15 20:15:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-15 20:15:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:15:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131466130] [2024-09-15 20:15:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131466130] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:15:31,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:15:31,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-15 20:15:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119544402] [2024-09-15 20:15:31,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:15:31,424 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-15 20:15:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:15:31,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-15 20:15:31,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:15:31,426 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:15:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:15:31,494 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-09-15 20:15:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-15 20:15:31,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2024-09-15 20:15:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:15:31,495 INFO L225 Difference]: With dead ends: 24 [2024-09-15 20:15:31,495 INFO L226 Difference]: Without dead ends: 24 [2024-09-15 20:15:31,496 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-15 20:15:31,497 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-15 20:15:31,497 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-15 20:15:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-15 20:15:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-15 20:15:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:15:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-09-15 20:15:31,500 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2024-09-15 20:15:31,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:15:31,501 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-09-15 20:15:31,501 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:15:31,501 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-09-15 20:15:31,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-15 20:15:31,502 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:15:31,502 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:15:31,502 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-15 20:15:31,502 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:15:31,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:15:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1753815026, now seen corresponding path program 1 times [2024-09-15 20:15:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:15:31,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668005805] [2024-09-15 20:15:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:15:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:15:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:15:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:15:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-15 20:15:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,573 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 20:15:31,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:15:31,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668005805] [2024-09-15 20:15:31,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668005805] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:15:31,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:15:31,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:15:31,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072619240] [2024-09-15 20:15:31,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:15:31,574 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:15:31,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:15:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:15:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:15:31,575 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:15:31,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:15:31,582 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2024-09-15 20:15:31,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:15:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-15 20:15:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:15:31,583 INFO L225 Difference]: With dead ends: 22 [2024-09-15 20:15:31,583 INFO L226 Difference]: Without dead ends: 22 [2024-09-15 20:15:31,583 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:15:31,584 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:15:31,585 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:15:31,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-15 20:15:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-15 20:15:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:15:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-15 20:15:31,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 25 [2024-09-15 20:15:31,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:15:31,588 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-15 20:15:31,588 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:15:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-15 20:15:31,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-15 20:15:31,588 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:15:31,588 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:15:31,589 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-15 20:15:31,589 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:15:31,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:15:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1753814865, now seen corresponding path program 1 times [2024-09-15 20:15:31,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:15:31,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877109946] [2024-09-15 20:15:31,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:15:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:15:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,609 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:15:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,612 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:15:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-15 20:15:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 20:15:31,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:15:31,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877109946] [2024-09-15 20:15:31,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877109946] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:15:31,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:15:31,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-15 20:15:31,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892547398] [2024-09-15 20:15:31,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:15:31,616 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-15 20:15:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:15:31,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-15 20:15:31,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:15:31,617 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:15:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:15:31,626 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2024-09-15 20:15:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-15 20:15:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-09-15 20:15:31,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:15:31,633 INFO L225 Difference]: With dead ends: 21 [2024-09-15 20:15:31,633 INFO L226 Difference]: Without dead ends: 21 [2024-09-15 20:15:31,634 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-15 20:15:31,638 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:15:31,638 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:15:31,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-15 20:15:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-15 20:15:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-15 20:15:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-15 20:15:31,644 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2024-09-15 20:15:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:15:31,644 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-15 20:15:31,645 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-15 20:15:31,645 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-15 20:15:31,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-15 20:15:31,645 INFO L208 NwaCegarLoop]: Found error trace [2024-09-15 20:15:31,645 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-15 20:15:31,646 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-15 20:15:31,646 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 3 more)] === [2024-09-15 20:15:31,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-15 20:15:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash 378546074, now seen corresponding path program 1 times [2024-09-15 20:15:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-15 20:15:31,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213836369] [2024-09-15 20:15:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-15 20:15:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-15 20:15:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,682 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-15 20:15:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-15 20:15:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-15 20:15:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,689 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-09-15 20:15:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-15 20:15:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-15 20:15:31,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-15 20:15:31,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213836369] [2024-09-15 20:15:31,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213836369] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-15 20:15:31,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-15 20:15:31,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-15 20:15:31,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248298020] [2024-09-15 20:15:31,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-15 20:15:31,702 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-15 20:15:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-15 20:15:31,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-15 20:15:31,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:15:31,703 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-15 20:15:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-15 20:15:31,715 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-09-15 20:15:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-15 20:15:31,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2024-09-15 20:15:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-15 20:15:31,716 INFO L225 Difference]: With dead ends: 20 [2024-09-15 20:15:31,716 INFO L226 Difference]: Without dead ends: 0 [2024-09-15 20:15:31,716 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-15 20:15:31,717 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-15 20:15:31,717 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 42 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-15 20:15:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-15 20:15:31,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-15 20:15:31,718 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 20:15:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-15 20:15:31,718 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2024-09-15 20:15:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-15 20:15:31,718 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-15 20:15:31,718 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-15 20:15:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-15 20:15:31,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-15 20:15:31,720 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-09-15 20:15:31,721 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (4 of 6 remaining) [2024-09-15 20:15:31,721 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (3 of 6 remaining) [2024-09-15 20:15:31,721 INFO L785 garLoopResultBuilder]: Registering result SAFE for location assume_abort_if_notErr0ENSURES_VIOLATIONPOST_CONDITION (2 of 6 remaining) [2024-09-15 20:15:31,721 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-09-15 20:15:31,721 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 6 remaining) [2024-09-15 20:15:31,721 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-15 20:15:31,724 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-09-15 20:15:31,725 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-15 20:15:31,726 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-15 20:15:31,726 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-15 20:15:31,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.09 08:15:31 BoogieIcfgContainer [2024-09-15 20:15:31,727 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-15 20:15:31,728 INFO L158 Benchmark]: Toolchain (without parser) took 1690.74ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 47.3MB in the beginning and 78.8MB in the end (delta: -31.5MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2024-09-15 20:15:31,728 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 31.3MB in the beginning and 31.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:15:31,728 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 54.5MB. Free memory was 29.3MB in the beginning and 29.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:15:31,728 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.81ms. Allocated memory is still 88.1MB. Free memory was 47.1MB in the beginning and 59.9MB in the end (delta: -12.8MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-09-15 20:15:31,728 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.03ms. Allocated memory is still 88.1MB. Free memory was 59.8MB in the beginning and 58.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 20:15:31,729 INFO L158 Benchmark]: Boogie Preprocessor took 28.09ms. Allocated memory is still 88.1MB. Free memory was 58.1MB in the beginning and 56.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-15 20:15:31,729 INFO L158 Benchmark]: RCFGBuilder took 333.75ms. Allocated memory is still 88.1MB. Free memory was 56.7MB in the beginning and 43.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-15 20:15:31,729 INFO L158 Benchmark]: TraceAbstraction took 1061.31ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 43.0MB in the beginning and 78.8MB in the end (delta: -35.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-15 20:15:31,730 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 31.3MB in the beginning and 31.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.84ms. Allocated memory is still 54.5MB. Free memory was 29.3MB in the beginning and 29.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.81ms. Allocated memory is still 88.1MB. Free memory was 47.1MB in the beginning and 59.9MB in the end (delta: -12.8MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.03ms. Allocated memory is still 88.1MB. Free memory was 59.8MB in the beginning and 58.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.09ms. Allocated memory is still 88.1MB. Free memory was 58.1MB in the beginning and 56.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 333.75ms. Allocated memory is still 88.1MB. Free memory was 56.7MB in the beginning and 43.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1061.31ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 43.0MB in the beginning and 78.8MB in the end (delta: -35.8MB). There was no memory consumed. 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: 36]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 11]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - PositiveResult [Line: 17]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 14]: procedure postcondition always holds For all program executions holds that procedure postcondition always holds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 273 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 149 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 124 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 48/48 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-15 20:15:31,754 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...