This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 13:35:22,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 13:35:22,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 13:35:22,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 13:35:22,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 13:35:22,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 13:35:22,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 13:35:22,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 13:35:22,625 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 13:35:22,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 13:35:22,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 13:35:22,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 13:35:22,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 13:35:22,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 13:35:22,627 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 13:35:22,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 13:35:22,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 13:35:22,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 13:35:22,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 13:35:22,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 13:35:22,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 13:35:22,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 13:35:22,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 13:35:22,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 13:35:22,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 13:35:22,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 13:35:22,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 13:35:22,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 13:35:22,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 13:35:22,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 13:35:22,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 13:35:22,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 13:35:22,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:35:22,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 13:35:22,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 13:35:22,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 13:35:22,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 13:35:22,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 13:35:22,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 13:35:22,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 13:35:22,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 13:35:22,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 13:35:22,635 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-20 13:35:22,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:35:22,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:35:22,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:35:22,826 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-20 13:35:22,826 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-20 13:35:22,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../results/automizer-verification-files/SV-COMP24_unreach-call/fermat2-ll_valuebound1.yml/witness-2.1.yml [2024-09-20 13:35:22,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:35:22,861 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:35:22,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound1.c [2024-09-20 13:35:24,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:35:24,248 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:35:24,248 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_valuebound1.c [2024-09-20 13:35:24,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e78ffbcf8/2c8a977cf9134992bde4f9da290b136a/FLAGb23029ad8 [2024-09-20 13:35:24,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e78ffbcf8/2c8a977cf9134992bde4f9da290b136a [2024-09-20 13:35:24,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:35:24,267 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-20 13:35:24,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:35:24,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:35:24,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:35:24,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:35:22" (1/2) ... [2024-09-20 13:35:24,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d898b6 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:35:24, skipping insertion in model container [2024-09-20 13:35:24,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:35:22" (1/2) ... [2024-09-20 13:35:24,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7cc4ba7d and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.09 01:35:24, skipping insertion in model container [2024-09-20 13:35:24,277 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:35:24" (2/2) ... [2024-09-20 13:35:24,277 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43d898b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24, skipping insertion in model container [2024-09-20 13:35:24,277 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:35:24" (2/2) ... [2024-09-20 13:35:24,286 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-20 13:35:24,289 INFO L1541 ArrayList]: Loop invariant at [L35-L46] ((((__int128) v * 2) + ((__int128) u * u)) == (((((__int128) v * v) + ((__int128) u * 2)) + ((long long) A * 4)) + ((__int128) r * 4))) [2024-09-20 13:35:24,289 INFO L1541 ArrayList]: Function contract at [L11]: requires (1 <= \old(cond)), ensures (1 <= \old(cond)) [2024-09-20 13:35:24,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:35:24,411 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/fermat2-ll_valuebound1.c[524,537] [2024-09-20 13:35:24,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:35:24,434 INFO L200 MainTranslator]: Completed pre-run Start Parsing Global Start Parsing Global [2024-09-20 13:35:24,463 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/fermat2-ll_valuebound1.c[524,537] Start Parsing Local [2024-09-20 13:35:24,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:35:24,483 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:35:24,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24 WrapperNode [2024-09-20 13:35:24,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:35:24,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:35:24,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:35:24,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:35:24,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,511 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 44 [2024-09-20 13:35:24,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:35:24,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:35:24,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:35:24,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:35:24,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,537 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Procedure __VERIFIER_assert is not part of the Ultimate memory model but has specification other that is not a ModifiesSpecification [2024-09-20 13:35:24,538 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:35:24,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:35:24,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:35:24,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:35:24,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (1/1) ... [2024-09-20 13:35:24,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:35:24,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:35:24,579 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-20 13:35:24,582 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-20 13:35:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:35:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 13:35:24,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 13:35:24,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-20 13:35:24,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:35:24,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:35:24,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 13:35:24,622 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 13:35:24,670 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:35:24,671 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:35:24,802 WARN L783 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-09-20 13:35:24,834 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-09-20 13:35:24,836 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:35:24,862 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:35:24,863 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 13:35:24,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:35:24 BoogieIcfgContainer [2024-09-20 13:35:24,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:35:24,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:35:24,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:35:24,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:35:24,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness-2.1.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.09 01:35:22" (1/4) ... [2024-09-20 13:35:24,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b888858 and model type witness-2.1.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.09 01:35:24, skipping insertion in model container [2024-09-20 13:35:24,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:35:24" (2/4) ... [2024-09-20 13:35:24,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b888858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:35:24, skipping insertion in model container [2024-09-20 13:35:24,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:35:24" (3/4) ... [2024-09-20 13:35:24,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b888858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:35:24, skipping insertion in model container [2024-09-20 13:35:24,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:35:24" (4/4) ... [2024-09-20 13:35:24,873 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound1.c [2024-09-20 13:35:24,890 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:35:24,891 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-09-20 13:35:24,927 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:35:24,932 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;@76c9a5fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:35:24,933 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-20 13:35:24,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-20 13:35:24,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-20 13:35:24,943 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:35:24,943 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:35:24,944 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 2 more)] === [2024-09-20 13:35:24,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:35:24,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1685682563, now seen corresponding path program 1 times [2024-09-20 13:35:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:35:24,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453564816] [2024-09-20 13:35:24,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:35:24,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:35:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:25,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:35:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:25,081 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 13:35:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:25,088 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 13:35:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:25,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:35:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:25,106 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 13:35:25,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:35:25,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453564816] [2024-09-20 13:35:25,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453564816] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:35:25,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:35:25,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:35:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808443331] [2024-09-20 13:35:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:35:25,117 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 13:35:25,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:35:25,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 13:35:25,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 13:35:25,148 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 20 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 13:35:25,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:35:25,165 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2024-09-20 13:35:25,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 13:35:25,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2024-09-20 13:35:25,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:35:25,172 INFO L225 Difference]: With dead ends: 29 [2024-09-20 13:35:25,172 INFO L226 Difference]: Without dead ends: 27 [2024-09-20 13:35:25,173 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-20 13:35:25,176 INFO L434 NwaCegarLoop]: 31 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, 31 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-20 13:35:25,176 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:35:25,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-20 13:35:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-20 13:35:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 13:35:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-09-20 13:35:25,201 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 24 [2024-09-20 13:35:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:35:25,201 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-09-20 13:35:25,202 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-20 13:35:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-09-20 13:35:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-20 13:35:25,203 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:35:25,203 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:35:25,203 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:35:25,203 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 2 more)] === [2024-09-20 13:35:25,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:35:25,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1360942913, now seen corresponding path program 1 times [2024-09-20 13:35:25,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:35:25,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979094897] [2024-09-20 13:35:25,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:35:25,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:35:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:35:25,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2037389262] [2024-09-20 13:35:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:35:25,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:35:25,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:35:25,259 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:35:25,260 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 13:35:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:25,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-20 13:35:25,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:35:25,398 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 13:35:25,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:35:25,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:35:25,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979094897] [2024-09-20 13:35:25,399 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:35:25,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037389262] [2024-09-20 13:35:25,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037389262] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:35:25,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:35:25,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:35:25,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107167568] [2024-09-20 13:35:25,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:35:25,401 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:35:25,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:35:25,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:35:25,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:35:25,408 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 13:35:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:35:26,925 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-09-20 13:35:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:35:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2024-09-20 13:35:26,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:35:26,926 INFO L225 Difference]: With dead ends: 32 [2024-09-20 13:35:26,926 INFO L226 Difference]: Without dead ends: 32 [2024-09-20 13:35:26,926 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-20 13:35:26,927 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-09-20 13:35:26,927 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 46 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-09-20 13:35:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-20 13:35:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-20 13:35:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-20 13:35:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-09-20 13:35:26,932 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 24 [2024-09-20 13:35:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:35:26,933 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-09-20 13:35:26,933 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 13:35:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-09-20 13:35:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-20 13:35:26,934 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:35:26,934 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:35:26,945 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-20 13:35:27,135 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:35:27,136 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 2 more)] === [2024-09-20 13:35:27,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:35:27,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1727196550, now seen corresponding path program 1 times [2024-09-20 13:35:27,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:35:27,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668753624] [2024-09-20 13:35:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:35:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:35:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:35:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,298 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 13:35:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 13:35:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:35:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 13:35:27,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:35:27,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668753624] [2024-09-20 13:35:27,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668753624] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:35:27,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:35:27,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:35:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503681256] [2024-09-20 13:35:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:35:27,316 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:35:27,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:35:27,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:35:27,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:35:27,317 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 13:35:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:35:27,324 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2024-09-20 13:35:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:35:27,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2024-09-20 13:35:27,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:35:27,325 INFO L225 Difference]: With dead ends: 30 [2024-09-20 13:35:27,326 INFO L226 Difference]: Without dead ends: 30 [2024-09-20 13:35:27,326 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-20 13:35:27,326 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 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-20 13:35:27,327 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:35:27,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-20 13:35:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-20 13:35:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-20 13:35:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-09-20 13:35:27,331 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 29 [2024-09-20 13:35:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:35:27,331 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-09-20 13:35:27,331 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 13:35:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-09-20 13:35:27,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-20 13:35:27,332 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:35:27,332 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:35:27,332 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-20 13:35:27,332 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 2 more)] === [2024-09-20 13:35:27,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:35:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1727196389, now seen corresponding path program 1 times [2024-09-20 13:35:27,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:35:27,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742363275] [2024-09-20 13:35:27,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:35:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:35:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:35:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,390 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 13:35:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,392 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 13:35:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:35:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 13:35:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:35:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742363275] [2024-09-20 13:35:27,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742363275] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:35:27,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:35:27,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:35:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565217536] [2024-09-20 13:35:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:35:27,408 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:35:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:35:27,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:35:27,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-20 13:35:27,409 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 13:35:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:35:27,424 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-09-20 13:35:27,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:35:27,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2024-09-20 13:35:27,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:35:27,427 INFO L225 Difference]: With dead ends: 29 [2024-09-20 13:35:27,427 INFO L226 Difference]: Without dead ends: 29 [2024-09-20 13:35:27,428 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-20 13:35:27,428 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 47 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-20 13:35:27,429 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:35:27,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-20 13:35:27,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-20 13:35:27,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-20 13:35:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-09-20 13:35:27,432 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 29 [2024-09-20 13:35:27,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:35:27,432 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-09-20 13:35:27,433 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-20 13:35:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-09-20 13:35:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-20 13:35:27,433 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:35:27,434 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:35:27,434 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-20 13:35:27,434 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 2 more)] === [2024-09-20 13:35:27,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:35:27,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1199378437, now seen corresponding path program 1 times [2024-09-20 13:35:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:35:27,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516277420] [2024-09-20 13:35:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:35:27,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:35:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:35:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,586 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 13:35:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 13:35:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,594 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:35:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,599 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:35:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-20 13:35:27,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:35:27,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516277420] [2024-09-20 13:35:27,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516277420] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:35:27,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:35:27,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-20 13:35:27,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105881945] [2024-09-20 13:35:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:35:27,627 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-20 13:35:27,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:35:27,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-20 13:35:27,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:35:27,629 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 13:35:27,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:35:27,683 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-09-20 13:35:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-20 13:35:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2024-09-20 13:35:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:35:27,684 INFO L225 Difference]: With dead ends: 29 [2024-09-20 13:35:27,684 INFO L226 Difference]: Without dead ends: 28 [2024-09-20 13:35:27,685 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-20 13:35:27,685 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:35:27,687 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:35:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-09-20 13:35:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-09-20 13:35:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-20 13:35:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-09-20 13:35:27,692 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32 [2024-09-20 13:35:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:35:27,692 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-09-20 13:35:27,692 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-20 13:35:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-09-20 13:35:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-20 13:35:27,693 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:35:27,693 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:35:27,693 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-20 13:35:27,693 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 2 more)] === [2024-09-20 13:35:27,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:35:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1473975801, now seen corresponding path program 1 times [2024-09-20 13:35:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:35:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804041534] [2024-09-20 13:35:27,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:35:27,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:35:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-20 13:35:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-09-20 13:35:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,838 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-09-20 13:35:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-20 13:35:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-20 13:35:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:35:27,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:35:27,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804041534] [2024-09-20 13:35:27,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804041534] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-20 13:35:27,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893483509] [2024-09-20 13:35:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:35:27,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:35:27,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:35:27,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:35:27,880 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-20 13:35:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:27,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-20 13:35:27,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:35:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:35:28,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:35:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-20 13:35:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893483509] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:35:28,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-20 13:35:28,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-09-20 13:35:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135835580] [2024-09-20 13:35:28,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-20 13:35:28,177 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 13:35:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:35:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 13:35:28,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-20 13:35:28,178 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-20 13:35:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:35:28,279 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-09-20 13:35:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-20 13:35:28,279 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 33 [2024-09-20 13:35:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:35:28,280 INFO L225 Difference]: With dead ends: 32 [2024-09-20 13:35:28,280 INFO L226 Difference]: Without dead ends: 32 [2024-09-20 13:35:28,280 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-20 13:35:28,283 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:35:28,283 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:35:28,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-20 13:35:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-20 13:35:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-20 13:35:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2024-09-20 13:35:28,291 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 33 [2024-09-20 13:35:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:35:28,291 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2024-09-20 13:35:28,291 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-20 13:35:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2024-09-20 13:35:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-20 13:35:28,292 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:35:28,292 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:35:28,312 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-20 13:35:28,493 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-20 13:35:28,493 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION, ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (and 2 more)] === [2024-09-20 13:35:28,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:35:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1697041347, now seen corresponding path program 1 times [2024-09-20 13:35:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:35:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462409858] [2024-09-20 13:35:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:35:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:35:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:35:28,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [666920992] [2024-09-20 13:35:28,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:35:28,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:35:28,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:35:28,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:35:28,532 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-20 13:35:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:35:28,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-20 13:35:28,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:35:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-20 13:35:28,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:35:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-09-20 13:35:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:35:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462409858] [2024-09-20 13:35:28,790 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:35:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666920992] [2024-09-20 13:35:28,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666920992] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 13:35:28,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:35:28,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-09-20 13:35:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817087164] [2024-09-20 13:35:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:35:28,791 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-20 13:35:28,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:35:28,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-20 13:35:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:35:28,794 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 13:35:28,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:35:28,808 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2024-09-20 13:35:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-20 13:35:28,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 42 [2024-09-20 13:35:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:35:28,809 INFO L225 Difference]: With dead ends: 30 [2024-09-20 13:35:28,809 INFO L226 Difference]: Without dead ends: 0 [2024-09-20 13:35:28,809 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:35:28,810 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:35:28,810 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:35:28,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-20 13:35:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-20 13:35:28,811 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-20 13:35:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-20 13:35:28,811 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-09-20 13:35:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:35:28,811 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-20 13:35:28,811 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-09-20 13:35:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-20 13:35:28,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-20 13:35:28,813 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 5 remaining) [2024-09-20 13:35:28,814 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONPRE_CONDITION (3 of 5 remaining) [2024-09-20 13:35:28,814 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONPRE_CONDITION (2 of 5 remaining) [2024-09-20 13:35:28,814 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-09-20 13:35:28,814 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr1ENSURES_VIOLATIONPOST_CONDITION (0 of 5 remaining) [2024-09-20 13:35:28,826 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 13:35:29,014 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-20 13:35:29,017 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:35:29,018 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 13:35:29,020 INFO L469 ceAbstractionStarter]: Automizer considered 1 witness invariants [2024-09-20 13:35:29,020 INFO L470 ceAbstractionStarter]: WitnessConsidered=1 [2024-09-20 13:35:29,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:35:29 BoogieIcfgContainer [2024-09-20 13:35:29,020 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 13:35:29,021 INFO L158 Benchmark]: Toolchain (without parser) took 4753.56ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 123.7MB in the beginning and 187.8MB in the end (delta: -64.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:35:29,021 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 184.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:35:29,021 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:35:29,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.28ms. Allocated memory is still 184.5MB. Free memory was 123.7MB in the beginning and 109.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-20 13:35:29,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.10ms. Allocated memory is still 184.5MB. Free memory was 109.0MB in the beginning and 107.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:35:29,021 INFO L158 Benchmark]: Boogie Preprocessor took 36.56ms. Allocated memory is still 184.5MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 13:35:29,022 INFO L158 Benchmark]: RCFGBuilder took 312.84ms. Allocated memory is still 184.5MB. Free memory was 105.6MB in the beginning and 92.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 13:35:29,022 INFO L158 Benchmark]: TraceAbstraction took 4155.05ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 91.8MB in the beginning and 187.8MB in the end (delta: -96.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 13:35:29,025 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.11ms. Allocated memory is still 184.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.28ms. Allocated memory is still 184.5MB. Free memory was 123.7MB in the beginning and 109.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.10ms. Allocated memory is still 184.5MB. Free memory was 109.0MB in the beginning and 107.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.56ms. Allocated memory is still 184.5MB. Free memory was 107.7MB in the beginning and 105.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 312.84ms. Allocated memory is still 184.5MB. Free memory was 105.6MB in the beginning and 92.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4155.05ms. Allocated memory was 184.5MB in the beginning and 245.4MB in the end (delta: 60.8MB). Free memory was 91.8MB in the beginning and 187.8MB in the end (delta: -96.0MB). 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: 35]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 11]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 11]: procedure precondition always holds For all program executions holds that procedure precondition always holds at this location - PositiveResult [Line: 14]: 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: 11]: 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, 5 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 342 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 182 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 160 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 216 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 25, 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, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 966 SizeOfPredicates, 2 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 245/265 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 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-20 13:35:29,038 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...